首页 | 本学科首页   官方微博 | 高级检索  
     

图象块编码—分类的方法
引用本文:黄继武,戴汝为. 图象块编码—分类的方法[J]. 中国图象图形学报, 1997, 2(12): 890-894
作者姓名:黄继武  戴汝为
作者单位:汕头大学电子工程系AI&PR研究所
基金项目:国家攀登计划“认知科学中若干重大前沿问题的研究”课题
摘    要:提出了一个基于DCT和二维多项式近似的块分类编码算法。在该算法中,原始图象被分割成互不覆盖的8×8子块。通过依次地利用灰度局部方差、二维多项式近似误差和图象信号的空间频率分布,把图象块分为均匀、平滑、粗糙和细节4类。均匀块和平滑块分别采用零阶和一阶多项式近似。粗糙和细节块先进行DCT变换,然后对其DCT系数量化后采用改进的游程编码表示。实验结果表明该算法具有良好的性能。在未采用熵编码为编码码流作后处理的情况下,性能仍优于JPEG标准。

关 键 词:块分类编码 DCT 多项式近似 图象块编码

A Method of Image Classified Block Coding
Huang Jiwu and Dai Ruwei. A Method of Image Classified Block Coding[J]. Journal of Image and Graphics, 1997, 2(12): 890-894
Authors:Huang Jiwu and Dai Ruwei
Abstract:Classified Block Coding has received more attention recently for the advantage of easy implementation. The classification and coding of blocks are the two important problems in classified block coding. In this paper, we propose a classified block coding algorithm based on DCT coding and polynomial approximation. In the algorithm, the original image is splitted into non-overlapped 8×8 blocks. The blocks are classified into four classes: constant blocks, smooth blocks, coarse blocks and detail blocks, by using the intensity local variance, the polynomial approximation error and spatial-frequency distribution. The constant blocks and smooth blocks areapproximated by 0-order and 1-order polynomial respectively. For the coarse and detail blocks, we compute and quantize their DCT coefficients. Then encode them by means of an improved run-length coding. The experiment results show that the proposed algorithm, without using entropy coder as postprocessor of the codes, has better performance than JPEG.
Keywords:Classified block coding   DCT   Polynomial approximation   Local variance  
本文献已被 CNKI 等数据库收录!
点击此处可从《中国图象图形学报》浏览原始摘要信息
点击此处可从《中国图象图形学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号