This paper proposes a novel approach to automatic reconstruction of two-dimensional fragments. The contour matching task in fragment reassembly is reduced into a feature segment matching problem. Efficient techniques have been applied to find the proper matching segments. Specifically, the extracted contour of every fragment is defined as a set of feature segments on it. The probability of matching for fragments is measured by the Hausdorff distance between the corresponding feature segments. If the two feature segments are matchable, one of them is rotated and translated to be coincided with another, and then the overlap contact is detected automatically under this transformation. Fragments without overlap is merged to form a new one through contour updating. Then the matching process is continued until the original object is reconstructed. Experimental results demonstrate the algorithm is reliable and efficient. © 2013 Springer-Verlag.
CITATION STYLE
Zhu, Y. (2013). Automatic reconstruction of two-dimensional broken objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7995 LNCS, pp. 566–575). https://doi.org/10.1007/978-3-642-39479-9_66
Mendeley helps you to discover research relevant for your work.