FAST IMAGE DOMAIN FRACTAL COMPRESSION BY DCT DOMAIN BLOCK MATCHING

被引：24

作者：

WOHLBERG, BE

DEJAGER, G

机构：

[1] Digital Image Processing Laboratory, Electrical Engineering Department, University of Cape Town, Private Bag

来源：

ELECTRONICS LETTERS | 1995年 / 31卷 / 11期

关键词：

FRACTALS; IMAGE PROCESSING; DATA COMPRESSION; DISCRETE COSINE TRANSFORMS;

D O I：

10.1049/el:19950582

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Fractal image compression entails a computationally costly search for matching image blocks. It is proposed that a block be represented by its DCT coefficients, which may be made invariant to many of the usual block transforms. Owing to the energy packing properties of the DCT, the efficiency of an existing multidimensional nearest neighbour search is improved.

引用

页码：869 / 870

页数：2

共 9 条

[1]

BARTHEL KU, 1993, JUN P INT WORKSH IM

[2]

Fisher Y., 1992, Image and text compression, P35

[3]

FISHER Y, 1994, P SPIE 230416

[4]

Friedman J. H., 1977, ACM Transactions on Mathematical Software, V3, P209, DOI 10.1145/355744.355745

[5]

Gonzales R., 1992, DIGITAL IMAGE PROCES, P81

[6] Image coding based on a fractal theory of iterated contractive image transfort-nations [J].

Jacquin, Amaud E. .

IEEE TRANSACTIONS ON IMAGE PROCESSING, 1992, 1 (01) :18-30

[7]

Pennebaker W. B., 1993, JPEG STILL IMAGE DAT

[8]

Saupe D, 1994, BREAKING TIME COMPLE

[9] IMAGE COMPRESSION USING FRACTALS AND DISCRETE COSINE TRANSFORM [J].

ZHAO, Y ;

YUAN, B .

ELECTRONICS LETTERS, 1994, 30 (06) :474-475

← 1 →