arXiv · 0903.3103
Efficiently Learning a Detection Cascade with Sparse Eigenvectors
Abstract
In this work, we first show that feature selection methods other than boosting can also be used for training an efficient object detector. In particular, we introduce Greedy Sparse Linear Discriminant Analysis (GSLDA) \cite{Moghaddam2007Fast} for its conceptual simplicity and computational efficiency; and slightly better detection performance is achieved compared with \cite{Viola2004Robust}. Moreover, we propose a new technique, termed Boosted Greedy Sparse Linear Discriminant Analysis (BGSLDA), to efficiently train a detection cascade. BGSLDA exploits the sample re-weighting property of boosting and the class-separability criterion of GSLDA.
Explore related subjects
Keep this discovery
Chunhua Shen, Sakrapee Paisitkriangkrai, Jian Zhang. 2009-03-18. Efficiently Learning a Detection Cascade with Sparse Eigenvectors. https://arxiv.org/abs/0903.3103
Cite the original work for its findings. Save a collection to share your selection of sources.