.png){kind=icon}
返回
Fractal image compression based on delaunay triangulation and vector quantization
.png){kind=icon}
PRE
AI
DOI：10.1109/83.480769.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new scheme for fractal image compression based on adaptive Delaunay triangulation, Such a partition is computed on an initial set of points obtained with a split and merge algorithm in a grey level dependent way, The triangulation is thus fully flexible and returns a limited number of blocks allowing good compression ratios, Moreover, a second original approach is the integration of a classification step based on a modified version of the Lloyd algorithm (vector quantization) in order to reduce the encoding complexity, The vector quantization algorithm is implemented on pixel histograms directly generated from the triangulation. The aim is to reduce the number of comparisons between the two sets of blocks involved in fractal image compression by keeping only the best representative triangles in the domain blocks set, Quality coding results are achieved at rates between 0.25-0.5 b/pixel depending on the nature of the original image and on the number of triangles retained.
Keyword:
SEGMENTATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容