Fast(er) Reconstruction of Shredded Text Documents via Self-Supervised
Deep Asymmetric Metric Learning
- URL: http://arxiv.org/abs/2003.10063v4
- Date: Wed, 29 Apr 2020 00:21:31 GMT
- Title: Fast(er) Reconstruction of Shredded Text Documents via Self-Supervised
Deep Asymmetric Metric Learning
- Authors: Thiago M. Paix\~ao, Rodrigo F. Berriel, Maria C. S. Boeres, Alessando
L. Koerich, Claudine Badue, Alberto F. De Souza and Thiago Oliveira-Santos
- Abstract summary: A central problem in automatic reconstruction of shredded documents is the pairwise compatibility evaluation of the shreds.
This work proposes a scalable deep learning approach for measuring pairwise compatibility in which the number of inferences scales linearly.
Our method has accuracy comparable to the state-of-the-art with a speed-up of about 22 times for a test instance with 505 shreds.
- Score: 62.34197797857823
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The reconstruction of shredded documents consists in arranging the pieces of
paper (shreds) in order to reassemble the original aspect of such documents.
This task is particularly relevant for supporting forensic investigation as
documents may contain criminal evidence. As an alternative to the laborious and
time-consuming manual process, several researchers have been investigating ways
to perform automatic digital reconstruction. A central problem in automatic
reconstruction of shredded documents is the pairwise compatibility evaluation
of the shreds, notably for binary text documents. In this context, deep
learning has enabled great progress for accurate reconstructions in the domain
of mechanically-shredded documents. A sensitive issue, however, is that current
deep model solutions require an inference whenever a pair of shreds has to be
evaluated. This work proposes a scalable deep learning approach for measuring
pairwise compatibility in which the number of inferences scales linearly
(rather than quadratically) with the number of shreds. Instead of predicting
compatibility directly, deep models are leveraged to asymmetrically project the
raw shred content onto a common metric space in which distance is proportional
to the compatibility. Experimental results show that our method has accuracy
comparable to the state-of-the-art with a speed-up of about 22 times for a test
instance with 505 shreds (20 mixed shredded-pages from different documents).
Related papers
- Contextual Document Embeddings [77.22328616983417]
We propose two complementary methods for contextualized document embeddings.
First, an alternative contrastive learning objective that explicitly incorporates the document neighbors into the intra-batch contextual loss.
Second, a new contextual architecture that explicitly encodes neighbor document information into the encoded representation.
arXiv Detail & Related papers (2024-10-03T14:33:34Z) - A Novel Dataset for Non-Destructive Inspection of Handwritten Documents [0.0]
Forensic handwriting examination aims to examine handwritten documents in order to properly define or hypothesize the manuscript's author.
We propose a new and challenging dataset consisting of two subsets: the first consists of 21 documents written either by the classic pen and paper" approach (and later digitized) and directly acquired on common devices such as tablets.
Preliminary results on the proposed datasets show that 90% classification accuracy can be achieved on the first subset.
arXiv Detail & Related papers (2024-01-09T09:25:58Z) - Innovative Methods for Non-Destructive Inspection of Handwritten
Documents [0.0]
We present a framework capable of extracting and analyzing intrinsic measures of manuscript documents using image processing and deep learning techniques.
By quantifying the Euclidean distance between the feature vectors of the documents to be compared, authorship can be discerned.
Experimental results demonstrate the ability of our method to objectively determine authorship in different writing media, outperforming the state of the art.
arXiv Detail & Related papers (2023-10-17T12:45:04Z) - Natural Logic-guided Autoregressive Multi-hop Document Retrieval for
Fact Verification [21.04611844009438]
We propose a novel retrieve-and-rerank method for multi-hop retrieval.
It consists of a retriever that jointly scores documents in the knowledge source and sentences from previously retrieved documents.
It is guided by a proof system that dynamically terminates the retrieval process if the evidence is deemed sufficient.
arXiv Detail & Related papers (2022-12-10T11:32:38Z) - GERE: Generative Evidence Retrieval for Fact Verification [57.78768817972026]
We propose GERE, the first system that retrieves evidences in a generative fashion.
The experimental results on the FEVER dataset show that GERE achieves significant improvements over the state-of-the-art baselines.
arXiv Detail & Related papers (2022-04-12T03:49:35Z) - Specialized Document Embeddings for Aspect-based Similarity of Research
Papers [4.661692753666685]
We treat aspect-based similarity as a classical vector similarity problem in aspect-specific embedding spaces.
We represent a document not as a single generic embedding but as multiple specialized embeddings.
Our approach mitigates potential risks arising from implicit biases by making them explicit.
arXiv Detail & Related papers (2022-03-28T07:35:26Z) - Fourier Document Restoration for Robust Document Dewarping and
Recognition [73.44057202891011]
This paper presents FDRNet, a Fourier Document Restoration Network that can restore documents with different distortions.
It dewarps documents by a flexible Thin-Plate Spline transformation which can handle various deformations effectively without requiring deformation annotations in training.
It outperforms the state-of-the-art by large margins on both dewarping and text recognition tasks.
arXiv Detail & Related papers (2022-03-18T12:39:31Z) - DocScanner: Robust Document Image Rectification with Progressive
Learning [162.03694280524084]
This work presents DocScanner, a new deep network architecture for document image rectification.
DocScanner maintains a single estimate of the rectified image, which is progressively corrected with a recurrent architecture.
The iterative refinements make DocScanner converge to a robust and superior performance, and the lightweight recurrent architecture ensures the running efficiency.
arXiv Detail & Related papers (2021-10-28T09:15:02Z) - Self-supervised Deep Reconstruction of Mixed Strip-shredded Text
Documents [63.41717168981103]
This work extends our previous deep learning method for single-page reconstruction to a more realistic/complex scenario.
In our approach, the compatibility evaluation is modeled as a two-class (valid or invalid) pattern recognition problem.
The proposed method outperforms the competing ones on complex scenarios, achieving accuracy superior to 90%.
arXiv Detail & Related papers (2020-07-01T21:48:05Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.