ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Quadtree Sampling-Based Superpixels for 3D Range Data
Cited 2 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
박재현, 최성록, 유원필
발행일
201406
출처
International Conference on Robotics and Automation (ICRA) 2014, pp.5495-5501
DOI
https://dx.doi.org/10.1109/ICRA.2014.6907667
협약과제
14PC1100, 도심, 야외 비정형 3차원 공간 실시간 인식 및 로봇주행기술 개발, 유원필
초록
3D range sensors are currently being used in various fields. Creating 3D range sensors requires various Techniques, such as object detection, Tracking, classification, 3D SLAM, etc. For The pre-processing step, superpixels can improve The performance of These Techniques. This paper proposes a novel over-segmentation algorithm, known as superpixels, for 3D outdoor urban range data. Superpixels are generated with Three steps: boundary extraction using a surface change score and sensor models, initial cluster seeding using a quadtree decomposition, and iterative clustering, which adapts a k-means clustering approach with limited search size in The quadtree dimension. The proposed algorithm produces adaptive superpixel sizes That Take into account surface and object border information. This reduces memory size more Than regular grid methods and represents small objects well with adaptable pixel sizes. The algorithm is verified using The publicly available Velodyne dataset and The manually annotated ground Truth. A comparison with The conventional algorithm is also presented.
KSP 제안 키워드
3D SLAM, 3D range data, 3D range sensors, Border information, Clustering approach, Memory size, Object detection, Over-Segmentation, Pre-processing, Quadtree decomposition, Sampling-based