The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Fast Asymmetric Learning for Cascade Face Detection
Abstract
A cascade face detector uses a sequence of node classifiers to distinguish faces from non-faces. This paper presents a new approach to design node classifiers in the cascade detector. Previous methods used machine learning algorithms that simultaneously select features and form ensemble classifiers. We argue that if these two parts are decoupled, we have the freedom to design a classifier that explicitly addresses the difficulties caused by the asymmetric learning goal. There are three contributions in this paper. The first is a categorization of asymmetries in the learning goal, and why they make face detection hard. The second is the Forward Feature Selection (FFS) algorithm and a fast pre- omputing strategy for AdaBoost. FFS and the fast AdaBoost can reduce the training time by approximately 100 and 50 times, in comparison to a naive implementation of the AdaBoost feature selection method. The last contribution is Linear Asymmetric Classifier (LAC), a classifier that explicitly handles the asymmetric learning goal as a well-defined constrained optimization problem. We demonstrated experimentally that LAC results in improved ensemble classifier performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Neural network-based face detection
Rowley, H. A., Baluja, S., & Kanade, T. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.655647 · Cited by 3,554
Mining with rarity: a unifying framework
Weiss, G. M. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007734 · Cited by 1,393
Cited by
Exploratory Undersampling for Class-Imbalance Learning
Liu, X.-Y., Wu, J., & Zhou, Z.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2007853 · Cited by 2,465
Self-citationCENTRIST: A Visual Descriptor for Scene Categorization
Wu, J., & Rehg, J. M. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.224 · Cited by 709
Self-citationA rapid learning algorithm for vehicle classification
Wen, X., Shao, L., Xue, Y., & Fang, W. (2015) · Information Sciences · doi:10.1016/j.ins.2014.10.040 · Cited by 479
A survey on face detection in the wild: Past, present and future
Zafeiriou, S., Zhang, C., & Zhang, Z. (2015) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2015.03.015 · Cited by 458
Sabokrou, M., Fayyaz, M., Fathy, M., & Klette, R. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2670780 · Cited by 386
Metadata
- Authors
- Wu, J., Brubaker, S. C., Mullin, M. D., & Rehg, J. M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2008-03
- Volume
- 30
- Issue
- 3
- Pages
- 369-382
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2104577112
- Cited by
- 230
- References
- 2
- FWCI
- 39.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast Asymmetric Learning for Cascade Face Detection. https://app.cochat.ai/papers/10.1109/tpami.2007.1181
- The paper
- Wu, J., Brubaker, S. C., Mullin, M. D., & Rehg, J. M. (2008). Fast Asymmetric Learning for Cascade Face Detection. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2007.1181
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.