Adaptive quasiconformal kernel metric for image retrieval

Douglas R. Heisterkamp, Jing Peng, H. K. Dai

Research output: Contribution to journalConference articlepeer-review

34 Scopus citations


This paper presents a new approach to ranking relevant images for retrieval. Distance in the feature space associated with a kernel is used to rank relevant images. An adaptive quasiconformal mapping based on relevance feedback is used to generate successive new kernels. The effect of the quasiconformal mapping is a change in the spatial resolution of the feature space. The spatial resolution around irrelevant samples is dilated, whereas the spatial resolution around relevant samples is contracted. This new space created by the quasiconformal kernel is used to measure the distance between the query and the images in the database. An interesting interpretation of the metric is found by looking at the Taylor series approximation to the original kernel Then the squared distance in the feature space can be seen as a combination of a parzen window estimate of the squared Chi-squared distance and a weighted squared Euclidean distance. Experimental results using real-world data validate the efficacy of our method.

Original languageEnglish
Pages (from-to)II388-II393
JournalProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
StatePublished - 2001
Event2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Kauai, HI, United States
Duration: 8 Dec 200114 Dec 2001


Dive into the research topics of 'Adaptive quasiconformal kernel metric for image retrieval'. Together they form a unique fingerprint.

Cite this