为了实现对高精度图像进行高效压缩,同时确保重建图像的弱目标区域有较好的保真效果,提出了一种提升弱目标区域质量的基于误差优化编码的高精度图像压缩算法.首先,使用JPEG-LS(joint photographic experts group lossless)压缩算法对图...为了实现对高精度图像进行高效压缩,同时确保重建图像的弱目标区域有较好的保真效果,提出了一种提升弱目标区域质量的基于误差优化编码的高精度图像压缩算法.首先,使用JPEG-LS(joint photographic experts group lossless)压缩算法对图像数据进行压缩,在游程编码过程中自适应地选择需要二次编码的误差数据,并完成了基于视觉质量的非均匀量化;其次,对量化值进行数据分解,去除量化值之间的相关性,并对分解后的数据进行MQ算术编码的熵编码;图像重建时根据量化间隔重建反量化值,并设计了反量化优化和滤波优化过程;最后,将本文算法与JPEG-LS、JPEG2000(joint photographic experts group 2000)算法进行了性能比较,结果表明:本算法能够实现高精度图像数据的高效压缩,且复杂度低,易于硬件实现,虽然引入了误差数据二次优化编码等过程,但增加编码的数据量较小,故与JPEG-LS算法的压缩速度相当,然而比JPEG2000算法的压缩速度提升4.47倍;同时有效减少了常规算法造成的信息损失,重建图像的峰值信噪比与JPEG-LS、JPEG2000相当或略低,但弱目标区域的视觉质量及保真效果更好.展开更多
It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its des...It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.展开更多
文摘为了实现对高精度图像进行高效压缩,同时确保重建图像的弱目标区域有较好的保真效果,提出了一种提升弱目标区域质量的基于误差优化编码的高精度图像压缩算法.首先,使用JPEG-LS(joint photographic experts group lossless)压缩算法对图像数据进行压缩,在游程编码过程中自适应地选择需要二次编码的误差数据,并完成了基于视觉质量的非均匀量化;其次,对量化值进行数据分解,去除量化值之间的相关性,并对分解后的数据进行MQ算术编码的熵编码;图像重建时根据量化间隔重建反量化值,并设计了反量化优化和滤波优化过程;最后,将本文算法与JPEG-LS、JPEG2000(joint photographic experts group 2000)算法进行了性能比较,结果表明:本算法能够实现高精度图像数据的高效压缩,且复杂度低,易于硬件实现,虽然引入了误差数据二次优化编码等过程,但增加编码的数据量较小,故与JPEG-LS算法的压缩速度相当,然而比JPEG2000算法的压缩速度提升4.47倍;同时有效减少了常规算法造成的信息损失,重建图像的峰值信噪比与JPEG-LS、JPEG2000相当或略低,但弱目标区域的视觉质量及保真效果更好.
基金Supported by the National Natural Science Foundation of China (No.60403004)the Outstanding Youth Foundation of China (No.0612000500)
文摘It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.
基金The project supported by National Natural Science Foundation of China under Grant No. 60472018, and the Foundation of National Laboratory for Modern Communications