Abstract
We present a simple pairwise matching method for 3D fragment reassembly that uses boundary curves and concave-convex patches to accelerate and optimize the matching. Given the boundary curves of two fracture surfaces that completely or partially coincide, we can quickly exclude the fracture surface pairs with low boundary curve similarities, which can substantially reduce the computational cost of the subsequent patch matching, where we extract and delineate concave-convex patches of the selected fracture surfaces. A modified iterative closest point algorithm is applied on these concave-convex patches to refine the alignment. Finally, we determine the matched 3D fragments according to the overlap ratio of their fracture surfaces. The results of experiments on real-world examples demonstrate that our proposed algorithm is both accurate and efficient.
Highlights
Computer-aided 3D fragment reassembly is highly important in many fields, such as archaeology, paleontology and medicine
Our pairwise matching method consists of three steps: (a) Two fragments are roughly aligned quickly via boundary curve matching. (b) A modified iterative closest point (ICP) algorithm that is based on concave-convex patches is used for fine alignment, which is more effective than the ICP algorithm that is based on all points. (c) A validity testing strategy that is based on the overlap ratio of two fracture surfaces is applied to determine whether the two corresponding fragments match well
In this paper, we present a simple but effective method for the pairwise matching of 3D fragments, which consists of boundary-curve-based coarse matching and concave-convexpatch-based fine alignment
Summary
Computer-aided 3D fragment reassembly is highly important in many fields, such as archaeology, paleontology and medicine. Studies [3]–[13] matched fragments based on features of the fracture surface, which used feature patches [4], [5], feature curves [3], [6], [8], and feature points [9]. Wu and Wang [6] used the Hausdorff distance and the modified 4-point congruent set algorithms to identify potential simple chordless cycles for matching fragments for the reassembly of fractured sand particles. Q. Li et al.: Pairwise Matching for 3D Fragment Reassembly Based on Boundary Curves and Concave-Convex Patches. We directly extract the 3D boundary curve and surface features from the fracture surfaces, which are used for coarse matching and fine alignment, respectively. After extracting concave-convex patches of fracture surface pairs, a modified iterative closest point algorithm is proposed for application on the patches to optimize the assembly results.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
