3D Fragment Reassembly Using Integrated Template Guidance and Fracture-Region Matching

This paper studies matching of fragmented objects to recompose their original geometry. Solving this geometric reassembly problem has direct applications in archaeology and forensic investigation in the computer-aided restoration of damaged artifacts and evidence. We develop a new algorithm to effectively integrate both guidance from a template and from matching of adjacent pieces' fracture-regions. First, we compute partial matchings between fragments and a template, and pairwise matchings among fragments. Many potential matches are obtained and then selected/refined in a multi-piece matching stage to maximize global groupwise matching consistency. This pipeline is effective in composing fragmented thin-shell objects containing small pieces, whose pairwise matching is usually unreliable and ambiguous and hence their reassembly remains challenging to the existing algorithms.

[1]  Radu Horaud,et al.  Surface feature detection and description with applications to mesh matching , 2009, CVPR.

[2]  Jitendra Malik,et al.  Shape matching and object recognition using low distortion correspondences , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[3]  Joseph S. B. Mitchell,et al.  Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version) , 1994, SCG '94.

[4]  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.

[5]  S. S. Iyengar,et al.  On Computing Mapping of 3D Objects , 2014, ACM Comput. Surv..

[6]  Marshall W. Bern,et al.  A global approach to automatic solution of jigsaw puzzles , 2002, SCG '02.

[7]  Xin Li,et al.  Skull Assembly and Completion Using Template-Based Surface Matching , 2011, 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission.

[8]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[9]  Federico Tombari,et al.  Performance Evaluation of 3D Keypoint Detectors , 2011, 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission.

[10]  David B. Cooper,et al.  Bayesian assembly of 3D axially symmetric shapes from fragments , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[11]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[12]  Zhao Yin,et al.  An automatic assembly and completion framework for fragmented skulls , 2011, 2011 International Conference on Computer Vision.

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

[14]  Federico Tombari,et al.  Unique Signatures of Histograms for Local Surface Description , 2010, ECCV.

[15]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[16]  Andrew E. Johnson,et al.  Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Yu Zhong,et al.  Intrinsic shape signatures: A shape descriptor for 3D object recognition , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.

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

[19]  R. Horaud,et al.  Surface feature detection and description with applications to mesh matching , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[20]  Mohammed Bennamoun,et al.  On the Repeatability and Quality of Keypoints for Local Feature-based 3D Object Retrieval from Cluttered Scenes , 2009, International Journal of Computer Vision.

[21]  Linda G. Shapiro,et al.  A new signature-based method for efficient 3-D object recognition , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[22]  H. Pottmann,et al.  Reassembling fractured objects by geometric matching , 2006, SIGGRAPH 2006.

[23]  Leonidas J. Guibas,et al.  A concise and provably informative multi-scale signature based on heat diffusion , 2009 .

[24]  Daniel Cohen-Or,et al.  4-points congruent sets for robust pairwise surface registration , 2008, ACM Trans. Graph..

[25]  Markus H. Gross,et al.  Multi‐scale Feature Extraction on Point‐Sampled Surfaces , 2003, Comput. Graph. Forum.

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

[27]  Raif M. Rustamov,et al.  Laplace-Beltrami eigenfunctions for deformation invariant shape representation , 2007 .

[28]  Daniel Cremers,et al.  The wave kernel signature: A quantum mechanical approach to shape analysis , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[29]  Georgios Papaioannou,et al.  On the automatic assemblage of arbitrary broken solid artefacts , 2003, Image Vis. Comput..

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

[31]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[32]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[33]  David B. Cooper,et al.  Estimating a-priori Unknown 3D Axially Symmetric Surfaces from Noisy Measurements of Their Fragments , 2006, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06).

[34]  Benjamin B. Kimia,et al.  Archaeological Fragment Reconstruction Using Curve-Matching , 2003, 2003 Conference on Computer Vision and Pattern Recognition Workshop.

[35]  Matthijs C. Dorst.  Distinctive Image Features from Scale-Invariant Keypoints , 2011 .

[36]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[37]  Umberto Castellani,et al.  Sparse points matching by combining 3D mesh saliency with statistical descriptors , 2008, Comput. Graph. Forum.

[38]  Wolfram Burgard,et al.  G2o: A general framework for graph optimization , 2011, 2011 IEEE International Conference on Robotics and Automation.