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.

09:00-11:10, Paper TuAT8.8<br />

Background Filtering for Improving of Object Detection in Images<br />

Qin, Ge, Univ. of Surrey<br />

Vrusias, Bogdan, Univ. of Surrey<br />

Gillam, Lee, Univ. of Surrey<br />

We propose a method for improving object recognition in street scene images by identifying and filtering out background<br />

aspects. We analyse the semantic relationships between foreground and background objects and use the information obtained<br />

to remove areas of the image that are misclassified as foreground objects. We show that such background filtering<br />

improves the performance of four traditional object recognition methods by over 40%. Our method is independent of the<br />

recognition algorithms used for individual objects, and can be extended to generic object recognition in other environments<br />

by adapting other object models.<br />

09:00-11:10, Paper TuAT8.9<br />

Sparse Local Discriminant Projections for Feature Extraction<br />

Lai, Zhihui, Nanjing Univ. of Science and Tech.<br />

Jin, Zhong, Nanjing Univ. of Science and Tech.<br />

Yang, Jian, Nanjing Univ. of Science and Tech.<br />

Wong, W.K., The Hong Kong Pol. Univ.<br />

One of the major disadvantages of the linear dimensionality reduction algorithms, such as Principle Component Analysis<br />

(PCA) and Linear Discriminant Analysis (LDA), are that the projections are linear combination of all the original features<br />

or variables and all weights in the linear combination known as loadings are typically non-zero. Thus, they lack physical<br />

interpretation in many applications. In this paper, we propose a novel supervised learning method called Sparse Local<br />

Discriminant Projections (SLDP) for linear dimensionality reduction. SLDP introduces a sparse constraint into the objective<br />

function and obtains a set of sparse projective axes with directly physical interpretation. The sparse projections can be efficiently<br />

computed by the Elastic Net combining with spectral analysis. The experimental results show that SLDP give<br />

the explicit interpretation on its projections and achieves competitive performance compared with some dimensionality<br />

reduction techniques.<br />

09:00-11:10, Paper TuAT8.10<br />

Information-Theoretic Feature Selection from Unattributed Graphs<br />

Bonev, Boyan, Univ. of Alicante<br />

Escolano, Francisco, Univ. of Alicante<br />

Giorgi, Daniela, National Res. Council<br />

Biasotti, Silvia, CNR – IMATI<br />

In this work we evaluate purely structural graph measures for 3D objects classification. We extract spectral features from<br />

different Reeb graph representations. Information-theoretic feature selection gives an insight on which are the most relevant<br />

features.<br />

09:00-11:10, Paper TuAT8.11<br />

Head Pose Estimation based on Random Forests for Multiclass Classification<br />

Huang, Chen, Tsinghua Univ.<br />

Ding, Xiaoqing, Tsinghua Univ.<br />

Fang, Chi, Tsinghua Univ.<br />

Head pose estimation remains a unique challenge for computer vision system due to identity variation, illumination<br />

changes, noise, etc. Previous statistical approaches like PCA, linear discriminative analysis (LDA) and machine learning<br />

methods, including SVM and Adaboost, cannot achieve both accuracy and robustness that well. In this paper, we propose<br />

to use Gabor feature based random forests as the classification technique since they naturally handle such multi-class classification<br />

problem and are accurate and fast. The two sources of randomness, random inputs and random features, make<br />

random forests robust and able to deal with large feature spaces. Besides, we implement LDA as the node test to improve<br />

the discriminative power of individual trees in the forest, with each node generating both constant and variant number of<br />

children nodes. Experiments are carried out on two public databases to show the proposed algorithm outperforms other<br />

approaches in both accuracy and computational efficiency.<br />

- 83 -

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

Saved successfully!

Ooh no, something went wrong!