Share Email Print

Proceedings Paper

Robust least-square-baseline finding using a branch and bound algorithm
Author(s): Thomas M. Breuel
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 18 December 2001
PDF: 8 pages
Proc. SPIE 4670, Document Recognition and Retrieval IX, (18 December 2001); doi: 10.1117/12.450735
Show Author Affiliations
Thomas M. Breuel, Xerox Palo Alto Research Ctr. (United States)

Published in SPIE Proceedings Vol. 4670:
Document Recognition and Retrieval IX
Paul B. Kantor; Tapas Kanungo; Jiangying Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top