Robust least square baseline finding using a branch and bound algorithm

被引：0

作者：

Breuel, TM ^{[1
]}

机构：

[1] Xerox Corp, Palo Alto Res Ctr, Palo Alto, CA 94304 USA

来源：

DOCUMENT RECOGNITION AND RETRIEVAL IX | 2002年 / 4670卷

关键词：

document analysis; layout analysis; skew detection; page rotation; text line finding; affine transformations;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：20 / 27

页数：8

共 50 条

[1] Multi-baseline phase unwrapping with robust branch and bound pure integer programming algorithm
Liu, Hui
Yue, JiaWei
Liu, WenKai
Huang, QiHuan
Li, GeShuang
Liu, Min
OPTICS AND LASERS IN ENGINEERING, 2023, 161
[2] Robust identification using new Wilcoxon least mean square algorithm
Majhi, B.
Panda, G.
Mulgrew, B.
ELECTRONICS LETTERS, 2009, 45 (06) : 334 - U13
[3] A BRANCH AND BOUND ALGORITHM FOR CONSTRAINED LEAST-SQUARES
CUTLER, A
COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 1993, 22 (02) : 305 - 321
[4] Branch and bound algorithm with applications to robust stability
Laleh Ravanbod
Dominikus Noll
Pierre Apkarian
Journal of Global Optimization, 2017, 67 : 553 - 579
[5] Branch and bound algorithm with applications to robust stability
Ravanbod, Laleh
Noll, Dominikus
Apkarian, Pierre
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 67 (03) : 553 - 579
[6] Robust Constrained Least Square Constant Modulus Algorithm
Song, Xin
Wang, Jinkuan
Wang, Bin
2009 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION, VOL 3, PROCEEDINGS, 2009, : 266 - +
[7] Integer least squares estimation based on branch and bound algorithm
Song, Yingchun
Hui, Shenying
Liu, Jie
Lin, Dongfang
Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University, 2011, 36 (10): : 1241 - 1245
[8] An efficient branch-and-bound algorithm for finding a maximum clique
Tomita, E
Seki, T
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2731 : 278 - 289
[9] A BRANCH AND BOUND ALGORITHM FOR FINDING THE MODES IN KERNEL DENSITY ESTIMATES
Wirjadi, Oliver
Breuel, Thomas
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2009, 8 (01) : 17 - 35
[10] Robust Incremental Least Mean Square Algorithm With Dynamic Combiner
Qadri, Syed Safi Uddin
Arif, Muhammad
Naseem, Imran
Moinuddin, Muhammad
IEEE ACCESS, 2022, 10 : 75135 - 75143

← 1 2 3 4 5 →