Sciweavers

DAS
2006
Springer

Finding the Best-Fit Bounding-Boxes

13 years 7 months ago
Finding the Best-Fit Bounding-Boxes
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding-box is the smallest bounding-box among all the possible orientations for the same shape. In the context of document image analysis, the shapes can be characters (individual components) or paragraphs (component groups). This paper presents a search algorithm for the best-fit bounding-boxes of the textual component groups, whose shape are customarily rectangular in almost all languages. One of the applications of the best-fit bounding-boxes is the skew estimation from the text blocks in document images. This approach is capable of multi-skew estimation and location, as well as being able to process documents with sparse text regions. The University of Washington English Document Image Database (UW-I) is used to verify the skew estimation method directly and the proposed best-fit bounding-boxes algorithm indire...
Bo Yuan, Leong Kwoh, Chew Lim Tan
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where DAS
Authors Bo Yuan, Leong Kwoh, Chew Lim Tan
Comments (0)