Learning line features in 3d geometry

Feature detection in geometric datasets is a fundamental tool for solving shape matching problems such as partial symmetry detection. Traditional techniques usually employ a priori models such as crease lines that are unspecific to the actual application. Our paper examines the idea of learning geometric features. We introduce a formal model for a class of linear feature constellations based on a Markov chain model and propose a novel, efficient algorithm for detecting a large number of features simultaneously. After a short user-guided training stage, in which one or a few example lines are sketched directly onto the input data, our algorithm automatically finds all pieces of geometry similar to the marked areas. In particular, the algorithm is able recognize larger classes of semantically similar but geometrically varying features, which is very difficult using unsupervised techniques. In a number of experiments, we apply our technique to point cloud data from 3D scanners. The algorithm is able to detect features with very low rates of false positives and negatives and to recognize broader classes of similar geometry (such as “windows” in a building scan) even from few training examples, thereby significantly improving over previous unsupervised techniques.

@Article { SJWES11a,
  author       = "Sunkel, Martin and Jansen, Silke and Wand, Michael and Eisemann, Elmar and Seidel, Hans-Peter",
  title        = "Learning line features in 3d geometry",
  journal      = "Computer Graphics Forum (Proc. Eurographics)",
  number       = "2",
  volume       = "30",
  month        = "April",
  year         = "2011",
  note         = "publisher: Blackwell
editor: Chen Min and Deussen Oliver
organization: European Association for Computer Graphics
address: Llandudno
",
  url          = "http://graphics.tudelft.nl/Publications-new/2011/SJWES11a"
}