HM 2008: Hybrid Metaheuristics pp 175-189 | Cite as
Combining Forces to Reconstruct Strip Shredded Text Documents
Conference paper
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.
Keywords
Cost Function Travel Salesman Problem Travel Salesman Problem Text Document User Move
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.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)Google Scholar
- 2.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)Google Scholar
- 3.Justino, E., Oliveira, L.S., Freitas, C.: Reconstructing shredded documents through feature matching. Forensic Science International 160(2–3), 140–147 (2006)CrossRefGoogle Scholar
- 4.Schüller, P.: Reconstructing borders of manually torn paper scheets using integer linear programming. Master’s thesis, Vienna Univ. of Technology, Austria (2008)Google Scholar
- 5.De Smet, P.: Reconstruction of ripped-up documents using fragment stack analysis procedures. Forensic science international 176(2), 124–136 (2008)CrossRefGoogle Scholar
- 6.Skeoch, A.: An Investigation into Automated Shredded Document Reconstruction using Heuristic Search Algorithms. PhD thesis, University of Bath, UK (2006)Google Scholar
- 7.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)Google Scholar
- 8.Morandell, W.: Evaluation and reconstruction of strip-shredded text documents. Master’s thesis, Vienna University of Technology, Austria (2008)Google Scholar
- 9.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)MathSciNetCrossRefMATHGoogle Scholar
- 10.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)CrossRefGoogle Scholar
- 11.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)Google Scholar
- 12.Kumar, R., Haomin, L.: On asymmetric TSP: Transformation to symmetric TSP and performance bound (submitted, 1994); Journal of Operations ResearchGoogle Scholar
- 13.Balme, J.: Reconstruction of shredded documents in the absence of shape information. Working paper, Dept.of Computer Science, Yale University, USA (2007)Google Scholar
- 14.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)Google Scholar
- 15.Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS Journal on Computing 15(1), 82–92 (2003)MathSciNetCrossRefMATHGoogle Scholar
- 16.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)Google Scholar
- 17.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 HeuristicsGoogle Scholar
- 18.Hansen, P., Mladenović, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer Academic Publishers, Dordrecht (2003)CrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2008