Abstract
In this work, we focus on the reconstruction of strip shredded text documents (RSSTD) which is of great interest in investigative sciences and forensics. After presenting a formal model for RSSTD, we suggest two solution approaches: On the one hand, RSSTD can be reformulated as a (standard) traveling salesman problem and solved by well-known algorithms such as the chained Lin Kernighan heuristic. On the other hand, we present a specific variable neighborhood search approach. Both methods are able to outperform a previous algorithm from literature, but nevertheless have practical limits due to the necessarily imperfect objective function. We therefore turn to a semi-automatic system which also integrates user interactions in the optimization process. Practical results of this hybrid approach are excellent; difficult instances can be quickly resolved with only few user interactions.
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
Ukovich, A., Zacchigna, A., Ramponi, G., Schoier, G.: Using clustering for document reconstruction. In: Dougherty, E.R., et al. (eds.) Image Processing: Algorithms and Systems, Neural Networks, and Machine Learning. Proceedings of SPIE., International Society for Optical Engineering, vol. 6064, pp. 168–179 (2006)
Chung, M.G., Fleck, M., Forsyth, D.: Jigsaw puzzle solver using shape and color. In: Fourth International Conference on Signal Processing 1998, ICSP 1998, vol. 2, pp. 877–880 (1998)
Justino, E., Oliveira, L.S., Freitas, C.: Reconstructing shredded documents through feature matching. Forensic Science International 160(2–3), 140–147 (2006)
Schüller, P.: Reconstructing borders of manually torn paper scheets using integer linear programming. Master’s thesis, Vienna Univ. of Technology, Austria (2008)
De Smet, P.: Reconstruction of ripped-up documents using fragment stack analysis procedures. Forensic science international 176(2), 124–136 (2008)
Skeoch, A.: An Investigation into Automated Shredded Document Reconstruction using Heuristic Search Algorithms. PhD thesis, University of Bath, UK (2006)
Ukovich, A., Ramponi, G., Doulaverakis, H., Kompatsiaris, Y., Strintzis, M.: Shredded document reconstruction using MPEG-7 standard descriptors. In: Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology, 2004, pp. 334–337 (2004)
Morandell, W.: Evaluation and reconstruction of strip-shredded text documents. Master’s thesis, Vienna University of Technology, Austria (2008)
Fischetti, M., González, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45, 378–394 (1997)
Silberholz, J., Golden, B.: The generalized traveling salesman problem: A new genetic algorithm approach. In: Baker, E.K., et al. (eds.) Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces, vol. 37, pp. 165–181. Springer, Heidelberg (2007)
Behzad, A., Modarres, M.: A new efficient transformation of the generalized traveling salesman problem into traveling salesman problem. In: Proceedings of the 15th International Conference of Systems Engineering, pp. 6–8 (2002)
Kumar, R., Haomin, L.: On asymmetric TSP: Transformation to symmetric TSP and performance bound (submitted, 1994); Journal of Operations Research
Balme, J.: Reconstruction of shredded documents in the absence of shape information. Working paper, Dept.of Computer Science, Yale University, USA (2007)
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Finding tours in the TSP. Technical Report Number 99885, Research Institute for Discrete Mathematics, Universität Bonn (1999)
Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS Journal on Computing 15(1), 82–92 (2003)
Klau, G.W., Lesh, N., Marks, J., Mitzenmacher, M., Schafer, G.T.: The HuGS platform: A toolkit for interactive optimization. In: Proc. Advanced Visual Interfaces, AVI, pp. 324–330. ACM Press, New York (2002)
Klau, G.W., Lesh, N., Marks, J., Mitzenmacher, M.: Human-guided search: Survey and recent results. Technical Report TR2003-07, Mitsubishi Electric Research Laboratories, Cambridge, MA, USA (2003); Submitted to Journal of Heuristics
Hansen, P., Mladenović, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer Academic Publishers, Dordrecht (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prandtstetter, M., Raidl, G.R. (2008). Combining Forces to Reconstruct Strip Shredded Text Documents. In: Blesa, M.J., et al. Hybrid Metaheuristics. HM 2008. Lecture Notes in Computer Science, vol 5296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88439-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-88439-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88438-5
Online ISBN: 978-3-540-88439-2
eBook Packages: Computer ScienceComputer Science (R0)