Robust least-square-baseline finding using a branch and bound algorithm
Thomas Michael Breuel · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2001
Many document analysis and OCR systems depend on precise identification of page rotation, as well as the reliable identification of text lines. This paper presents a new algorithm to address both problems. It uses a branch-and-bound approach to globally optimal line finding and simultaneously models the baseline and the descender line under a Gaussian error/robust least square model. Results of applying the algorithm to documents in the University of Washington Database 2 are presented.