International Conference on Document Analysis and Recognition
This paper describes a new algorithm for document binarization, building upon recent work in energy-based segmentation methods. It uses the Laplacian operator to assess the local likelihood of foreground and background labels, Canny edge detection to identify likely discontinuities, and a graph cut implementation to efficiently find the minimum energy solution of an objective function combining these concepts. The results of this algorithm place it near the top on both the DIBCO-09 and H-DIBCO assessments.
I.4.0.b Image processing software, I.4.6.b Graph-theoretic methods, I.4.6.d Pixel classification
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
© Nick Howe
Howe, Nicholas, "A Laplacian Energy for Document Binarization" (2011). Computer Science: Faculty Publications, Smith College, Northampton, MA.