Abstract:
A location technique is utilized where channel-model parameters are originally estimated prior to location taking place. Location then takes place using a first set of known-located nodes, and the channel-model parameters are updated based on the distances resulting from the location estimate. Once the channel-model parameters have been updated, location again takes place using a second set of known-located nodes, node distances are calculated based on the produced locations and the channel-model parameters are again updated. This process continues until no significant change is observed between the previous and the newly estimated location, or until a maximum number of iterations is reached.
Abstract:
A method and apparatus for determining the path loss model of an object within a wireless communication system is provided herein. During operation, a path loss model for a node is generated based on path loss values and corresponding numbers of neighbors of the said node. The path loss model is used to determine a relationship between path loss and distance. With this relationship established, distances to known-located nodes may be obtained by obtaining a path loss to the known-located node. From these distances, a node can then be located.
Abstract:
A method segments a video. Audio frames of the video are classified with labels. Dominant labels are assigned to successive time intervals of consecutive labels. A semantic description is constructed for sliding time windows of the successive time intervals, in which the sliding time windows overlap in time, and the semantic description for each time window is a transition matrix determined from the dominant labels of the time intervals. A marker is determined from the transition matrices, in which a frequency of occurrence of the marker is between a low frequency threshold and a high frequency threshold. Then, the video is segmented at the locations of the markers.
Abstract:
A method and apparatus for determining the location of a node within a communication system is provided herein. During operation, reference nodes (105) having known locations are utilized to locate "blind" nodes (104) whose location is to be determined. More particularly, a blind node (104) wishing to determine its location will measure a plurality of path losses between itself and a plurality of reference nodes (105). These reference nodes' locations will then be mathematically weighted by the path loss between these reference nodes (105) and the blind node (104). The location of the blind node (104) is a sum of the mathematically weighted reference nodes' locations.
Abstract:
A method for locating nodes in a multi-hop sensor network forms a rigid body (RB1, RB2, RB3) and, from the nodes, utilizes the rigid body to decide if a node is locatable. The method obtains a reduced order model (ROM) of the network by categorizing all of the nodes by location status, grouping them based upon the categorizations, and defining and identifying a rigid body from a group. The method further simplifies determinability of node location by forming the rigid body from the nodes based upon the categorized location status. To locate the nodes, the nodes are separated from one another into subsets dependent upon characteristics (100). Then, groups are formed from one subset (200) and the rigid body is formed from a group (300). The ROM is formed from the rigid body (400) and a location capability of the rigid body is evaluated based upon the ROM (500).
Abstract:
A location technique is utilized with a wireless communication system (100) where power measurements from various nodes (104,105) are weighted to determine anode's location. An iterative location process is executed where as more and more nodes (104,15) are heard from, a node (104,105) will re-locate itself in order to improve location accuracy.
Abstract:
A method and apparatus for determining the location of a node within a communication system is provided herein. During operation, reference nodes (1O5) having known locations are utilized to locate "blind" nodes (104) whose location is to be determined. More particularly, a blind node (104) wishing to determine its location will measure a plurality of path losses between itself and a plurality of reference nodes (105), These reference nodes' locations will then be mathematically weighted by the path loss between these reference nodes (105) and the blind node (104). The location of the blind node (104) is a sum of the mathematically weighted reference nodes' locations.
Abstract:
A method and system is provided for determining a location for each of a plurality of units, which is selected from one of multiple sets of locations, which are each estimated based upon different initial location estimates. The selected set of locations includes the set which has the minimum error value, where the error value is based on the aggregate of the differences between the range determined from the estimated locations and the measured range. By using different sets of initial location estimates, there is a greater chance that at least one of the sets of initial location estimates will avoid any local minimums and produce a more accurate estimate of unit locations.
Abstract:
A method and system is provided for determining a location for each of a plurality of units, which is selected from one of multiple sets of locations, which are each estimated based upon different initial location estimates. The selected set of locations includes the set which has the minimum error value, where the error value is based on the aggregate of the differences between the range determined from the estimated locations and the measured range. By using different sets of initial location estimates, there is a greater chance that at least one of the sets of initial location estimates will avoid any local minimums and produce a more accurate estimate of unit locations.
Abstract:
A method and apparatus for determining the relative locations of nodes in a wireless network is disclosed. A list of neighboring nodes of a master node of the wireless network is generated and, from this list, a list of independent nodes is generated. An adjacency table for the independent nodes is then generated by examining the neighbors of dependent nodes. Two independent nodes are determined to be adjacent nodes only if they are the only neighboring nodes of a dependent node. Relative locations of nodes in wireless network may be determined from the adjacency table.