Relative entropy-based feature matching for image retrieval

Yuan Shao; Mehmet Celenk

doi:10.1117/12.373478

20 December 1999 Relative entropy-based feature matching for image retrieval

Yuan Shao, Mehmet Celenk

Proceedings Volume 3964, Internet Imaging; (1999) https://doi.org/10.1117/12.373478
Event: Electronic Imaging, 2000, San Jose, CA, United States

Abstract

Increased interest in content-based storage and retrieval of images and video frames has been stemmed from its potential applications in multimedia information systems. Various matching methods have been proposed in the literature, including histogram intersection, distance method, and reference table method. A comparison of these three techniques has proved that the reference table method is the best in terms of retrieval efficiency. However, the drawback of this method is that it requires a pre-defined set of reference feature which can approximately cover all features in the selected application. While this condition may be satisfied in some applications, in situations where there are continuing additions and/or deletions to the database and where knowledge of features in the images is not available a priori, such a technique will not produce very reliable results. The reference feature or color table method requires a representative sample of all images stored in the database in order to select the reference feature or color table. For example, such a priori knowledge is impossible to obtain in a trade-marks database. To based on color-clustering, which is a computationally expensive approach. In this study, we propose an image retrieval method based on the relative entropy, known as the Kullback directed divergence. This measure is non-negative and it is zero if and only if two distributions are identical; i.e., perfect match. E_rel has only one minimum for every comparison. This offers a unique criterion for optimization with low computational complexity.It also provides a thoughtful view for the type of data distribution in the sense that the whole range of data distribution is considered in matching and not only some moments.

Citation Download Citation

Yuan Shao and Mehmet Celenk "Relative entropy-based feature matching for image retrieval", Proc. SPIE 3964, Internet Imaging, (20 December 1999); https://doi.org/10.1117/12.373478

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
9 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Image retrieval

Databases

Feature extraction

Data storage

Image storage

Imaging systems

Multimedia

Show All Keywords

Keywords/Phrases

Search In:

Publication Years