Object detection using feature subset selection

Zehang Sun

doi:10.1016/j.patcog.2004.03.013

2004-11-01

202

PRE

Zehang Sun

George Bebis

Ronald H. Miller

DOI：10.1016/j.patcog.2004.03.013

原文链接

原文求助

摘要

En 中文

Past work on object detection has emphasized the issues of feature extraction and classification, however, relatively less attention has been given to the critical issue of feature selection. The main trend in feature extraction has been representing the data in a lower dimensional space, for example, using principal component analysis (PCA). Without using an effective scheme to select an appropriate set of features in this space, however, these methods rely mostly on powerful classification algorithms to deal with redundant and irrelevant features. In this paper, we argue that feature selection is an important problem in object detection and demonstrate that genetic algorithms (GAs) provide a simple, general, and powerful framework for selecting good subsets of features, leading to improved detection rates. As a case study, we have considered PCA for feature extraction and support vector machines (SVMs) for classification. The goal is searching the PICA space using GAs to select a subset of eigenvectors encoding important information about the target concept of interest. This is in contrast to traditional methods selecting some percentage of the top eigenvectors to represent the target concept, independently of the classification task. We have tested the proposed framework on two challenging applications: vehicle detection and face detection. Our experimental results illustrate significant performance improvements in both cases. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keyword:

feature subset selection

genetic algorithms

vehicle detection

face detection

support vector machines