Abstract
Reassembling hand shredded content-less pages is a challenging task, with applications in forensics and fun games. This paper proposes an efficient iterative framework to solve apictorial jigsaw puzzles of hand shredded content-less pages, using only the shape information. The proposed framework consists of four phases. In the first phase, normalized shape features are extracted from fragment contours. Then, for all possible matches between pairs of fragments transformation parameters for alignment of fragments and three goodness scores are estimated. In the third phase, incorrect matches are eliminated based on the score values. The alignments are refined by pruning the set of pairwise matched fragments. Finally, a modified graph-based framework for agglomerative clustering is used to globally reassemble the page(s). Experimental evaluation of our proposed framework on an annotated dataset of shredded documents shows the efficiency in the reconstruction of multiple content-less pages from arbitrarily torn fragments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. In: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 153–164 (2006)
Castañeda, A.G., Brown, B.J., Rusinkiewicz, S., Funkhouser, T.A., Weyrich, T.: Global consistency in the automatic assembly of fragmented artefacts. In: The 12th International Symposium on Virtual Reality, Archaeology and Cultural Heritage, pp. 73–80 (2011)
Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica Int. J. Geogr. Inf. Geovisualization 10, 112–122 (1973)
Freeman, H., Garder, L.: Apictorial jigsaw puzzles: the computer solution of a problem in pattern recognition. IEEE Trans. Electron. Comput. 13, 118–127 (1964)
Goldberg, D., Malon, C., Bern, M.: A global approach to automatic solution of jigsaw puzzles. In: Eighteenth Annual Symposium on Computational Geometry, pp. 82–87 (2002)
Hoff, D.J., Olver, P.J.: Automatic solution of jigsaw puzzles. J. Math. Imaging Vis. 49, 234–250 (2014)
Justino, E., Oliveira, L.S., Freitas, C.: Reconstructing shredded documents through feature matching. Forensic Sci. Int. 160, 140–147 (2006)
Kong, W., Kimia, B.B.: On Solving 2D and 3D puzzles using curve matching. In: 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 583–590 (2001)
Liu, H., Cao, S., Yan, S.: Automated assembly of shredded pieces from multiple photos. IEEE Trans. Multimedia 13, 1154–1162 (2011)
Radack, G.M., Badler, N.I.: Jigsaw puzzle matching using a boundary-centered polar encoding. Comput. Graph. Image Process. 19, 1–17 (1982)
Richter, F., Ries, C.X., Cebron, N., Lienhart, R.: Learning to reassemble shredded documents. IEEE Trans. Multimedia 15, 582–593 (2013)
Richter, F., Ries, C.X., Romberg, S., Lienhart, R.: Partial contour matching for document pieces with content-based prior. In: 2014 IEEE International Conference on Multimedia & Expo, pp. 1–6 (2014)
Rusinkiewicz, S., Levoy, M.: Efficient variants of the ICP algorithm. In: Third International Conference on 3-D Digital Imaging and Modeling, pp. 145–152 (2001)
Sağiroğlu, M., Erçil, A.: A texture based matching approach for automated assembly of puzzles. In: The 18th International Conference on Pattern Recognition, vol. 3, pp. 1036–1041 (2006)
Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol. 147, 195–197 (1981)
Stieber, A., Schneider, J., Nickolay, B., Krüger, J.: A contour matching algorithm to reconstruct ruptured documents. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds.) DAGM 2010. LNCS, vol. 6376, pp. 121–130. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15986-2_13
Tsamoura, E., Pitas, I.: Automatic color based reassembly of fragmented images and paintings. IEEE Trans. Image Process. 19, 680–690 (2010)
Zhang, K., Li, X.: A graph-based optimization algorithm for fragmented image reassembly. Graph. Models 76, 484–495 (2014)
Zhu, L., Zhou, Z., Hu, D.: Globally consistent reconstruction of ripped-up documents. IEEE Trans. Pattern Anal. Mach. Intell. 30, 1–13 (2008)
Zisserman, A., Forsyth, D.A., Mundy, J.L., Rothwell, C.A.: Recognizing general curved objects efficiently. In: Geometric Invariance in Computer Vision, pp. 228–251 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
K.S., L., Das, S., Menon, A., Varghese, K. (2017). Graph-Based Clustering for Apictorial Jigsaw Puzzles of Hand Shredded Content-less Pages. In: Basu, A., Das, S., Horain, P., Bhattacharya, S. (eds) Intelligent Human Computer Interaction. IHCI 2016. Lecture Notes in Computer Science(), vol 10127. Springer, Cham. https://doi.org/10.1007/978-3-319-52503-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-52503-7_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52502-0
Online ISBN: 978-3-319-52503-7
eBook Packages: Computer ScienceComputer Science (R0)