摘要
传统的分形图像压缩算法基于图像局部之间的自相似性进行编码[5]。提出一种思路新颖的分形图像压缩算法:首先利用逃逸时间算法生成4×4的JULIA集;然后采用量化规则进行图像量化,生成4×4的矩形块;最后采用HongYan和Popescu等提出的非线性分形图像压缩算法,将4×4的矩形块转换为圆盘,然后圆盘每次旋转2度,旋转90次,将每次得到的结果转换为4×4的矩形块,作为定义域块。
The traditional fractal image compression algorithm is based on self- similarity of local image. A novel algorithm is designed in this article; first, it uses escape time algorithm to create 4 × 4 JUIkA collection. Second, it uses measurement rule to measure 4 × 4 JULJA collection and the rectangle block is got. ＂Last, it uses Hong Yan and Popescu ＂A Nonlinear Model for Fractal Image Coding＂, 4 × 4 rectangle block is transformed into 8 × 8 disk, and then each time the disk is rotated by 2 degrees until 90 times, and the result is transformed into 4 × 4 rectangle block, which is regarded as range - main block.
出处
《计算机与数字工程》
2006年第5期17-20,共4页
Computer & Digital Engineering
基金
沈阳科技局项目(项目编号:1022038-1-04)资助
关键词
JULIA集
分形
保角映射
圆盘
逃逸时间
JULIA collection, fractal, conservation mapping, plane, escaped time
