TY - GEN
T1 - Consistent Cuboid Detection for Semantic Mapping
AU - Hashemifar, Zakieh S.
AU - Lee, Kyung Won
AU - Napp, Nils
AU - Dantu, Karthik
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/3/29
Y1 - 2017/3/29
N2 - Building and storing efficient maps is an essentialfeature for long-term autonomy of robots. Modern sensors (such as Kinect) tend to produce a lot of data. However, long-term autonomy requires us to store this information in a succinct manner. One way to reduce dimensionality of information is to attribute semantics. Most indoor objects are cuboidal in nature. We conjecture that cuboids are a suitable semantic feature to attribute to indoor objects for efficient mapping. We adapt a cuboid fitting algorithm previously proposedfor object recognition, for indoor mapping. Our work stems from the observation that landmark detection for mappingrequires consistent detection of those landmarks. We implement several modifications to this cuboid detection algorithm that lead to consistent detection such as emptiness, orientation, surface coverage, distance from edges, and others. We incorporate these in the identification of the cuboid candidates in a scene, as well as an optimization algorithm for finding the best set of consistent cubes to cover a given scene. Our experiments show that in comparison, the set of cuboids detected by our algorithm are at least 50% more consistent based on our metrics.
AB - Building and storing efficient maps is an essentialfeature for long-term autonomy of robots. Modern sensors (such as Kinect) tend to produce a lot of data. However, long-term autonomy requires us to store this information in a succinct manner. One way to reduce dimensionality of information is to attribute semantics. Most indoor objects are cuboidal in nature. We conjecture that cuboids are a suitable semantic feature to attribute to indoor objects for efficient mapping. We adapt a cuboid fitting algorithm previously proposedfor object recognition, for indoor mapping. Our work stems from the observation that landmark detection for mappingrequires consistent detection of those landmarks. We implement several modifications to this cuboid detection algorithm that lead to consistent detection such as emptiness, orientation, surface coverage, distance from edges, and others. We incorporate these in the identification of the cuboid candidates in a scene, as well as an optimization algorithm for finding the best set of consistent cubes to cover a given scene. Our experiments show that in comparison, the set of cuboids detected by our algorithm are at least 50% more consistent based on our metrics.
UR - https://www.scopus.com/pages/publications/85018289721
U2 - 10.1109/ICSC.2017.78
DO - 10.1109/ICSC.2017.78
M3 - Conference contribution
AN - SCOPUS:85018289721
T3 - Proceedings - IEEE 11th International Conference on Semantic Computing, ICSC 2017
SP - 526
EP - 531
BT - Proceedings - IEEE 11th International Conference on Semantic Computing, ICSC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 11th IEEE International Conference on Semantic Computing, ICSC 2017
Y2 - 30 January 2017 through 1 February 2017
ER -