检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学技术大学计算机系
出 处:《中国图象图形学报(A辑)》2002年第1期44-49,共6页Journal of Image and Graphics
摘 要:在图象的压缩编码中 ,矢量量化可以利用某特定类图象 (如人脸 )的统计特性 .为了在高压缩比下获得较好的压缩效果 ,提出了一种新的在小波变换域内进行矢量量化的算法 .该算法用树结构表示小波变换域系数 ,并根据各节点值的重要程度 ,从每一棵树中提取一个矢量 ,然后进行矢量量化 ;解码时 ,为了使矢量分量能正确地返回到原来树中的正确位置 ,需利用 EZW[1 ]、SPIHT[2 ]算法的思想标记这棵树 ,因为这样才能充分利用父子相关性和兄弟相关性 ,从而显著地减少了标记信息 .在提取矢量时 ,可用简单的阈值剪枝算法 ,也可用 SFQ[3]的最佳剪枝算法 ,而且后者能进一步提高峰值信噪比 .用该算法对人脸图象进行的压缩试验结果表明 ,在高压缩比 (10 0∶ 1左右 )下 ,恢复的图象质量 (视觉效果和峰值信噪比 )比通常的小波压缩算法 (如 EZW、SPIHT、SFQ等 )好得多 .In the compression of some particular kinds of image sources, such as human face, vector quantization should naturally be considered to exploit its statistical properties. In this paper, a new vector quantization method in the wavelet transform domain is proposed. We use tree structure to organize coefficients. In each tree, nodes are pruned or retained according to their importance. The survived nodes are serialized to be a vector, which will be the input of vector quantization; a map indicating the positions of these nodes is also stored, which is to be used in decoding. It embeds together the principles of EZW and SPIHT, exploiting fully both the parent children dependencies and brother dependencies. In our algorithm's framework, SFQ's tree pruning algorithm can also be embedded to increase the PSNR of reconstructed images, though we simply choose the threshold pruning method to reduce complexity of algorithm. Using the proposed algorithm, the reconstructed facial image in very low bit rate(about 0 08bpp) is superior to that of EZW, SPIHT, SFQ in both perception and PSNR. The algorithm is very suitable for the compression of particular kinds of image sources.
关 键 词:小波变换 图象压缩 矢量量化 人脸图象 压缩编码 图象处理
分 类 号:TN919.81[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.104