Document reconstruction using dynamic programming

/in , , /by
Document reconstruction using dynamic programming

Pimenta, Andre and Justino, Edson and Oliveira, Luiz S. and Sabourin, Robert

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing – Proceedings 2009

Abstract : In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approximation to reduce the complexity of the boundaries and extract features from them. Thereafter, these features are used to feed the LCS dynamic programming algorithm. The scores yielded by the LCS algorithm are then used into a modified Prim’s algorithm to find the best match among all pieces. Comprehensive experiments on a database composed of 100 shredded documents support the efficiency of the proposed methodology. When compared to global search algorithms, this approach brings an improvement of 18% in the number of fragments reconstructed. ©2009 IEEE.

You might also like
Ontology-based adaptive information system framework
A dual-staged classification-selection approach for automated update of biometric templates
Audio-visual fusion for emotion recognition in the valence-arousal space using joint cross-attention
Figureqa: An annotated figure dataset for visual reasoning
On the pitfalls of entropy-based uncertainty for multi-class semi-supervised segmentation
Dynamic ensemble selection and data preprocessing for multi-class imbalance learning
Texture-based descriptors for writer identification and verification
A random walk approach for multiatlas-based segmentation