An efficient multimedia image retrieval system

被引:0
作者
Celenk, M [1 ]
机构
[1] Ohio Univ, Sch Elect Engn & Comp Sci, Stocker Ctr, Athens, OH 45701 USA
来源
VISUAL INFORMATION PROCESSING VIII | 1999年 / 3716卷
关键词
multimedia imaging database; color features; principal axis; image transform; Tanimoto measure; image retrieval; histogram intersection; co-occurrence measurements; texture features;
D O I
10.1117/12.354695
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes a computationally efficient method for fast retrieval of color images of multimedia and imaging databases. Although the proposed algorithm can operate in an n-dimensional (n-D) feature space for search, in our experiments we use only one three-dimensional (3-D) vector as key for indexing and searching color pictures of the selected archives. A new feature extraction and matching technique is developed based on the first-order statistics of color image data. Eigenvalue analysis provides an effective way of reducing 3-D color data to a one-dimensional (1-D) array. This feature extraction and reduction step is performed only once when an (R,G,B) color picture is submitted for storage or query. As for similarity measure, the Tanimoto coefficient is selected to be a computationally high performance matching algorithm to evaluate the search results. It is shown in the paper that the idea of projection-based retrieval is similar to the well-known histogram intersection operation of Swain and Ballard(8). The algorithm described here has been tested on eleven different databases, each of which consists of various color images of different scenes stored in a content addressable stack. The efficacy of retrieval was determined using the percentage efficiency measure eta=p/P, where p is the number of similar pictures retrieved in a short list and P is the total number of similar pictures in an archive. The experimental results yield almost 90% average retrieval efficiency for the eleven databases searched with the 3-D index or key vector. The feature extraction and matching parts of the method are not affected by major changes in the databases since the extracted features depend on the image statistics and vary with the color data. Moreover, the similarity ratio selected here is invariant to changes in image brightness which are a scaling factor for the feature values. These properties make the algorithm robust and highly efficient for many multimedia imaging database applications (e.g., trademark registration, fingerprint analysis, face identification, etc.).
引用
收藏
页码:92 / 99
页数:8
相关论文
共 16 条
[1]  
CASTLEMAN K. R., 1996, Digital image processing
[2]  
CELENK M, 1998, P IS TS NIP, V14, P298
[3]  
CELENK M, 1999, P SOC PHOTO-OPT INS, V3656, P623
[4]  
CELENK M, 1999, P IEEE 31 SE S SYST
[5]  
FURHT B, 1996, VIDEO IMAGE PROCESSI
[6]  
GONG Y, 1994, P IEEE INT C MULT CO, P121
[7]  
Gonzalez R.C., 1992, DIGITAL IMAGE PROCES
[8]  
Haralick R. M., 1992, COMPUTER ROBOT VISIO, V1
[9]   TEXTURAL FEATURES FOR IMAGE CLASSIFICATION [J].
HARALICK, RM ;
SHANMUGAM, K ;
DINSTEIN, I .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1973, SMC3 (06) :610-621
[10]   VISUAL-PATTERN RECOGNITION BY MOMENT INVARIANTS [J].
HU, M .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (02) :179-&