Advertisement

MAD-C: Multi-stage Approximate Distributed Cluster-Combining for Obstacle Detection and Localization

  • Amir Keramatian
  • Vincenzo Gulisano
  • Marina Papatriantafilou
  • Philippas Tsigas
  • Yiannis Nikolakopoulos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11339)

Abstract

Efficient distributed multi-sensor monitoring is a key feature of upcoming digitalized infrastructures. We address the problem of obstacle detection, having as input multiple point clouds, from a set of laser-based distance sensors; the latter generate high-rate data and can rapidly exhaust baseline analysis methods, that gather and cluster all the data. We propose MAD-C, a distributed approximate method: it can build on any appropriate clustering, to process disjoint subsets of the data distributedly; MAD-C then distills each resulting cluster into a data-summary. The summaries, computable in a continuous way, in constant time and space, are combined, in an order-insensitive, concurrent fashion, to produce approximate volumetric representations of the objects. MAD-C leads to (i) communication savings proportional to the number of points, (ii) multiplicative decrease in the dominating component of the processing complexity and, at the same time, (iii) high accuracy (with RandIndex \(>0.95\)), in comparison to its baseline counterpart. We also propose MAD-C-ext, building on the MAD-C’s output, by further combining the original data-points, to improve the outcome granularity, with the same asymptotic processing savings as MAD-C.

Keywords

Point cloud processing Approximations Fog computing 

Notes

Acknowledgements

Work supported by SSF grant “FiC: Future Factories in the Cloud” (GMT14-0032) and VR grants “HARE: Self-deploying and Adaptive Data Streaming Analytics in Fog Architectures” (2016-03800) and “Models and Techniques for Energy-Efficient Concurrent Data Access Designs” (2016-05360).

References

  1. 1.
    Alfano, S., Greer, M.L.: Determining if two solid ellipsoids intersect. J. Guid. Control Dyn. 26(1), 106–110 (2003)CrossRefGoogle Scholar
  2. 2.
    Besl, P.J., McKay, N.D.: Method for registration of 3-D shapes. In: Sensor Fusion IV: Control Paradigms and Data Structures, vol. 1611, pp. 586–607. International Society for Optics and Photonics (1992)Google Scholar
  3. 3.
    Elseberg, J., Borrmann, D., Nüchter, A.: One billion points in the cloud-an octree for efficient processing of 3D laser scans. ISPRS J. Photogramm. Remote. Sens. 76, 76–88 (2013)CrossRefGoogle Scholar
  4. 4.
    Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226–231 (1996)Google Scholar
  5. 5.
    Geiger, A., Lenz, P., Stiller, C., Urtasun, R.: Vision meets robotics: the KITTI dataset. Int. J. Robot. Res. (IJRR) 32(11), 1231–1237 (2013)CrossRefGoogle Scholar
  6. 6.
    Geiger, A., Lenz, P., Urtasun, R.: Are we ready for autonomous driving? The KITTI vision benchmark suite. In: CVPR, pp. 3354–3361. IEEE (2012)Google Scholar
  7. 7.
    Hansen, N.: The CMA evolution strategy: a comparing review. In: Lozano, J.A., Larrañaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation. STUDFUZZ, vol. 192, pp. 75–102. Springer, Heidelberg (2006).  https://doi.org/10.1007/3-540-32494-1_4
  8. 8.
    Himmelsbach, M., Hundelshausen, F.V., Wuensche, H.J.: Fast segmentation of 3D point clouds for ground vehicles. In: Intelligent Vehicles Symposium, pp. 560–565. IEEE (2010)Google Scholar
  9. 9.
    Kumari, S., Goyal, P., Sood, A., Kumar, D., Balasubramaniam, S., Goyal, N.: Exact, fast and scalable parallel DBSCAN for commodity platforms. In: 18th International Conference on Distributed Computing and Networking, p. 14. ACM (2017)Google Scholar
  10. 10.
    Paoloni, G.: How to benchmark code execution times on Intel IA-32 and IA-64 instruction set architectures. Intel Corporation, p. 123 (2010)Google Scholar
  11. 11.
    Patwary, M.A., Palsetia, D., Agrawal, A., Liao, W.k., Manne, F., Choudhary, A.: A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, p. 62. IEEE Computer Society Press (2012)Google Scholar
  12. 12.
    Preguica, N., Marques, J.M., Shapiro, M., Letia, M.: A commutative replicated data type for cooperative editing. In: 29th IEEE International Conference on Distributed Computing Systems, ICDCS 2009, pp. 395–403. IEEE (2009)Google Scholar
  13. 13.
    Rusu, R.B.: Semantic 3D object maps for everyday manipulation in human living environments. KI-Künstliche Intelligenz 24(4), 345–348 (2010)CrossRefGoogle Scholar
  14. 14.
    Rusu, R.B., Cousins, S.: 3D is here: point cloud library (PCL). In: IEEE International Conference on Robotics and automation (ICRA), pp. 1–4. IEEE (2011)Google Scholar
  15. 15.
    Wagner, S., Wagner, D.: Comparing clusterings: an overview. Universität Karlsruhe, Fakultät für Informatik Karlsruhe (2007)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Chalmers University of TechnologyGothenburgSweden

Personalised recommendations