A multi-stage approach — which is fast, robust and easy to train — for a face-detection system is proposed. Motivated by the work of Viola and Jones [1], this approach uses a cascade of classifiers to yield a coarse-to-fine strategy to reduce significantly detection time while maintaining a high detection rate. However, it is distinguished from previous work by two features. First, a new stage ...

We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle’s distribution), with minimal performance loss. Further, we explore the case of Freund and Schapire’s AdaBoost algorithm, bounding its distributions to polynomially smooth. The main advantage of AdaBoost over other boosti...

Well known for its simplicity and effectiveness in classification, AdaBoost, however, suffers from overfitting when class-conditional distributions have significant overlap. Moreover, it is very sensitive to noise that appears in the labels. This paper tackles the above limitations simultaneously via optimizing a modified loss function (i.e., the conditional risk). The proposed approach has the...

As more large-scale camera systems are deployed around the world, the need for video privacy is becoming increasingly vital. State of the art face and people tracking systems are not yet sufficiently robust for this domain, due to changing lighting conditions, occlusions, and the need to be realtime. This has motivated us to instead track visual markers worn by individuals who wish to have thei...

The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Gaussian. Second, the presence of a large, varying number of objects creates complex interactions with overlap and ambiguities. To surmount these difficulties, we introduce a vision system that is capable of learning, d...

This paper proposes the AdaBoost Gabor Fisher Classifier (AGFC) for robust face recognition, in which a chain AdaBoost learning method based on Bootstrap re-sampling is proposed and applied to face recognition with impressive recognition performance. Gabor features have been recognized as one of the most successful face representations, but it is too high dimensional for fast extraction and acc...

Recently sparse representation has gained great success in face image super-resolution. The conventional sparsity-based methods enforce sparse coding on face image patches and the representation fidelity is measured by `2-norm. Such a sparse coding model regularizes all facial patches equally, which however ignores distinct natures of different facial patches for image reconstruction. In this p...

We propose a classification technique for face expression recognition using AdaBoost that learns by selecting the relevant global and local appearance features with the most discriminating information. Selectivity reduces the dimensionality of the feature space that in turn results in significant speed up during online classification. We compare our method with another leading margin-based clas...

In this paper, generalized versions of two ensemble methods for regression based on variants of the original AdaBoost algorithm are proposed. The generalization of these regression methods consists in restricting the unit simplex for the weights of the instances to a smaller set of weighting probabilities. Various imprecise statistical models can be used to obtain a restricted set of weighting ...

Robust and fast human detection in static image is very important for real applications. Although different feature descriptors have been proposed for human detection, for HOG descriptor, how to select and combine more distinguish block-based HOGs, and how to simultaneously make use of the correlation and the local information of these selected HOGs still lack enough research and analysis. In t...