Skip to main content

Real-Time Target Tracking Through Mobile Crowdsensing

  • Conference paper
  • First Online:
  • 1520 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10570))

Abstract

In order to track a single target in real-time across a large area, we proposed a novel method which combines mobile crowdsensing and existing sparse camera networks. Tracking is proceeded by reports, which either come from cameras or smart phone users. Intra-camera tracking is performed on selected cameras to identify target, and smart phone users can report with live photo or text when seeing the target. Such schema can largely help tracking target within blind area and increase the accuracy of target identification, due to the better identification ability of human eyes. Novel validation and correction mechanisms are designed to eliminate false reports, which ensures the robustness of our method. Compared with traditional cross-camera tracking methods, our design can be performed in real-time with better performance even if the target has appearance changes during the tracking. Simulations are done using road structures of our university, which validate the accuracy and robustness of our design.

This is a preview of subscription content, log in via an institution.

References

  1. Pan, J., Hu, B.: Robust occlusion handling in object tracking. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2007)

    Google Scholar 

  2. Yang, T., Pan, Q., Li, J., Li, S.Z.: Real-time multiple objects tracking with occlusion handling in dynamic scenes. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 970–975 (2005)

    Google Scholar 

  3. Makris, D., Ellis, T., Black, J.: Bridging the gaps between cameras. In: Proceedings of the 2004 IEEE Computer Society Conference on CVPR 2004, Vol. 2. IEEE (2004)

    Google Scholar 

  4. Truong, M.T.N., Sanghoon, K.,: Object tracking method based on color particle filter. In: Proceedings of the International Conference on Image Processing, Computer Vision, and Pattern Recognition (IPCV), The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp) (2016)

    Google Scholar 

  5. Klein, D.A., et al.: Adaptive real-time video-tracking for arbitrary objects. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2010, pp. 772–777 (2010)

    Google Scholar 

  6. Javed, O., Shafique, K., Shah, M.: Appearance modeling for tracking in multiple non-overlapping cameras. In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2. IEEE (2005)

    Google Scholar 

  7. Chen, K.-W., et al.: An adaptive learning method for target tracking across multiple cameras. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2008. IEEE (2008)

    Google Scholar 

  8. Javed, O., et al.: Tracking across multiple cameras with disjoint views. In: Proceedings of the Ninth IEEE International Conference on Computer Vision, 2003. IEEE (2003)

    Google Scholar 

  9. Frey, N., Antone, M.: Grouping crowd-sourced mobile videos for cross-camera tracking. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops (2013)

    Google Scholar 

  10. Shang, Y., et al.: Nest: networked smartphones for target localization. In: 2012 IEEE Consumer Communications and Networking Conference (CCNC). IEEE (2012)

    Google Scholar 

  11. Yutian, W., Shi, J., et al.: Quality-driven auction-based incentive mechanism for mobile crowd sensing. IEEE Trans. Veh. Technol. 64(9), 4203–4214 (2015)

    Article  Google Scholar 

  12. Makris, D., Ellis, T.J.: Automatic learning of an activity-based semantic scene model. In: IEEE International Conference on Advanced Video and Signal Based Surveillance, pp. 183–188 (2003)

    Google Scholar 

  13. Chandra, S., Bharti, A.K.: Speed distribution curves for pedestrians during walking and crossing. Procedia Soc. Behav. Sci. 104, 660–667 (2013)

    Article  Google Scholar 

  14. Husain, A., Stefan, L.: K*: a heuristic search algorithm for finding the k shortest paths. Artif. Intell. 175(18), 2129–2154 (2011)

    Article  MathSciNet  Google Scholar 

  15. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)

    Article  Google Scholar 

  16. Powell, M.J.D.: A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G.A. (ed.) Numerical Analysis. LNM, vol. 630, pp. 144–157. Springer, Heidelberg (1978). doi:10.1007/BFb0067703

    Chapter  Google Scholar 

  17. Waltz, R.A., Morales, J.L., Nocedal, J., Orban, D.: An interior algorithm for nonlinear optimization that combines line search and trust region steps. Math. Program. 107(3), 391–408 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work is supported by Chinese National Research Fund (NSFC) Key Project No.61532013; National China 973 Project No.2015CB352401; Shanghai Scientific Innovation Act of STCSM No.15JC1402400 and 985 Project of Shanghai Jiao Tong University with No.WF220103001.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weijia Jia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Shi, J., Jia, W. (2017). Real-Time Target Tracking Through Mobile Crowdsensing. In: Bouguettaya, A., et al. Web Information Systems Engineering – WISE 2017. WISE 2017. Lecture Notes in Computer Science(), vol 10570. Springer, Cham. https://doi.org/10.1007/978-3-319-68786-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68786-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68785-8

  • Online ISBN: 978-3-319-68786-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics