Hierarchical Geometry Verification via Maximum Entropy Saliency in image retrieval

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We propose a new geometric verification method in image retrieval-Hierarchical Geometry Verification via Maximum Entropy Saliency (HGV)-which aims at filtering the redundant matches and remaining the information of retrieval target in images which is partly out of the salient regions with hierarchical saliency and also fully exploring the geometric context of all visual words in images. First of all, we obtain hierarchical salient regions of a query image based on the maximum entropy principle and label visual features with salient tags. The tags added to the feature descriptors are used to compute the saliency matching score, and the scores are regarded as the weight information in the geometry verification step. Second we define a spatial pattern as a triangle composed of three matched features and evaluate the similarity between every two spatial patterns. Finally, we sum all spatial matching scores with weights to generate the final ranking list. Experiment results prove that Hierarchical Geometry Verification based on Maximum Entropy Saliency can not only improve retrieval accuracy, but also reduce the time consumption of the full retrieval.

Cite

CITATION STYLE

APA

Zhao, H., Li, Q., & Liu, P. (2014). Hierarchical Geometry Verification via Maximum Entropy Saliency in image retrieval. Entropy, 16(7), 3848–3865. https://doi.org/10.3390/e16073848

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free