Summarizing Large Scale 3D Mesh

Affiliation auteurs!!!! Error affiliation !!!!
TitreSummarizing Large Scale 3D Mesh
Type de publicationConference Paper
Year of Publication2018
AuteursBen Salah I, Kramm S, Demonceaux C, Vasseur P
EditorMaciejewski AA, Okamura A, Bicchi A, Stachniss C, Song DZ, Lee DH, Chaumette F, Ding H, Li JS, Wen J, Roberts J, Masamune K, Chong NY, Amato N, Tsagwarakis N, Rocco P, Asfour T, Chung WK, Yasuyoshi Y, Sun Y, Maciekeski T, Althoefer K, AndradeCetto J, Chung WK, Demircan E, Dias J, Fraisse P, Gross R, Harada H, Hasegawa Y, Hayashibe M, Kiguchi K, Kim K, Kroeger T, Li Y, Ma S, Mochiyama H, Monje CA, Rekleitis I, Roberts R, Stulp F, Tsai CHD, Zollo L
Conference Name2018 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS)
PublisherIEEE Robot & Automat Soc; IEEE Ind Elect Soc; Robot Soc Japan; Soc Instrument & Control Engineers; New Technol Fdn; IEEE; Adept MobileRobots; Willow Garage; Aldebaran Robot; Natl Instruments; Reflexxes GmbH; Schunk Intec S L U; Univ Carlos III Madrid; BOS
Conference Location345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN Number978-1-5386-8094-0
Résumé

Recent progress in 3D sensor devices and in semantic mapping allows to build very rich HD 3D maps very useful for autonomous navigation and localization. However, these maps are particularly huge and require important memory capabilities as well computational resources. In this paper, we propose a new method for summarizing a 3D map (Mesh) as a set of compact spheres in order to facilitate its use by systems with limited resources (smartphones, robots, UAVs, ...). This vision-based summarizing process is applied in a fully automatic way using jointly photometric, geometric and semantic information of the studied environment. The main contribution of this research is to provide a very compact map that maximizes the significance of its content while maintaining the full visibility of the environment. Experimental results in summarizing large-scale 3D map demonstrate the feasibility of our approach and evaluate the performance of the algorithm.