Non-Local Sparse Image Inpainting for Document Bleed-Through Removal
Open Access
- 9 May 2018
- journal article
- research article
- Published by MDPI AG in Journal of Imaging
- Vol. 4 (5) , 68
Abstract
Bleed-through is a frequent, pervasive degradation in ancient manuscripts, which is caused by ink seeped from the opposite side of the sheet. Bleed-through, appearing as an extra interfering text, hinders document readability and makes it difficult to decipher the information contents. Digital image restoration techniques have been successfully employed to remove or significantly reduce this distortion. This paper proposes a two-step restoration method for documents affected by bleed-through, exploiting information from the recto and verso images. First, the bleed-through pixels are identified, based on a non-stationary, linear model of the two texts overlapped in the recto-verso pair. In the second step, a dictionary learning-based sparse image inpainting technique, with non-local patch grouping, is used to reconstruct the bleed-through-contaminated image information. An overcomplete sparse dictionary is learned from the bleed-through-free image patches, which is then used to estimate a befitting fill-in for the identified bleed-through pixels. The non-local patch similarity is employed in the sparse reconstruction of each patch, to enforce the local similarity. Thanks to the intrinsic image sparsity and non-local patch similarity, the natural texture of the background is well reproduced in the bleed-through areas, and even a possible overestimation of the bleed through pixels is effectively corrected, so that the original appearance of the document is preserved. We evaluate the performance of the proposed method on the images of a popular database of ancient documents, and the results validate the performance of the proposed method compared to the state of the art.Keywords
This publication has 58 references indexed in Scilit:
- Compression of facial images using the K-SVD algorithmJournal of Visual Communication and Image Representation, 2008
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Region Filling and Object Removal by Exemplar-Based Image InpaintingIEEE Transactions on Image Processing, 2004
- Independent component analysis for document restorationInternational Journal on Document Analysis and Recognition (IJDAR), 2004
- An Image Inpainting Technique Based on the Fast Marching MethodJournal of Graphics Tools, 2004
- Dictionary Learning Algorithms for Sparse RepresentationNeural Computation, 2003
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Sparse coding with an overcomplete basis set: A strategy employed by V1?Vision Research, 1997
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993