메뉴 건너뛰기




Volumn , Issue , 2012, Pages 4038-4044

What could move? Finding cars, pedestrians and bicyclists in 3D laser data

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; FOOTBRIDGES; PIPELINES;

EID: 84864427390     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2012.6224734     Document Type: Conference Paper
Times cited : (120)

References (33)
  • 16
    • 77954560999 scopus 로고    scopus 로고
    • Unsupervised classification of dynamic obstacles in urban environments
    • R. Katz, J. Nieto, and E. Nebot, "Unsupervised classification of dynamic obstacles in urban environments," Journal of Field Robotics, vol. 27, no. 4, pp. 450-472, 2010.
    • (2010) Journal of Field Robotics , vol.27 , Issue.4 , pp. 450-472
    • Katz, R.1    Nieto, J.2    Nebot, E.3
  • 17
    • 79959534727 scopus 로고    scopus 로고
    • Simultaneous egomotion estimation, segmentation, and moving object detection
    • S.-W. Yang and C.-C. Wang, "Simultaneous egomotion estimation, segmentation, and moving object detection," Journal of Field Robotics, vol. 28, no. 4, pp. 565-588, 2011.
    • (2011) Journal of Field Robotics , vol.28 , Issue.4 , pp. 565-588
    • Yang, S.-W.1    Wang, C.-C.2
  • 21
    • 0014976008 scopus 로고
    • Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
    • jan.
    • C. Zahn, "Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters," Computers, IEEE Transactions on, vol. C-20, no. 1, pp. 68-86, jan. 1971.
    • (1971) Computers, IEEE Transactions on , vol.C-20 , Issue.1 , pp. 68-86
    • Zahn, C.1
  • 22
    • 85031281851 scopus 로고
    • Clustering algorithms based on minimum and maximum spanning trees
    • Proceedings of the fourth annual symposium on Computational geometry, ser. New York, NY, USA: ACM
    • T. Asano, B. Bhattacharya, M. Keil, and F. Yao, "Clustering algorithms based on minimum and maximum spanning trees," in Proceedings of the fourth annual symposium on Computational geometry, ser. SCG '88. New York, NY, USA: ACM, 1988, pp. 252-257.
    • (1988) SCG '88 , pp. 252-257
    • Asano, T.1    Bhattacharya, B.2    Keil, M.3    Yao, F.4
  • 24
    • 0019574599 scopus 로고
    • Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography
    • June
    • M. A. Fischler and R. C. Bolles, "Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography," Commun. ACM, vol. 24, pp. 381-395, June 1981.
    • (1981) Commun. ACM , vol.24 , pp. 381-395
    • Fischler, M.A.1    Bolles, R.C.2
  • 26
    • 9644254228 scopus 로고    scopus 로고
    • Efficient Graph-Based Image Segmentation
    • September
    • P. F. Felzenszwalb and D. P. Huttenlocher, "Efficient Graph-Based Image Segmentation," Int. J. Comput. Vision, vol. 59, pp. 167-181, September 2004.
    • (2004) Int. J. Comput. Vision , vol.59 , pp. 167-181
    • Felzenszwalb, P.F.1    Huttenlocher, D.P.2
  • 27
  • 32
  • 33
    • 77956212437 scopus 로고    scopus 로고
    • Fast euclidean minimum spanning tree: Algorithm, analysis, and applications
    • Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ser. New York, NY, USA: ACM
    • W. B. March, P. Ram, and A. G. Gray, "Fast euclidean minimum spanning tree: algorithm, analysis, and applications," in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ser. KDD '10. New York, NY, USA: ACM, 2010, pp. 603-612.
    • (2010) KDD '10 , pp. 603-612
    • March, W.B.1    Ram, P.2    Gray, A.G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.