• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Robust Real-time Object Detection (2001)

Cached

  • Download as a PDF

Download Links

  • [www.wisdom.weizmann.ac.il]
  • [www.iro.umontreal.ca]
  • [www.iro.umontreal.ca]
  • [www.hpl.hp.com]
  • [www.ai.mit.edu]
  • [www.merl.com]
  • [web.cs.swarthmore.edu]
  • [zoo.cs.yale.edu]
  • [research.microsoft.com]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [www.cs.sfu.ca]
  • [www.cs.sfu.ca]
  • [research.microsoft.com]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.liralab.it]
  • [www2.it.lut.fi]
  • [www.swarthmore.edu]
  • [www.micc.unifi.it]
  • [www0.cs.ucl.ac.uk]

  • Other Repositories/Bibliography

  • CiteULike
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Paul Viola , Michael Jones
Venue:International Journal of Computer Vision
Citations:860 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Viola01robustreal-time,
    author = {Paul Viola and Michael Jones},
    title = {Robust Real-time Object Detection},
    booktitle = {International Journal of Computer Vision},
    year = {2001}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

This paper describes a visual object detection framework that is capable of processing images extremely rapidly while achieving high detection rates. There are three key contributions. The first is the introduction of a new image representation called the “Integral Image ” which allows the features used by our detector to be computed very quickly. The second is a learning algorithm, based on AdaBoost, which selects a small number of critical visual features and yields extremely efficient classifiers [6]. The third contribution is a method for combining classifiers in a “cascade ” which allows background regions of the image to be quickly discarded while spending more computation on promising object-like regions. A set of experiments in the domain of face detection are presented. The system yields face detection performace comparable to the best previous systems [18, 13, 16, 12, 1]. Implemented on a conventional desktop, face detection proceeds at 15 frames per second. 1.

Citations

3527 Induction of decision trees - Quinlan - 1986
2427 A decision-theoretic generalization of online learning and an application to boosting - Freund, Schapire - 1995 (Show Context)

Citation Context

...by our detector to be computed very quickly. The second is a learning algorithm, based on AdaBoost, which selects a small number of critical visual features and yields extremely efficient classifiers =-=[6]-=-. The third contribution is a method for combining classifiers in a “cascade” which allows background regions of the image to be quickly discarded while spending more computation on promising object-l...

1058 A Model of SaliencyBased Visual Attention for Rapid Scene Analysis - Itti, Koch, et al. - 1998 (Show Context)

Citation Context

...tor by focussing attention on promising regions of the image. The notion behind focus of attention approaches is that it is often possible to rapidly determine where in an image an object might occur =-=[19, 8, 1]-=-. More complex processing is reserved only for these promising regions. The key measure of such an approach is the “false negative” rate of the attentional process. It must be the case that all, or al...

999 Neural network-based face detection - Rowley, Baluja, et al. - 1998
887 The design and use of steerable filters - Freeman, Adelson - 1991 (Show Context)

Citation Context

...aluation of the second dot product is accomplished with four array accesses. 2.2 Feature Discussion Rectangle features are somewhat primitive when compared with alternatives such as steerable filters =-=[5, 7]-=-. Steerable filters, and their relatives, are excellent for the detailed analysis of boundaries, image compression, and texture analysis. In contrast rectangle features, while sensitive to the presenc...

756 Boosting the margin: A new explanation for the effectiveness of voting methods,” The Annals of Statistics - Schapire, Freund, et al. (Show Context)

Citation Context

... boosting process, which selects a new weak classifier, can be viewed as a feature selection process. AdaBoost provides an effective learning algorithm and strong bounds on generalization performance =-=[14, 9, 10]-=-. The third major contribution of this paper is a method for combining successively more complex classifiers in a cascade structure which dramatically increases the speed of the detector by focussing ...

589 Training support vector machines: An application to face detection - Osuna, Freund, et al. - 1997 (Show Context)

Citation Context

... boosting process, which selects a new weak classifier, can be viewed as a feature selection process. AdaBoost provides an effective learning algorithm and strong bounds on generalization performance =-=[14, 9, 10]-=-. The third major contribution of this paper is a method for combining successively more complex classifiers in a cascade structure which dramatically increases the speed of the detector by focussing ...

