Junfeng He, Shih-Fu Chang, Lexing Xie. Fast Kernel Learning for Spatial Pyramid Matching. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), Anchorage, Alaska, USA, June 2008.
Download paper:
Adobe portable document (pdf) 
Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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
Junfeng He 
Shih-Fu Chang
Lexing Xie
@InProceedings{hejf:FKLforSPM,
Author = {He, Junfeng and Chang, Shih-Fu and Xie, Lexing},
Title = {Fast Kernel Learning for Spatial Pyramid Matching},
BookTitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR)},
Address = {Anchorage, Alaska, USA},
Month = {June},
Year = {2008}
}
Get EndNote Reference (.ref)
For problems or questions regarding this web site contact The
Web Master.
This document was translated automatically from BibTEX by bib2html (Copyright 2003 © Eric Marchand, INRIA, Vista Project).