A Contour Matching Algorithm to Reconstruct Ruptured Documents

Stieber, Anke; Schneider, Jan; Nickolay, Bertram; Krüger, Jörg

doi:10.1007/978-3-642-15986-2_13

Cited by 8 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One approach similar to our work is that of Stieber et al [5], who adopt the Smith-Waterman algorithm for partial contour matching between document pieces. In their method the authors only compare contour segments delimited by subsequent corners, which helps in avoiding false matches that are inconsistent regarding the pieces' global geometry.…”

Section: Related Workmentioning

confidence: 91%

Partial contour matching for document pieces with content-based prior

Richter

Ries

Romberg

et al. 2014

2014 IEEE International Conference on Multimedia and Expo (ICME)

View full text Add to dashboard Cite

In this paper we present a method for aligning shredded document pieces based on outer contours and content-based prior information. Our approach relies on domain-specific knowledge that document pieces must complement each other when aligned correctly. Building on this intuition we propose a variant of MSAC (M-estimator SAmple Consensus) to estimate an hypothesis that recovers the spatial relationship between pairs of pieces. To do so we first approximate their boundaries by polygons from which we define consensus sets between fragments. Each consensus set provides multiple hypotheses for aligning one piece onto the other. An optimal hypothesis is identified by applying a two-stage procedure in which we discard locally inconsistent hypotheses before verifying the remainder for global consistency.

show abstract

Section: Related Workmentioning

confidence: 91%

Partial contour matching for document pieces with content-based prior

Richter

Ries

Romberg

et al. 2014

2014 IEEE International Conference on Multimedia and Expo (ICME)

View full text Add to dashboard Cite

show abstract

“…Stieber et al. aim to assemble the fragments of double‐sided documents through a method robust against flipping over and rotation. The relevant method generates contour information regarding the front and reverse sides of fragments.…”

Section: Related Workmentioning

confidence: 99%

“…The combinations of tear are generated specifically for this document during manual tearing, and by evaluating the specific tearing form, it is shown that it will not be necessary to match some fragments with each other. Stieber et al (17) aim to assemble the fragments of double-sided documents through a method robust against flipping over and rotation. The relevant method generates contour information regarding the front and reverse sides of fragments.…”

mentioning

confidence: 99%

Solving Double‐Sided Puzzles: Automated Assembly of Torn‐up Banknotes Evidence

Yılmaz

Nabiyev

2019

Journal of Forensic Sciences

View full text Add to dashboard Cite

Reconstruction of 2D object is a problem concerning many different fields such as forensics science, archiving, and banking. In the literature, it is considered as one‐sided puzzle problem. But this study handles torn banknotes as a double‐sided puzzle problem for the first time. In addition to that, a new dataset (ToB) is created for solving this problem. A selection approach based on the Borda count method is adopted in order to make the right decision as to which keypoint‐based method is to be used in the proposed reconstruction system. The selection approach was determined the Accelerated‐KAZE (AKAZE) as the most successful keypoint‐based method. This study also proposes new measures determining the success ratio of the reconstructed banknotes and calculating their loss ratio. When the torn banknotes were reconstructed with the AKAZE‐based reconstruction system, the average success rate was calculated as 95.55% by the proposed metric.

show abstract

“…In the last decade, many studies focused on the reconstruction of documents shredded by hands [6][7][8][9], and by strip-cut machines [10][11][12]. In the case of cross-cut shredded document reconstruction, existing approaches have initially been tested only on simulated shredded text documents [13][14][15][16][17], in which the shreds have a rectangular shape and its corners are aligned perfectly.…”

Section: Related Workmentioning

confidence: 99%

Assessing Cross-Cut Shredded Document Assembly

Saboia

Goldenstein

2014

Advanced Information Systems Engineering

View full text Add to dashboard Cite

Abstract. In this paper we address the problem of quantitative evaluation of cross-cut shredded document reconstruction. We propose quantitative metrics using graph theory and classic information retrieval concepts to compare the neighborhood connectivity graph of a reassembled document shredded by a cross-cut machine against the neighborhood graph of the ground-truth. These metrics focus entirely on the proper relative positioning of the shredded pieces. To do so, we have shredded 12 documents containing diverse content, such as handwriting, printed text, images and photographs. We then scanned, extracted the pieces, and reassembled them into the ground-truth. This dataset is available to the readers, with the original documents, the digital representation of the shreds, and the scripts that provide the quantitative evaluation of the users reconstructions.

show abstract

A Contour Matching Algorithm to Reconstruct Ruptured Documents

Cited by 8 publications

References 10 publications

Partial contour matching for document pieces with content-based prior

Partial contour matching for document pieces with content-based prior

Solving Double‐Sided Puzzles: Automated Assembly of Torn‐up Banknotes Evidence

Assessing Cross-Cut Shredded Document Assembly

Contact Info

Product

Resources

About