Solving the multiple instance problem with axis-parallel rectangles
Artificial Intelligence
A framework for multiple-instance learning
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Video Google: A Text Retrieval Approach to Object Matching in Videos
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Histograms of Oriented Gradients for Human Detection
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
A Comparison of Affine Region Detectors
International Journal of Computer Vision
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Communications of the ACM - 50th anniversary issue: 1958 - 2008
SURF: speeded up robust features
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Video reference: question answering on YouTube
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Video reference: a video question answering engine
MMM'10 Proceedings of the 16th international conference on Advances in Multimedia Modeling
Hi-index | 0.00 |
Vocabulary tree-based method is one of the most popular methods for content-based image retrieval due to its efficiency and effectiveness However, for existing vocabulary tree methods, the retrieval precision in large scale image database has never been acceptable especially for image datasets with high variations In this paper, we propose a novel tree fusion framework: Feature Forest, utilizing and fusing different kind of local visual descriptors to achieve a better retrieval performance In the offline-learning stage, our framework first establishes different feature vocabulary trees based on different features and uses the average covariance to build vocabulary tree adaptively In the online-query stage, we use the ratio of the resulting score to the standard score to fuse retrieval results of each vocabulary tree adaptively The evaluations show the effectiveness of our approach compared with single vocabulary-tree based methods on different databases.