Author
Abstract
Document image binarization remains a fundamental yet difficult issue, particularly when simultaneously facing multiple forms of degradations (e.g., noise, shadows, bleed-through and uneven background). This paper proposes a robust variational model for degraded document binarization, which consists of a weighted data term responsible for binarization, a robust regularization term accounting for character structure-preserving smoothness, and a penalty term ensuring the stable updating of the weight map toward the weight prior. In particular, the potential function for the data term is defined via local foreground/background centers of the input image. The regularization term is defined by gradient and a Huber loss weight function from robust statistics, where the scale parameter is estimated by the MAD estimator in robust regression. The weight prior is estimated from the input image, having the properties that it takes relatively large values around character borders and approaches to zero otherwise. The proposed variational model is proved to admit at least one solution within the space of functions of bounded variation. In the numerical implementation, the proposed model is split into two subproblems that are alternately solved via gradient descent and explicit finite differencing. Comprehensive experiments on nine public DIBCO datasets (2009 to 2014 and 2016 to 2018) show that the proposed model in general achieves higher binarization performance, in comparison to seven representative document binarization models based on partial differential equations/calculus of variations.
Suggested Citation
Wang, Yu & He, Chuanjiang, 2026.
"Robust variational model with weighted data term for degraded document binarization,"
Applied Mathematics and Computation, Elsevier, vol. 531(C).
Handle:
RePEc:eee:apmaco:v:531:y:2026:i:c:s0096300326002687
DOI: 10.1016/j.amc.2026.130216
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:531:y:2026:i:c:s0096300326002687. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.