mlsanityData to 14 Oct 2026

SauvolaNet: Learning Adaptive Sauvola Network for Degraded Document Binarization

arXiv 2105.05521 ↗First posted 12 May 2021cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

Inspired by the classic Sauvola local image thresholding approach, we systematically study it from the deep neural network (DNN) perspective and propose a new solution called SauvolaNet for degraded document binarization (DDB). It is composed of three explainable modules, namely, Multi-Window Sauvola (MWS), Pixelwise Window Attention (PWA), and Adaptive Sauolva Threshold (AST). The MWS module honestly reflects the classic Sauvola but with trainable parameters and multi-window settings. The PWA module estimates the preferred window sizes for each pixel location. The AST module further consolidates the outputs from MWS and PWA and predicts the final adaptive threshold for each pixel location. As a result, SauvolaNet becomes end-to-end trainable and significantly reduces the number of required network parameters to 40K -- it is only 1% of MobileNetV2. In the meantime, it achieves the State-of-The-Art (SoTA) performance for the DDB task -- SauvolaNet is at least comparable to, if not better than, SoTA binarization solutions in our extensive studies on the 13 public document binarization datasets. Our source code is available at https://github.com/Leedeng/SauvolaNet.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 4 of its 35 references that are in the map. First posted on arXiv 12 May 2021.

Builds on

4 of 35 references.

References · 4

  1. 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,161
  2. 2020DE-GAN: A Conditional Generative Adversarial Network for Document Enhancementcited by 44
  3. 2017A selectional auto-encoder approach for document image binarizationcited by 22
  4. 2015Learning Document Image Binarization from Datacited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 0; 2023: 3; 2024: 1; 2025: 0; 2026: 2.

8 papers.