A Contour Matching Algorithm to Reconstruct Ruptured Documents
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.
KeywordsFalse Reject Rate Fragment Pair Jigsaw Puzzle Contour Segment Curve Match
Unable to display preview. Download preview PDF.
- 3.Pimenta, A., Justino, E., Oliveira, L.S., Sabourin, R.: Document reconstruction using dynamic programming. In: ICASSP 2009: Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, Washington, DC, USA, pp. 1393–1396. IEEE Computer Society, Los Alamitos (April 2009)Google Scholar
- 4.Solana, C., Justino, E., Oliveira, L.S., Bortolozzi, F.: Document reconstruction based on feature matching. In: Rodrigues, M.A.F., Frery, A.C. (eds.) Proceedings of the 18th Brazilian Symposium on Computer Graphics and Image Processing, October 9-12. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 5.Kong, W., Kimia, B.B.: On solving 2d and 3d puzzles using curve matching. In: CVPR (2), pp. 583–590 (2001)Google Scholar
- 8.McBride, J.C., Kimia, B.B.: Archaeological fragment reconstruction using curve-matching. In: Computer Vision and Pattern Recognition Workshop (CVPRW), vol. 1, p. 3 (2003)Google Scholar