# Show-through removal with sparsity-based blind deconvolution

**Authors:** Sota Kawakami, Hiroyuki Kudo, Abel C.H. Chen, Abel C.H. Chen, Abel C.H. Chen, Abel C.H. Chen

PMC · DOI: 10.1371/journal.pone.0305208 · PLOS ONE · 2024-06-12

## TL;DR

This paper introduces a new method to remove show-through in scanned documents using sparsity-based blind deconvolution techniques.

## Contribution

A novel show-through removal method based on nuclear norm minimization and blind deconvolution is proposed.

## Key findings

- The proposed method uses a cost function with data, nuclear norm, and regularization terms for effective show-through removal.
- Simulation and real image experiments demonstrate the effectiveness of the new approach.
- The method leverages the Accelerated Proximal Gradient and Singular Value Projection for fast convergence.

## Abstract

When scanning a document printed on both sides by using an electronic scanner, the printed material on the back (front) side may be transmitted to the front (back) side. This phenomenon is called show-through. The problem to remove the show-through from scanned images is called the show-through removal in the literature. In this paper, we propose a new method of show-through removal based on the following principle. The proposed method uses two scanned images with the front side and with the back side as input images. The proposed method is based on Ahmed’s Blind Image Deconvolution method discovered in 2013, which succeeded in formulating Blind Image Deconvolution as a nuclear norm minimization. Since the structure of show-through removal resembles that of Blind Image Deconvolution, we discovered that the show-through removal can be reformulated into a nuclear norm minimization in the space of outer product matrix constructed from an image vector and a point spread function vector of blurring. Using this key idea, we constructed the proposed method as follows. First, our cost function consists of the following three terms. The first term is the data term and the second term is the nuclear norm derived from the above reformulation. The third term is a regularization term to overcome the underdetermined nature of show-through removal problem and the existence of noise in the measured images. The regularization term consists of Total Variation imposed on the images. The resulting nuclear norm minimization problem is solved by using Accelerated Proximal Gradient method and Singular Value Projection with some problem-specific modifications, which converges fast and requires a simple implementation. We show results of simulation studies as well as results of real image experiments to demonstrate the performances of the proposed method.

## Full-text entities

- **Diseases:** ACCELATED PROXIMAL (MESH:D014897)
- **Chemicals:** H (MESH:D006859), APG (-)
- **Species:** Homo sapiens (human, species) [taxon 9606]
- **Cell lines:** S1 — Gallus gallus (Chicken), Chicken bursal lymphoma, Cancer cell line (CVCL_1T28), S2 — Drosophila melanogaster (Fruit fly), Spontaneously immortalized cell line (CVCL_Z232)

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/PMC11168677/full.md

## Figures

14 figures with captions in the complete paper: https://tomesphere.com/paper/PMC11168677/full.md

## References

14 references — full list in the complete paper: https://tomesphere.com/paper/PMC11168677/full.md

---
Source: https://tomesphere.com/paper/PMC11168677