Block image retrieval based on a compressed linear quadtree

被引：0

作者：

Chan, YK ^{[1
]}

Chang, CA ^{[1
]}

机构：

[1] Natl Chung Hsing Univ, Dept Management Informat Syst, Taichung 40227, Taiwan

来源：

ICICS-PCM 2003, VOLS 1-3, PROCEEDINGS | 2003年

关键词：

quadtree; linear quadtree; image compression; image retrieval;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Based on a compressed linear quad tree, a data structure is proposed which is more than a structure to compress a gray-level or color image, but a structure, which can be applied to retrieve a block image. This compressed linear quadtree may directly extract a detailed block image without decompressing the compressed data of the original image.

引用

页码：31 / 35

页数：5

共 11 条

[1]

[Anonymous], ACM COMP SURV, DOI DOI 10.1145/356924.356930

[2]

CHAN YK, 1998, P 5 INT C FDN DAT OR, P268

[3]

CHANG HKC, 1995, P 8 IPPR C COMP VIS, P122

[4] THE SPACE EFFICIENCY OF QUADTREES [J].

DYER, CR .

COMPUTER GRAPHICS AND IMAGE PROCESSING, 1982, 19 (04) :335-348

[5] AN EFFECTIVE WAY TO REPRESENT QUADTREES [J].

GARGANTINI, I .

COMMUNICATIONS OF THE ACM, 1982, 25 (12) :905-910

[6]

Lin JH, 1997, CHINESE EDUC SOC, V30, P7

[7]

LIN TW, 1997, IMAGE VISION COMPUT, V15, P883

[8]

Morton GM., 1966, COMPUTER ORIENTED GE

[9] QUADTREES - STORAGE AND SCAN CONVERSION [J].

STEWART, IP .

COMPUTER JOURNAL, 1986, 29 (01) :60-75

[10]

Vassilakopoulos M., 1995, Nordic Journal of Computing, V2, P70

← 1 2 →