Skip to Main content Skip to Navigation
New interface
Journal articles

Unsupervised refinement of color and stroke features for text binarization

Abstract : Color and strokes are the salient features of text regions in an image. In this work, we use both these features as cues, and introduce a novel energy function to formulate the text binarization problem. The minimum of this energy function corresponds to the optimal binarization. We minimize the energy function with an iterative graph cut based algorithm. Our model is robust to variations in foreground and background as we learn Gaussian mixture models for color and strokes in each iteration of the graph cut. We show results on word images from the challenging ICDAR 2003/2011, born-digital image and street view text datasets, as well as full scene images containing text from ICDAR 2013 datasets, and compare our performance with state-of-the-art methods. Our approach shows significant improvements in performance under a variety of performance measures commonly used to assess text binarization schemes. In addition , our method adapts to diverse document images, like text in videos, handwritten text images.
Document type :
Journal articles
Complete list of metadata
Contributor : Karteek Alahari Connect in order to contact the contributor
Submitted on : Tuesday, March 14, 2017 - 11:12:42 PM
Last modification on : Friday, November 4, 2022 - 3:02:52 PM
Long-term archiving on: : Thursday, June 15, 2017 - 3:11:22 PM


Files produced by the author(s)




Anand Mishra, Karteek Alahari, C.V. Jawahar. Unsupervised refinement of color and stroke features for text binarization. International Journal on Document Analysis and Recognition, 2017, 20 (2), pp.105-121. ⟨10.1007/s10032-017-0283-9⟩. ⟨hal-01490176⟩



Record views


Files downloads