Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wolfson, H., Schonberg, E., Kalvin, A., Lamdan, Y.: Solving jigsaw puzzles by computer. Ann. Oper. Res. 12(1-4), 51–64 (1988)
Goldberg, D., Malon, C., Bern, M.: A global approach to automatic solution of jigsaw puzzles. Comput. Geom. Theory Appl. 28(2-3), 165–174 (2004)
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)
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)
Kong, W., Kimia, B.B.: On solving 2d and 3d puzzles using curve matching. In: CVPR (2), pp. 583–590 (2001)
Wolfson, H.J.: On curve matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(5), 483–489 (1990)
De Smet, P.: Reconstruction of ripped-up documents using fragment stack analysis procedures. Forensic Science International 176(2-3), 124–136 (2008)
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)
Leitão, H.C.d.G., Stolfi, J.: A multiscale method for the reassembly of two-dimensional fragmented objects. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(9), 1239–1251 (2002)
Leitão, H.C.d.G., Stolfi, J.: Measuring the information content of fracture lines. International Journal of Computer Vision 65(3), 163–174 (2005)
Veltkamp, R.C., Hagedoorn, M.: Shape similarity measures, properties and constructions. In: Laurini, R. (ed.) VISUAL 2000. LNCS, vol. 1929, pp. 467–476. Springer, Heidelberg (2000)
Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147(1), 195–197 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stieber, A., Schneider, J., Nickolay, B., Krüger, J. (2010). A Contour Matching Algorithm to Reconstruct Ruptured Documents. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds) Pattern Recognition. DAGM 2010. Lecture Notes in Computer Science, vol 6376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15986-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-15986-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15985-5
Online ISBN: 978-3-642-15986-2
eBook Packages: Computer ScienceComputer Science (R0)