Solving jigsaw puzzles by computer
Annals of Operations Research
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Multiscale Method for the Reassembly of Two-Dimensional Fragmented Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Similarity Measures, Properties and Constructions
VISUAL '00 Proceedings of the 4th International Conference on Advances in Visual Information Systems
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
Measuring the Information Content of Fracture Lines
International Journal of Computer Vision
Document Reconstruction Based on Feature Matching
SIBGRAPI '05 Proceedings of the XVIII Brazilian Symposium on Computer Graphics and Image Processing
Document reconstruction using dynamic programming
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
| Hi-index | 0.00 |
A procedure for reassembling ruptured documents from a large number of fragments is proposed. Such problems often arises in forensic and archiving. Usually, fragments are mixed and take arbitrary shapes. The proposed procedure concentrates on contour information of the fragments and represents it as feature strings to perform a matching based on dynamic programming. Experiments with 500 images of randomly shredded fragments show that the proposed reconstruction procedure is able to compose nearly 98% of the ruptured pages.