06.02.2013 Views

Abstract book (pdf) - ICPR 2010

Abstract book (pdf) - ICPR 2010

Abstract book (pdf) - ICPR 2010

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

image that it is currently displayed and data of the rest of the temporally adjacent images. This scheduler uses a model based<br />

on the quality progression of the image in order to estimate which percentage of the bandwidth is dedicated to prefetch data.<br />

Our experimental results prove that a significant benefit can be achieved in terms of both subjective quality and responsiveness<br />

by means of prefetching.<br />

13:30-16:30, Paper WeBCT9.15<br />

Binarization of Color Characters in Scene Images using K-Means Clustering and Support Vector Machines<br />

Wakahara, Toru, Hosei Univ.<br />

Kita, Kohei, Hosei Univ.<br />

This paper proposes a new technique for binalizing multicolored characters subject to heavy degradations. The key ideas are<br />

threefold. The first is generation of tentatively binarized images via every dichotomization of k clusters obtained by k-means<br />

clustering in the HSI color space. The total number of tentatively binarized images equals 2^k2. The second is use of support<br />

vector machines (SVM) to determine whether and to what degree each tentatively binarized image represents a character or<br />

non-character. We feed the SVM with mesh and weighted direction code histogram features to output the degree of character-likeness.<br />

The third is selection of a single binarized image with the maximum degree of character likeness as an optimal<br />

binarization result. Experiments using a total of 1000 single-character color images extracted from the ICDAR 2003 robust<br />

OCR dataset show that the proposed method achieves a correct binarization rate of 93.7%.<br />

13:30-16:30, Paper WeBCT9.16<br />

A Self-Training Learning Document Binarization Framework<br />

Su, Bolan, National Univ. of Singapore<br />

Lu, Shijian, -<br />

Tan, Chew-Lim, National Univ. of Singapore<br />

Document Image Binarization techniques have been studied for many years, and many practical binarization techniques have<br />

been developed and applied successfully on commercial document analysis systems. However, the current state-of-the-art<br />

methods, fail to produce good binarization results for many badly degraded document images. In this paper, we propose a<br />

self-training learning framework for document image binarization. Based on reported binarization methods, the proposed<br />

framework first divides document image pixels into three categories, namely, foreground pixels, background pixels and uncertain<br />

pixels. A classifier is then trained by learning from the document image pixels in the foreground and background categories.<br />

Finally, the uncertain pixels are classified using the learned pixel classifier. Extensive experiments have been<br />

conducted over the dataset that is used in the recent Document Image Binarization Contest(DIBCO) 2009. Experimental results<br />

show that our proposed framework significantly improves the performance of reported document image binarization<br />

methods.<br />

13:30-16:30, Paper WeBCT9.17<br />

Novel Edge Features for Text Frame Classification in Video<br />

Palaiahnakote, Shivakumara, National Univ. of Singapore<br />

Tan, Chew-Lim, National Univ. of Singapore<br />

Text frame classification is needed in many applications such as event identification, exact event boundary identification,<br />

navigation, video surveillance in multimedia etc. To the best of our knowledge, there are no methods reported solely dedicated<br />

to text frame classifications so far. Hence this paper presents a new approach to text frame classification in video based on<br />

capturing local observable edge properties of text frames, by virtue of the strong presence of sharp edges, straight appearances<br />

of edges and consistent proximity between edges. The approach initially classifies the blocks of the frame into text blocks<br />

and non-text blocks. The true text block is then identified among classified text blocks to detect text frames by the proposed<br />

features. If the text frame produces one true text block then it is considered as a text frame otherwise a non-text frame. We<br />

evaluate the proposed approach on a large database containing both text and nontext frames and publicly available data at<br />

two levels, i.e., estimating recall and precision at the block level and the frame level.<br />

13:30-16:30, Paper WeBCT9.18<br />

Image Matching and Retrieval by Repetitive Patterns<br />

Doubek, Petr, Czech Tech. Univ. in Prague<br />

Matas, Jiri, Czech Tech. Univ. in Prague<br />

- 231 -

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!