A Binning Scheme for Fast Hard Drive Based Image Search

In this paper we investigate how to scale a content based image retrieval approach beyond the RAM limits of a single computer and to make use of its hard drive to store the feature database. The feature vectors describing the images in the database are binned in multiple independent ways. Each bin contains images similar to a representative prototype. Each binning is considered through two stages of processing. First, the prototype closest to the query is found. Second, the bin corresponding to the closest prototype is fetched from disk and searched completely. The query process is repeatedly performing these two stages, each time with a binning independent of the previous ones. The scheme cuts down the hard drive access significantly and results in a major speed up. An experimental comparison between the binning scheme and a raw search shows competitive retrieval quality.

• Type: Conference
• Year: 2007
• Where: CVPR
• Authors: David Nistér, Friedrich Fraundorfer, Henrik Stewénius
• Keywords: Bin Contains Images, Closest Prototype, Competitive Retrieval Quality, Computer Vision, CVPR 2007, Hard Drive Access, Prototype Closest