dc.contributor.author | Mattausch, Oliver | en_US |
dc.contributor.author | Panozzo, Daniele | en_US |
dc.contributor.author | Mura, Claudio | en_US |
dc.contributor.author | Sorkine-Hornung, Olga | en_US |
dc.contributor.author | Pajarola, Renato | en_US |
dc.contributor.editor | B. Levy and J. Kautz | en_US |
dc.date.accessioned | 2015-03-03T12:25:44Z | |
dc.date.available | 2015-03-03T12:25:44Z | |
dc.date.issued | 2014 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/cgf.12286 | en_US |
dc.description.abstract | We present a method to automatically segment indoor scenes by detecting repeated objects. Our algorithm scales to datasets with 198 million points and does not require any training data. We propose a trivially parallelizable preprocessing step, which compresses a point cloud into a collection of nearly-planar patches related by geometric transformations. This representation enables us to robustly filter out noise and greatly reduces the computational cost and memory requirements of our method, enabling execution at interactive rates. We propose a patch similarity measure based on shape descriptors and spatial configurations of neighboring patches. The patches are clustered in a Euclidean embedding space based on the similarity matrix to yield the segmentation of the input point cloud. The generated segmentation can be used to compress the raw point cloud, create an object database, and increase the clarity of the point cloud visualization. | en_US |
dc.publisher | The Eurographics Association and John Wiley and Sons Ltd. | en_US |
dc.title | Object Detection and Classification from Large-Scale Cluttered Indoor Scans | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |