Adaboost训练程序

http://c2inet.sce.ntu.edu.sg/Jianxin/，作者网址。

http://c2inet.sce.ntu.edu.sg/Jianxin/projects/libHIK/libHIK.htm

libHIK : clustering and classifying feature vectors that are histograms
There are four components within libHIK:
(Since version 2.0) ICD (Intersection Coordinate Descent), a super-fast, reliable, and scalable HIK SVM solver. 
Only slightly slower than linear SVM 
Scales to millions of examples and tens of thousands of feature dimensions 
(Since version 2.05) support for exponential HIK.
A clustering method that uses the Histogram Intersection Kernel (HIK); 
K-means and K-median clustering are also implemented in libHIK; 
A method that makes applying HIK SVM models extremely fast on histograms that are integers; 
We also provided ways to convert real-valued histograms to integer ones. Our experiments show that there are no obvious difference between these two – the integer version works better in many cases; 
Use the clustering and classification methods in the Bag of Visual words model; 
Common visual codebook generation methods used in a BOV model , e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual code words. However, most popular visual descriptors are histograms of image measurements. It has been shown that the HIK is more effective than the Euclidean distance in supervised learning tasks with histogram features. In libHIK, we demonstrate that HIK can also be used in an unsupervised manner to significantly improve the generation of visual codebooks; 
In addition, we propose a one-class SVM formulation to create more effective visual code words which can achieve even higher accuracy. 

---

For technical details, please refer to the following paper in the publication page: 
(for ICD)
A Fast Dual Method for HIK SVM Learning
Jianxin Wu
ECCV 2010, 11th European Conference on Computer Vision, Crete, Greece, September 5-11, 2010
(for Others)
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Jianxin Wu and James M. Rehg
ICCV 2009, Kyoto, Japan, Sep. 27-Oct. 4, 2009.

---

Version 2.05 of libHIK is available as a zip file here. Currently only C++ are supported in both Linux and Windows.
The installation instructions and other information is available in both the package itself and here.
libHIK v 1.0 was published July 30 2009, updated to v 1.5 on August 10, 2009,  to version 2.0 on June 17, 2010, to version 2.01 on July 30, 2010, to version 2.05 on Sept. 267, 2010.
Please check the ChangLog file for changes in editions.

---

If you use libHIK, please cite our ECCV 2010 or ICCV 2009 paper shown above. Bibtex entry of our papers are:
@InProceedings{ Wu_2010,
title = "A Fast Dual Method for HIK SVM Learning",
booktitle = "European Conference on Computer Vision (ECCV)",
author = "Jianxin Wu",
year = "2010"
}
@InProceedings{ Wu_Rehg_2009,
title = "Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel",
booktitle = “IEEE International Conference on Computer Vision (ICCV)”,
author = "Jianxin Wu and James M. Rehg",
year = "2009"
}
Contact: Jianxin Wu (wujx2001 AT gmail.com)

 

 

快速Adaboost算法

Fast and Robust Face / Rare Event Detection