Fast fractal compression of greyscale images

被引：29

作者：

Cardinal, J ^{[1
]}

机构：

[1] Free Univ Brussels, Dept Comp Sci, B-1050 Brussels, Belgium

来源：

IEEE TRANSACTIONS ON IMAGE PROCESSING | 2001年 / 10卷 / 01期

基金：

匈牙利科学研究基金会;

关键词：

fractal compression; image coding; tree searching;

D O I：

10.1109/83.892452

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A new algorithm for fractal compression of greyscale images is presented, It uses some previous results allowing the compression process to he reduced to a nearest neighbors problem, and is essentially based on a geometrical partition of the image block feature space, Experimental comparisons with previously published methods show a significant improvement in speed with no quality loss.

引用

页码：159 / 164

页数：6

共 10 条

[1]

[Anonymous], 1997, FRACTAL IMAGING

[2]

BENTLEY JL, 1977, ACM T MATH SOFTWARE, V3, P209

[3]

Fisher Y, 1994, FRACTAL IMAGE COMPRE

[4]

Jacquin A., 1989, THESIS GEORGIA I TEC

[5] Fast tree-structured nearest neighbor encoding for vector quantization [J].

Katsavounidis, I ;

Kuo, CCJ ;

Zhang, Z .

IEEE TRANSACTIONS ON IMAGE PROCESSING, 1996, 5 (02) :398-404

[6]

KOMINEK J, 1995, P IS T SPIE, V2419

[7]

PARTRIDGE M, 1998, INTELL DATA ANAL, V2

[8]

SAUPE D, 1995, P DCC 95 MAR

[9] REFINEMENTS TO NEAREST-NEIGHBOR SEARCHING IN K-DIMENSIONAL TREES [J].

SPROULL, RF .

ALGORITHMICA, 1991, 6 (04) :579-589

[10] FAST IMAGE DOMAIN FRACTAL COMPRESSION BY DCT DOMAIN BLOCK MATCHING [J].

WOHLBERG, BE ;

DEJAGER, G .

ELECTRONICS LETTERS, 1995, 31 (11) :869-870

← 1 →