%0 Conference Proceedings
%F hejf:FKLforSPM
%A He, Junfeng
%A Chang, Shih-Fu
%A Xie, Lexing
%T Fast Kernel Learning for Spatial Pyramid Matching
%B IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR)
%C Anchorage, Alaska, USA
%X Spatial pyramid matching (SPM) is a simple yet effec- tive approach to compute similarity between images. Sim- ilarity kernels at different regions and scales are usually fused by some heuristic weights. In this paper,we develop a novel and fast approach to improve SPM by finding the optimal kernel fusing weights from multiple scales, loca- tions, as well as codebooks. One unique contribution of our approach is the novel formulation of kernel matrix learn- ing problem leading to an efficient quadratic programming solution, with much lower complexity than those associated with existing solutions (e.g., semidefinite programming). We demonstrate performance gains of the proposed methods by evaluations over well-known public data sets such as natu- ral scenes and TRECVID 2007
%U http://www.ee.columbia.edu/dvmm/publications/08/FKLforSPM_cvpr08.pdf
%8 June
%D 2008