pith. sign in

arxiv: 1010.1496 · v1 · pith:WIUEXULRnew · submitted 2010-10-07 · 💻 cs.CV · cs.IR· cs.MM

Profile Based Sub-Image Search in Image Databases

classification 💻 cs.CV cs.IRcs.MM
keywords searchimageimagesnaturalprofilesub-imagecodebookconventional
0
0 comments X
read the original abstract

Sub-image search with high accuracy in natural images still remains a challenging problem. This paper proposes a new feature vector called profile for a keypoint in a bag of visual words model of an image. The profile of a keypoint captures the spatial geometry of all the other keypoints in an image with respect to itself, and is very effective in discriminating true matches from false matches. Sub-image search using profiles is a single-phase process requiring no geometric validation, yields high precision on natural images, and works well on small visual codebook. The proposed search technique differs from traditional methods that first generate a set of candidates disregarding spatial information and then verify them geometrically. Conventional methods also use large codebooks. We achieve a precision of 81% on a combined data set of synthetic and real natural images using a codebook size of 500 for top-10 queries; that is 31% higher than the conventional candidate generation approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.