The data structure in JPEG2000 compressed domain is firstly analyzed. The concept of information tree and a novel tree-distance measurement are then proposed. Finally, a new image retrieval method in JPEG2000 compressed domain is proposed. Experimental results show its potential in the research of compressed domain image retrieval techniques.
Gudivada V N, Raghavan V V. Content based image retrieval systems. Computer, 1995, 28(9): 18 - 22.[2]Chang Ruey-Feng, Kuo Wen-Jia,Tsai Hung-Chi. Image retrieval on uncompressed and compressed domain. Image Processing,IEEE International Conference on Image Processing, 2000,Vol.2:546 - 549.[3]Lakhani G. Modified JPEG Huffman coding[J].IEEE Trans. on Image Processing.2003, 12(2):159-[4]Ebrahimi T, Grosbois R. Secure JPEG 2000-JPSEC[J].2003 IEEE International Conference on ICASSP03, U.S.A.2003, Vol.4:716-[5]Lian Chung-Jr, Chen Kuan-Fu, Chen Hong-Hui, Chen Liang-Gee. Analysis and architecture design of block-coding engine for EBCOT in JPEG 2000[J].IEEE Trans. on Circuits Systems for Video Tech.2003, 13(3):219-[6]Taubman D. High performance scalable image compression with EBCOT. IEEE Trans. on IP, 2000, 9(7): 1158 - 1170.[7]Yu H H. Visual image retrieval on compressed domain with Q-distance. Proc. Computational Intelligence and Multimedia Applications. ICCIMA 99. U.S.A, 1999:285 - 289.