Content based image retrieval using motif cooccurrence matrix

被引:198
作者
Jhanwar, N [1 ]
Chaudhuri, S
Seetharaman, G
Zavidovique, B
机构
[1] Natl Univ Singapore, Sch Comp, Singapore, Singapore
[2] Indian Inst Technol, Dept Elect Engn, Bombay 400076, Maharashtra, India
[3] Univ Louisiana, Ctr Adv Comp Studies, Lafayette, LA 70504 USA
[4] Univ Paris 11, Inst Elect Fondamentale, F-91405 Orsay, France
关键词
content-based retrieval; peano scan; optimal scan; cooccurrence matrix; image query; scan motif;
D O I
10.1016/j.imavis.2004.03.026
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new technique for content based image retrieval using motif cooccurrence matrix (MCM). The MCM is derived from the motif transformed image. The whole image is divided into 2 X 2 pixel grids. Each grid is replaced by a scan motif that minimizes the local gradient while traversing the 2 X 2 grid forming a motif transformed image. The MCM is then defined as a 3D matrix whose (i,j,k) entry denotes the probability of finding a motif i at a distance k from the motif j in the transformed image. Conceptually, the MCM is quite similar to the color cooccurrence matrix (CCM), however, the retrieval using the MCM is better than the CCM since it captures the third order image statistics in the local neighborhood. Experiments confirm that the use of MCM considerably improves the retrieval performance. (C) 2004 Published by Elsevier B.V.
引用
收藏
页码:1211 / 1220
页数:10
相关论文
共 53 条
[1]  
Aggarwal G, 2000, PROC CVPR IEEE, P255, DOI 10.1109/CVPR.2000.854802
[2]  
AKSHOY S, 1999, P IEEE C CVPR FORT C
[3]  
[Anonymous], 1890, MATH ANN
[4]   SPACE-FILLING CURVES - THEIR GENERATION AND THEIR APPLICATION TO BANDWIDTH REDUCTION [J].
BIALLY, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (06) :658-+
[5]   SPACE FILLING CURVES AND MATHEMATICAL PROGRAMMING [J].
BUTZ, AR .
INFORMATION AND CONTROL, 1968, 12 (04) :314-&
[6]   QUERY-BY-PICTORIAL-EXAMPLE [J].
CHANG, NS ;
FU, KS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1980, 6 (06) :519-524
[7]  
CHANG P, 1997, P IEEE INT C CVPR FO, P498
[8]  
CHUA TS, 1998, P IEEE CVPR SANT BAR, P145
[9]  
Cula OG, 2001, PROC CVPR IEEE, P1041
[10]  
DAFNER R, 2000, EUROGRAPH ICS J, V19