DP-PMK: an improved pyramid matching kernel for approximating correspondences in high dimensions
As the feature dimension increases, the original pyramid matching kernel suffers from distortion factors that increase linearly with the feature dimension. This paper proposes a new method by consistently dividing the feature space into two subspaces while generating several levels. In each subspace of the level, the original pyramid matching is used. Then, a weighted sum of every subspace at each level is made as the final measurement of similarity. Experiments on data set Caltech-101 and ETH-80 show that compared with other related algorithms which need hundreds of times of original computation time, dimension partition pyramid matching kernel only needs about 46 times less of original computation time to obtain the similar accuracy.
pyramid matching dimension partition bags of features svm kernel function object recognition