Aligning surfaces without aligning surfaces

We introduce a novel method for matching and aligning 3D surfaces that do not have any overlapping surface information. When two matching surfaces do not overlap, all that remains in common between them is a thin strip along their borders. Aligning such fragments is challenging but crucial for various applications, such as reassembly of thin-shell ceramics from their broken pieces. Past work approach this problem by heavily relying on simplistic assumptions about the shape of the object, or its texture. Our method makes no such assumptions; instead, we leverage the geometric and photometric similarity of the matching surfaces along the break-line. We first encode the shape and color of the boundary contour of each fragment at various scales in a novel 2D representation. Reformulating contour matching as 2D image registration based on these scale-space images enables efficient and accurate break-line matching. We then align the fragments by estimating the rotation around the break-line through maximizing the geometric continuity across it with a least-squares minimization. We evaluate our method on real-word colonial artifacts recently excavated in Philadelphia, Pennsylvania. Our system dramatically increases the ease and efficiency at which users reassemble artifacts as we demonstrate on three different vessels.

[1]  Simon Winkelbach,et al.  Pairwise Matching of 3D Fragments Using Cluster Trees , 2008, International Journal of Computer Vision.

[2]  D. Struik Lectures on classical differential geometry , 1951 .

[3]  Kenneth Levenberg A METHOD FOR THE SOLUTION OF CERTAIN NON – LINEAR PROBLEMS IN LEAST SQUARES , 1944 .

[4]  D. Marquardt An Algorithm for Least-Squares Estimation of Nonlinear Parameters , 1963 .

[5]  Benjamin B. Kimia,et al.  On solving 2D and 3D puzzles using curve matching , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[6]  Helmut Pottmann,et al.  Reassembling fractured objects by geometric matching , 2006, ACM Trans. Graph..

[7]  Ezgi Taslidere,et al.  Virtual reconstruction of archaeological vessels using expert priors & surface markings , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops.

[8]  Leonidas J. Guibas,et al.  Robust global registration , 2005, SGP '05.

[9]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Tim Weyrich,et al.  A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings , 2008, ACM Trans. Graph..

[11]  J. Challis A procedure for determining rigid body transformation parameters. , 1995, Journal of biomechanics.

[12]  Farzin Mokhtarian,et al.  Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Farzin Mokhtarian,et al.  Multi-scale description of space curves and three-dimensional objects , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Jorge Stolfi,et al.  A Multiscale Method for the Reassembly of Two-Dimensional Fragmented Objects , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Haim J. Wolfson On curve matching , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Aytül Erçil,et al.  A Texture Based Approach to Reconstruction of Archaeological Finds , 2005, VAST.

[17]  Trevor J. Hastie,et al.  3-D curve matching using splines , 1990, J. Field Robotics.

[18]  David B. Cooper,et al.  Assembling virtual pots from 3D measurements of their fragments , 2001, VAST '01.