Mitra, NJ; Bronstein, A; Bronstein, M; (2010) Intrinsic Regularity Detection in 3D Geometry. In: Daniilidis, K and Maragos, P and Paragios, N, (eds.) COMPUTER VISION-ECCV 2010, PT III. (pp. 398 - 410). SPRINGER-VERLAG BERLIN
Full text not available from this repository.
Automatic detection of symmetries, regularity, and repetitive structures in 3D geometry is a fundamental problem in shape analysis and pattern recognition with applications in computer vision and graphics. Especially challenging is to detect intrinsic regularity, where the repetitions are on an intrinsic grid, without any apparent Euclidean pattern to describe the shape, but rising out of (near) isometric deformation of the underlying surface. In this paper, we employ multidimensional scaling to reduce the problem of intrinsic structure detection to a simpler problem of 2D grid detection. Potential 2D grids are then identified using an autocorrelation analysis, refined using local fitting, validated, and finally projected back to the spatial domain. We test the detection algorithm on a variety of scanned plaster models in presence of imperfections like missing data, noise and outliers. We also present a range of applications including scan completion, shape editing, super-resolution, and structural correspondence.
|Title:||Intrinsic Regularity Detection in 3D Geometry|
|Event:||11th European Conference on Computer Vision|
|Dates:||2010-09-05 - 2010-09-11|
|Keywords:||SYMMETRY DETECTION, FRAMEWORK, SHAPES|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record