Name
Abstract | ||
|---|---|---|
Reassembling unknown broken objects from a large collection of fragments is a common problem in archaeology and other fields. Computer tools have recently been developed, by the authors and by others, which try to help by identifying pairs of fragments with matching outline shapes. Those tools have been successfully tested on small collections of fragments; here we address the question of whether they can be expected to work also for practical instances of the problem (103 to 105 fragments). To that end, we describe here a method to measure the average amount of information contained in the shape of a fracture line of given length. This parameter tells us how many false matches we can expect to find for it among a given set of fragments. In particular, the numbers we obtained for ceramic fragments indicate that fragment outline comparison should give useful results even for large instances of the problem. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s11263-005-3226-8 | International Journal of Computer Vision |
Keywords | Field | DocType |
curve matching,jigsaw puzzles,information content,fractals,shape recognition | Curve matching,Computer science,Fractal,Algorithm,Computer tools | Journal |
Volume | Issue | ISSN |
65 | 3 | 0920-5691 |
Citations | PageRank | References |
4 | 0.43 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Helena Cristina Da Gama Leitão | 1 | 98 | 7.70 |
| Jorge Stolfi | 2 | 1559 | 296.06 |