Abstract

In this paper, we define a similarity measure between images in the context of (indexing and) retrieval. We use the Kullback-Leibler (KL) divergence to compare sparse multiscale image representations. The KL divergence between parameterized marginal distributions of wavelet coefficients has already been used as a similarity measure between images. Here we use the Laplacian pyramid and consider the dependencies between coefficients by means of nonparametric distributions of mixed intra/interscale and interchannel patches. To cope with the high-dimensionality of the resulting description space, we estimate the KL divergences in the k-th nearest neighbor (kNN) framework (instead of classical fixed size kernel methods). Query-by-example experiments show the accuracy and robustness of the method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.