Fast incremental algorithm for speeding up the computation of binarization

DOI10.1016/j.amc.2009.02.061zbMath1164.94001OpenAlexW2010976002MaRDI QIDQ1026317

J. Blot

Publication date: 24 June 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.02.061

zbMATH Keywords

quantizationbinarizationincremental algorithmheapKittler and Illingworth methodOtsu methodwithin-variance

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (2)

Optimal multilevel thresholding using molecular kinetic theory optimization algorithm ⋮ Optimal multi-level thresholding based on maximum Tsallis entropy via an artificial bee colony approach

Cites Work

• Unnamed Item
• Fast adaptive PNN-based thresholding algorithms.
• Adaptive degraded document image binarization
• Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning- and LUT-based voting platform
• A fast search algorithm for vector quantization using mean pyramids of codewords
• An Efficient Randomized Algorithm for Detecting Circles
• Document image binarization based on topographic analysis using a water flow model

This page was built for publication: Fast incremental algorithm for speeding up the computation of binarization