Sciweavers

71 search results - page 9 / 15
» Boosting recombined weak classifiers
Sort
View
ICML
2004
IEEE
14 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
ICIP
2007
IEEE
14 years 11 months ago
Domain-Partitioning Rankboost for Face Recognition
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
Bangpeng Yao, Haizhou Ai, Yoshihisa Ijiri, Shihong...
ICCV
2005
IEEE
14 years 11 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
DAGM
2007
Springer
14 years 1 months ago
Greedy-Based Design of Sparse Two-Stage SVMs for Fast Classification
Cascades of classifiers constitute an important architecture for fast object detection. While boosting of simple (weak) classifiers provides an established framework, the design of...
Rezaul Karim, Martin Bergtholdt, Jörg H. Kapp...
ICML
2009
IEEE
14 years 10 months ago
Compositional noisy-logical learning
We describe a new method for learning the conditional probability distribution of a binary-valued variable from labelled training examples. Our proposed Compositional Noisy-Logica...
Alan L. Yuille, Songfeng Zheng