A multiscale method for the reassembly of two-dimensional fragmented objects
IEEE Transactions on Pattern Analysis and Machine Intelligence - Tập 24 Số 9 - Trang 1239-1251 - 2002
Tóm tắt
We describe an efficient procedure for reassembling unknown two-dimensional objects that have been broken or torn into a large number of irregular fragments, a problem that often arises in archaeology, art restoration, forensics, and other disciplines. The procedure compares the curvature-encoded fragment outlines, at progressively increasing scales of resolution, using an incremental dynamic programming sequence-matching algorithm. The total cost gets reduced by a factor proportional to the mean number of samples per segment, which makes the method viable for problems of practical size (thousands of fragments). The performance of our method is illustrated with an artificial but realistic example.
Từ khóa
#Art #Forensics #Dynamic programming #Heuristic algorithms #CostsTài liệu tham khảo
10.1109/34.149591
10.1109/34.391387
10.1109/34.615444
pope, 1994, Model Based Object Recognition: A Survey of Recent Research
10.1016/0031-3203(93)90177-X
10.1109/21.120080
10.1109/70.88097
leit�o, 2000, Information Contents of Fracture Lines, Proc WSCG '2000Eighth Int'l Conf in Central Europe on Computer Graphics etc, 2, 389
10.1109/38.909015
levoy, 1999, Scanning the Fragments of the Forma Urbis Romae
10.1177/027836498600500403
legault, 1997, Optimal Local Weighted Averaging Methods in Contour Smoothing, IEEE Trans Pattern Analysis and Machine Intelligence, 19, 801, 10.1109/34.608276
leit�o, 2001, A Multiscale Technique for Computer Assisted Reassembly of Fragmented Objects
setubal, 1997, Introduction to Computational Molecular Biology
10.1016/0076-6879(92)10029-D
bunke, 1993, Jigsaw Puzzle Solving Using Approximate String Matching and Best-First Search, Proc Fifth Int'l Conf Computer Analysis of Images and Patterns (CAIP '93), 299, 10.1007/3-540-57233-3_40
10.1145/321796.321811
menard, 1997, On Finding Archaeological Fragment Assemblies Using a Bottom-Up Design, Proc 21st Workshop Austrian Assoc for Pattern Recognition, 203
leit�o, 1999, Reconstru��o Autom�tica de Objetos Fragmentados
leit�o, 1998, Automatic Reassembly of Irregular Fragments
10.1109/VISUAL.1996.568132
boussofiane, 1993, A New Method for Recognizing and Locating Objects by Searching Longest Paths, IEEE Trans Pattern Analysis and Machine Intelligence, 15, 445
hal�r, 1997, Estimation of Profiles of Sherds of Archaeological Pottery, Proc 1997 Czech Pattern Recognition Workshop (CPRW '97), 126
leutwyler, 2002, Solving a Digital Jigsaw Puzzle
winfield smith, 1970, Computer Helps Scholars Recreate an Egyptian Temple, National Geographic Magazine, 138, 644
10.1145/192161.192241
10.1016/0734-189X(89)90090-X
10.1016/0031-3203(93)90144-L
10.1109/34.55108
10.1109/CVPR.1999.784718
��oluk, 1999, Automatic Reconstruction of Broken 3-D Surface Objects, Computers & Graphics, 23, 573, 10.1016/S0097-8493(99)00075-8
hori, 2000, Hierarchical Description of a Contour for Reconstruction of Broken Earthenware, The Trans Electronics Information and Comm Engineers D-II, 1392
hori, 2000, Data Model for Computer Reconstruction of Potsherds, J Computer Archaeology, 5, 1
witkin, 1983, Scale-Space Filtering, Proc Eighth Int'l Joint Conf Artificial Intelligence (IJCAI '83), 1019