395 A statistical method for 3d object detection applied to faces and cars - Schneidermn, Kanade - 2000
303 A general framework for object detection - Papageorgiou, Oren, et al. - 1998 (Show Context)

Citation Context

...entation called an integral image that allows for very fast feature evaluation. Motivated in part by the work of Papageorgiou et al. our detection system does not work directly with image intensities =-=[10]-=-. Like these authors we use a set of features which are reminiscent of Haar Basis functions (though we will also use related filters which are more complex than Haar filters). In order to compute thes...

303 Statistical Pattern Recognition - Webb - 2002 (Show Context)

Citation Context

...mbination of the hypotheses where the weights are inversely proportional to the training errors. 3.1 Learning Discussion Many general feature selection procedures have been proposed (see chapter 8 of =-=[20]-=- for a review). Our final application demanded a very aggressive process which would discard the vast majority of features. For a similar recognition problem Papageorgiou et al. proposed a scheme for ...

272 Modeling visual attention via selective tuning - Tsotsos, Culhane, et al. - 1995
257 Summed-area tables for texture mapping - Crow - 1984 (Show Context)

Citation Context

... to compute these features very rapidly at many scales we introduce the integral image representation for images (the integral image is very similar to the summed area table used in computer graphics =-=[3]-=- for texture mapping). The integral image can be computed from an image using a few operations per pixel. Once computed, any one of these Harr-like features can be computed at any scale or location in...

126 A SNoW-Based Face Detector - Yang, Roth, et al. - 2000 (Show Context)

Citation Context

...e computation on promising object-like regions. A set of experiments in the domain of face detection are presented. The system yields face detection performace comparable to the best previous systems =-=[18, 13, 16, 12, 1]-=-. Implemented on a conventional desktop, face detection proceeds at 15 frames per second. 1. Introduction This paper brings together new algorithms and insights to construct a framework for robust and...

104 Coarse-to-Fine Face Detection - Fleuret, Geman - 2001 (Show Context)

Citation Context

... the image. In recent work Fleuret and Geman have presented a face detection technique which relies on a “chain” of tests in order to signify the presence of a face at a particular scale and location =-=[4]-=-. The image properties measured by Fleuret and Geman, disjunctions of fine scale edges, are quite different than rectangle features which are simple, exist at all scales, and are somewhat interpretabl...

75 Joint Induction of Shape Features and Tree Classifiers - AMIT, WILDER - 1997 (Show Context)

Citation Context

...e computation on promising object-like regions. A set of experiments in the domain of face detection are presented. The system yields face detection performace comparable to the best previous systems =-=[18, 13, 16, 12, 1]-=-. Implemented on a conventional desktop, face detection proceeds at 15 frames per second. 1. Introduction This paper brings together new algorithms and insights to construct a framework for robust and...

62 Overcomplete steerable pyramid filters and rotation invariance - Greenspan, Belongie, et al. - 1994 (Show Context)

Citation Context

...aluation of the second dot product is accomplished with four array accesses. 2.2 Feature Discussion Rectangle features are somewhat primitive when compared with alternatives such as steerable filters =-=[5, 7]-=-. Steerable filters, and their relatives, are excellent for the detailed analysis of boundaries, image compression, and texture analysis. In contrast rectangle features, while sensitive to the presenc...

33 Example-based learning for view-based face detection - Sung, Poggio - 1998 (Show Context)

Citation Context

...e computation on promising object-like regions. A set of experiments in the domain of face detection are presented. The system yields face detection performace comparable to the best previous systems =-=[18, 13, 16, 12, 1]-=-. Implemented on a conventional desktop, face detection proceeds at 15 frames per second. 1. Introduction This paper brings together new algorithms and insights to construct a framework for robust and...

23 Boxlets: a fast convolution algorithm for signal processing and neural networks - Simard, Bottou, et al. - 1998 (Show Context)

Citation Context

... references, eight in the case of the three-rectangle features, and nine for four-rectangle features. One alternative motivation for the integral image comes from the “boxlets” work of Simard, et al. =-=[17]-=-. The authors point out that in the case of linear operations (e.g. *,+-), any invertible linear operation can be to* or- applied if its inverse is applied to the result. For example in the case of co...

The National Science Foundation
Apache Solr
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2014 The Pennsylvania State University