Scalable Symmetry Detection for Urban Scenes
J. Kerber, M. Bokeloh, M. Wand, H.-P. Seidel
In Computer Graphics Forum, 32(1), 2013.
Abstract: In this paper, we present a novel method for detecting partial symmetries in very large point clouds of 3D city scans. Unlike previous work, which has only been demonstrated on data sets of a few hundred megabytes maximum, our method scales to very large scenes: We map the detection problem to a nearest-neighbour problem in a low-dimensional feature space, and follow this with a cascade of tests for geometric clustering of potential matches. Our algorithm robustly handles noisy real-world scanner data, obtaining a recognition performance comparable to that of state-of-the-art methods. In practice, it scales linearly with scene size and achieves a high absolute throughput, processing half a terabyte of scanner data overnight on a dual socket commodity PC.
Keyword(s): symmetry detection, feature detection, large scene processing, clustering
Article URL: http://dx.doi.org/10.1111/j.1467-8659.2012.03226.x
BibTeX format:
@article{Kerber:2013:SSD,
  author = {J. Kerber and M. Bokeloh and M. Wand and H.-P. Seidel},
  title = {Scalable Symmetry Detection for Urban Scenes},
  journal = {Computer Graphics Forum},
  volume = {32},
  number = {1},
  pages = {3--15},
  year = {2013},
}
Search for more articles by J. Kerber.
Search for more articles by M. Bokeloh.
Search for more articles by M. Wand.
Search for more articles by H.-P. Seidel.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."