Results 1 - 10
of
367
Moving Target Classification and Tracking from Real-time Video
, 1998
"... This paper describes an end-to-end method for extracting moving targets from a real-time video stream, classifying them into predefined categories according to imagebased properties, and then robustly tracking them. Moving targets are detected using the pixel wise difference between consecutive imag ..."
Abstract
-
Cited by 290 (6 self)
- Add to MetaCart
This paper describes an end-to-end method for extracting moving targets from a real-time video stream, classifying them into predefined categories according to imagebased properties, and then robustly tracking them. Moving targets are detected using the pixel wise difference between consecutive
Spatio-temporal correlation: theory and applications for wireless sensor networks
- Computer Networks Journal (Elsevier
, 2004
"... Wireless Sensor Networks (WSN) are characterized by the dense deployment of sensor nodes that continuously observe physical phenomenon. Due to high density in the network topology, sensor observations are highly correlated in the space domain. Furthermore, the nature of the physical phenomenon const ..."
Abstract
-
Cited by 121 (12 self)
- Add to MetaCart
constitutes the temporal correlation between each consecutive observation of a sensor node. These spatial and temporal correlations along with the collaborative nature of the WSN bring significant potential advantages for the development of efficient communication protocols well-suited for the WSN paradigm
Mobile Robot Localization using Range Sensors: Consecutive Scanning and Cooperative Scanning
"... Abstract: This paper presents an obstacle detection algorithm based on the consecutive and the cooperative range sensor scanning schemes. For a known environment, a mobile robot scans the surroundings using a range sensor that can rotate 360 °. The environment is rebuilt using nodes of two adjacent ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract: This paper presents an obstacle detection algorithm based on the consecutive and the cooperative range sensor scanning schemes. For a known environment, a mobile robot scans the surroundings using a range sensor that can rotate 360 °. The environment is rebuilt using nodes of two adjacent
Self-deployment Algorithms for Mobile Sensors on a Ring
, 2006
"... We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network must move, in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
they evenly cover the ring. A self-deployment algorithm is exact if within finite time the sensors reach a static uniform configuration: the distance between any two consecutive sensors along the ring is the same, d; the self-deployment algorithm is ɛ-approximate if the distance between two consecutive
Reliable transfer on wireless sensor networks
- In SECON
, 2004
"... In Wireless Sensor Networks, many applications like structure monitoring require collecting all data without loss from motes. End-to-end retransmission which is used in Internet for reliable transport layer, does not work well in Wireless Sensor Networks, since wireless communication, and constraine ..."
Abstract
-
Cited by 56 (1 self)
- Add to MetaCart
In Wireless Sensor Networks, many applications like structure monitoring require collecting all data without loss from motes. End-to-end retransmission which is used in Internet for reliable transport layer, does not work well in Wireless Sensor Networks, since wireless communication
Self-Deployment of Mobile Sensors on a Ring
"... Unlike their static counterpart, mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the environment. We consider the self-deployment problem in a ring (e.g., a circular rim); in part ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
-deployment is exact if within finite time the distance between any two consecutive sensors along the ring is the same, d; it is ǫ-approximate if within finite time the distance between two consecutive sensors is between d − ǫ and d + ǫ. We first of all prove that exact self-deployment is impossible if the sensors do
Research Article Interference-Free Wakeup Scheduling with Consecutive Constraints in Wireless Sensor Networks
"... which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Wakeup scheduling has been widely used in wireless sensor networks (WSNs), for it can reduce the energy wastage caused by the idle listening state. In a traditional wakeup sche ..."
Abstract
- Add to MetaCart
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Wakeup scheduling has been widely used in wireless sensor networks (WSNs), for it can reduce the energy wastage caused by the idle listening state. In a traditional wakeup
Motion Planning for Multitarget Surveillance with Mobile Sensor Agents
- IEEE Transactions on Robotics
, 2005
"... Abstract—In the surveillance of multiple targets by mobile sensor agents (MSAs), system performance relies greatly on the motion-control strategy of the MSAs. This paper investigates the motion-planning problem for a limited resource of MSAs in an environment of targets (). The kinematics of the MSA ..."
Abstract
-
Cited by 41 (0 self)
- Add to MetaCart
Abstract—In the surveillance of multiple targets by mobile sensor agents (MSAs), system performance relies greatly on the motion-control strategy of the MSAs. This paper investigates the motion-planning problem for a limited resource of MSAs in an environment of targets (). The kinematics
Weighted Range Sensor Matching Algorithms for Mobile Robot Displacement Estimation
- In In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA
, 2002
"... This paper introduces a “weighted ” matching algorithm to estimate a robot’s planar displacement by matching twodimensional range scans. The influence of each scan point on the overall matching error is weighted according to its uncertainty. We develop uncertainty models that account for effects suc ..."
Abstract
-
Cited by 50 (9 self)
- Add to MetaCart
such as measurement noise, sensor incidence angle, and correspondence error. Based on models of expected sensor uncertainty, our algorithm computes the appropriate weighting for each measurement so as to optimally estimate the displacement between two consecutive poses. By explicitly modeling the various noise
On exploiting spatial and temporal correlation in wireless sensor networks
- In Proceedings of WiOpt 2004: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks
, 2004
"... Abstract. In densely deployed wireless sensor networks (WSN), sensor observations are highly correlated in the space domain. Furthermore, the nature of the physical phenomenon constitutes the temporal correlation between each consecutive observation of a sensor node. These spatial and temporal corre ..."
Abstract
-
Cited by 17 (0 self)
- Add to MetaCart
Abstract. In densely deployed wireless sensor networks (WSN), sensor observations are highly correlated in the space domain. Furthermore, the nature of the physical phenomenon constitutes the temporal correlation between each consecutive observation of a sensor node. These spatial and temporal
Results 1 - 10
of
367