Finding the most relevant symmetry planes for an object is a key step in many computer vision and object recognition tasks. In fact such information can be effectively used as a starting point for object segmentation, noise reduction, alignment and recognition. Some of these applications are strongly affected by the accuracy of symmetry planes estimation, thus the use of a technique that is both accurate and robust to noise is critical. In this paper we introduce a new weighted association graph which relates the main symmetry planes of 3D objects to large sets of tightly coupled vertices. This technique allows us to cast symmetry detection to a classical pairwise clustering problem, which we solve using the very effective Dominant Sets framework. The improvement of our approach over other well known techniques is shown with several tests over both synthetic data and sampled point clouds.
|Data di pubblicazione:||2008|
|Titolo:||Consensus Graphs for Symmetry Plane Estimation|
|Titolo del libro:||Structural, Syntactic, and Statistical Pattern Recognition. IAPR International Workshop on|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-540-89689-0_24|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|