Abstract
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Multiple Object Tracking and Identification (MOTI) problem. In our model, the network is represented by a sparse connected graph where each vertex represents a binary sensor and there is an edge between two sensors if an object can pass from a sensed region to another without activating any other remaining sensor. The difficulty of MOTI lies in the fact that trajectories of two or more objects can be so close (track merging) that the corresponding tracks on the sensor network can no longer be distinguished, thus confusing the deterministic association between an object trajectory and a track.
The paper presents several results. We first show that MOTI cannot be solved on a general graph of ideal binary sensors even by an omniscient external observer if all the objects can freely move on the graph. Then, we describe some restrictions that can be imposed a priori either on the graph, on the object movements or both, to make MOTI problem always solvable. We also discuss the consequences of our results and present some related open problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aslam, J., Butler, Z., Constantin, F., Crespi, V., Cybenko, G., Rus, D.: Tracking a moving object with a binary sensor network. In: Proc. of SenSys 2003 (2003)
Aspnes, J., Goldengerg, D., Yang, Y.R.: On the computational complexity of sensor network localization. In: Proc. of 1st Intl Workshop on Algorithmic Aspects of WSN (2004)
Bloisi, D., Iocchi, L., Leone, G.R., Pigliacampo, R., Tombolini, L., Novelli, L.: A distributed vision system for boat traffic monitoring in the venice grand canal. In: VISAPP 2007 (2007)
Floyd, R.W.: Algorithm 97: Shortest path. Comm. of the ACM (1962)
Gui, C., Mohapatra, P.: Power conservation and quality of surveillance in target tracking sensor networks. In: Proc. of MobiCom 2004 (2004)
Han, M., Xu, W., Tao, H., Gong, Y.: An algorithm for multiple object trajectory tracking. In: Proc. of CVPR 2004 (2004)
Liu, J., Liu, J., Reich, J., Cheung, P., Zhao, F.: Distributed Group Management for Track Initiation and Maintenance in Target Localization Applications. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 113–128. Springer, Heidelberg (2003)
Oh, S., Sastry, S.: Tracking on a graph. In: Proc. of IPSN 2005 (2005)
Singh, J., Madhow, U., Kumar, R., Suri, S., Cagley, R.: Tracking multiple targets using binary proximity sensors. In: Proc. of IPSN 2007 (2007)
Warshall, S.: A theorem on boolean matrices. Journal of the ACM (1962)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busnel, Y., Querzoni, L., Baldoni, R., Bertier, M., Kermarrec, AM. (2008). On the Deterministic Tracking of Moving Objects with a Binary Sensor Network. In: Nikoletseas, S.E., Chlebus, B.S., Johnson, D.B., Krishnamachari, B. (eds) Distributed Computing in Sensor Systems. DCOSS 2008. Lecture Notes in Computer Science, vol 5067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69170-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-69170-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69169-3
Online ISBN: 978-3-540-69170-9
eBook Packages: Computer ScienceComputer Science (R0)