skip to main content
department
Free Access

DARPA Shredder challenge solved

Published:01 August 2012Publication History
Skip Abstract Section

Abstract

The eight-person winning team used original computer algorithms to narrow the search space and then relied on human observation to move the pieces into their final positions.

References

  1. Justino, E., Oliveira, L.S., and Freitas, C. Reconstructing shredded documents through feature matching, Forensic Science International 160, 2, July 13, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  2. Prandtstetter, M. and Günther, R.R. Combining forces to reconstruct strip shredded text documents, Proceedings of the 5th International Workshop on Hybrid Metaheuristics, Malaga, Spain, Oct. 8-9, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Schauer, S., Prandtstetter, M., and Günther, R.R. A memetic algorithm for reconstructing cross-cut shredded text documents, Proceedings of the 7th International Workshop on Hybrid Metaheuristics, Vienna, Austria, Oct. 1-2, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Skeoch, A. An investigation into automated shredded document reconstruction using heuristic search algorithms, Ph.D. thesis, University of Bath, 2006.Google ScholarGoogle Scholar
  5. Ukovich, A., Ramponi, G., Doulaverakis, H., Kompatsiaris, Y., and Strintzis, M. Shredded document reconstruction using MPEG-7 standard descriptors, Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology, Rome, Italy, Dec. 18-24, 2004.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. DARPA Shredder challenge solved

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image Communications of the ACM
              Communications of the ACM  Volume 55, Issue 8
              August 2012
              105 pages
              ISSN:0001-0782
              EISSN:1557-7317
              DOI:10.1145/2240236
              Issue’s Table of Contents

              Copyright © 2012 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 August 2012

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • department
              • Popular
              • Un-reviewed

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            HTML Format

            View this article in HTML Format .

            View HTML Format