The Community for Technology Leaders
Pattern Recognition, International Conference on (2000)
Barcelona, Spain
Sept. 3, 2000 to Sept. 8, 2000
ISBN: 0-7695-0750-6
pp: 4531
Song Mao , University of Maryland at College Park
Tapas Kanungo , University of Maryland at College Park
Most page segmentation algorithms have user-specifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values for these parameters. The free parameter values can affect the segmentation result quite drastically and are very dependent on the particular dataset that the algorithm is being used on. In this paper, we present an automatic training method for choosing free parameters of page segmentation algorithms. The automatic training problem is posed as a multivariate non-smooth function optimization problem. An efficient direct search method - simplex method - is used to solve this optimization problem. This training method is then applied to the training of Kise's page segmentation algorithm. It is found that a set of optimal parameter values and their corresponding performance index can be found using relatively few function evaluations. The UW III dataset was used for conducting our experiments.
Song Mao, Tapas Kanungo, "Automatic Training of Page Segmentation Algorithms: An Optimization Approach", Pattern Recognition, International Conference on, vol. 04, no. , pp. 4531, 2000, doi:10.1109/ICPR.2000.902974
91 ms
(Ver 3.3 (11022016))