A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Reconstruction of Three-Dimensional Objects through Matching of Their Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity-Based Approach to Earthenware Reconstruction
ICIAP '01 Proceedings of the 11th International Conference on Image Analysis and Processing
A global approach to automatic solution of jigsaw puzzles
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Reassembling fractured objects by geometric matching
ACM SIGGRAPH 2006 Papers
A Texture Based Matching Approach for Automated Assembly of Puzzles
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Globally Consistent Reconstruction of Ripped-Up Documents
IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving jigsaw puzzles using image features
Pattern Recognition Letters
Semi-automatic Forensic Reconstruction of Ripped-up Documents
ICDAR '09 Proceedings of the 2009 10th International Conference on Document Analysis and Recognition
Contour-shape based reconstruction of fragmented, 1600 BC wallpaintings
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
Automatic reconstruction of fragmented objects is of great interest in archaeology, where artefacts are often found in a fractured state. In this paper, we focus on the problem of automatically agglomerating clusters of fragments from previously determined pairwise matches. Common to any automated cluster agglomeration technique is the challenge of error accumulation, making it increasingly difficult to discern false from true matches as the assembly grows. Many assembly algorithms therefore introduce a global relaxation phase to distribute alignment errors evenly across the cluster, minimising major inconsistencies. Nevertheless, error accumulation limits the problem size automated assembly systems can handle in practice. In this paper we show how two careful modifications of the traditional relaxation scheme help lift this limit considerably. In contrast to previous work, we integrate global relaxation earlier, in the search phase of the assembly process. In addition, we do not fix connections between assembled fragments, but rather leave them flexible throughout the assembly. By modifying two representative assembly algorithms, we demonstrate the effectiveness of our approach. Using the example of a challenging fresco dataset, we show that these modifications achieve larger reconstruction sizes than traditional strategies.