二值图像矩形划分优化编码研究  

Binary Image Optimized Coding Based on Rectangular Partitioning

作　　者：张登福[1] 杨新慧[1] 蒋大宗[1] 林刚[1] 

机构地区：[1]西安交通大学生物医学工程研究所,西安710049

出　　处：《计算机辅助设计与图形学学报》2001年第8期742-746,共5页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金重点项目 (3 963 0 110 )资助

摘　　要：针对二值图像矩形划分编码在表示矩形顶点时存在的冗余位 ,提出了两种优化编码方法 .一种是缩减信源的自适应算术编码 ,通过增加运算复杂度提高编码效率 ;另一种是列等分相邻位置关联编码 (CA- APRE) ,CA - APRE充分利用了图像的行列先验结构信息 ,可减小复杂二值图像的码长 15 %— 30 %以上 ,且编解码运算量与原方法相同 .CA- RPRE在运算复杂度和编码效率方面明显优于自适应算术编码 .Two optimized coding methods are presented to reduce the code length of binary image rectangular partitioning compression, where redundant bits appear in representing the position of rectangular vertices. One approach applies adaptive arithmetic coding with a compressed symbol set, which improves encoding efficiency at a cost of more complex computation. The second is Column Averaged-Adjacent Position Relevancy Encoding(CA-APRE), which reduces code length more than 15%—30% to adequately utilize the transcendental structure information of row and column in a binary image, and keeps encoding and decoding computation the same as before. CA-APRE is apparently better than adaptive arithmetic coding in both computation complexity and encoding efficiency.

关 键 词：位置关联编码 二值图像压缩 矩形划分 优化 自适应算术编码 图象处理 

分 类 号：TN919.81[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]