A quasi-random sampling approach to image retrieval

In this paper, we present a novel approach to contentsbased image retrieval. The method hinges in the use of quasi-random sampling to retrieve those images in a database which are related to a query image provided by the user. Departing from random sampling theory, we make use of the EM algorithm so as to organize the images in the database into compact clusters that can then be used for stratified random sampling. For the purposes of retrieval, we use the similarity between the query and the clustered images to govern the sampling process within clusters. In this way, the sampling can be viewed as a stratified sampling one which is random at the cluster level and takes into account the intra-cluster structure of the dataset. This approach leads to a measure of statistical confidence that relates to the theoretical hard-limit of the retrieval performance. We show results on the Oxford Flowers dataset.

• Type: Conference
• Year: 2008
• Where: CVPR
• Authors: Jun Zhou, Antonio Robles-Kelly
• Keywords: Computer Vision, Contentsbased Image Retrieval, CVPR 2008, Quasi-random Sampling, Random Sampling Theory, Retrieval Performance, Stratified Random Sampling