06.02.2013 Views

Abstract book (pdf) - ICPR 2010

Abstract book (pdf) - ICPR 2010

Abstract book (pdf) - ICPR 2010

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

siderable variations in camera settings, facial poses, and illumination conditions. In this paper, we apply a recently-proposed<br />

machine learning technique called covariate shift adaptation to alleviating lighting condition change between laboratory<br />

and practical environment. Through real-world age estimation experiments, we demonstrate the usefulness of our proposed<br />

method.<br />

10:00-10:20, Paper ThAT6.4<br />

Ranking Model for Facial Age Estimation<br />

Yang, Peng, Rutgers Univ.<br />

Lin, Zhong, Rutgers Univ.<br />

Metaxas, Dimitris, Rutgers Univ.<br />

Feature design and feature selection are two key problems in facial image based age perception. In this paper, we proposed<br />

to using ranking model to do feature selection on the haar-like features. In order to build the pairwise samples for the ranking<br />

model, age sequences are organized by personal aging pattern within each subject. The pairwise samples are extracted<br />

from the sequence of each subject. Therefore, the order information is intuitively contained in the pairwise data. Ranking<br />

model is used to select the discriminative features based on the pairwise data. The combination of the ranking model and<br />

personal aging pattern are powerful to select the discriminative features for age estimation. Based on the selected features,<br />

different kinds of regression models are used to build prediction models. The experiment results show the performance of<br />

our method is comparable to the state-of-art works.<br />

10:20-10:40, Paper ThAT6.5<br />

Development of Recognition Engine for Baby Faces<br />

Di, Wen, Tsinghua Univ.<br />

Zhang, Tong, Hewlett-Packard Lab.<br />

Fang, Chi, Tsinghua Univ.<br />

Ding, Xiaoqing, Tsinghua Univ.<br />

Existing face recognition approaches are mostly developed based on adult faces which may not work well in distinguishing<br />

faces of kids. Especially, baby faces tend to have common features such as round cheeks and chins, so that current face<br />

recognition engines often fail to differentiate them. In this paper, we present methods for discriminating baby faces from<br />

adult faces, and for training a special engine to recognize faces of different babies. To achieve these, we collected a huge<br />

number of baby face images and developed a software system to annotate the image database. Experimental results prove<br />

that the trained baby face recognizer achieves dramatic improvement on differentiating baby faces and the fusion of it<br />

with the conventional adult face recognition engine also works well on the overall data set containing both baby and adult<br />

faces.<br />

ThAT7 Dolmabahçe Hall C<br />

Document Retrieval Regular Session<br />

Session chair: Faruquie, Tanveer (IBM Res. India)<br />

09:00-09:20, Paper ThAT7.1<br />

An Information Extraction Model for Unconstrained Handwritten Documents<br />

Thomas, Simon, LITIS<br />

Chatelain, Clement, LITIS Lab. INSA de Rouen<br />

Heutte, Laurent, Univ. de Rouen<br />

Paquet, Thierry, Univ. of Rouen<br />

In this paper, a new information extraction system by statistical shallow parsing in unconstrained handwritten documents<br />

is introduced. Unlike classical approaches found in the literature as keyword spotting or full document recognition, our<br />

approch relies on a strong and powerful global handwriting model. A entire text line is considered as an indivisible entity<br />

and is modeled with Hidden Markov Models. In this way, text line shallow parsing allows fast extraction of the relevant<br />

information in any document while rejecting at the same time irrelevant information. First results are promising and show<br />

the interest of the approach.<br />

- 248 -

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

Saved successfully!

Ooh no, something went wrong!