Arbitrary shaped ROI image coding using Run-length coding and generalized Exp-Golomb coding

XU Yong; XU Zhi-yong; ZHANG Qi-heng

doi:10.3788/OPE.20111901.0175

您当前的位置：

首页 >

文章列表页 >

Arbitrary shaped ROI image coding using Run-length coding and generalized Exp-Golomb coding

Article | 更新时间：2020-08-12

- Arbitrary shaped ROI image coding using Run-length coding and generalized Exp-Golomb coding
- Optics and Precision Engineering Vol. 19, Issue 1, Pages: 175-182(2011)
- 作者机构：
  
  1. 中国科学院研究生院北京,100039
  2. 中国科学院光电技术研究所,四川成都,610209
- 作者简介：
- 基金信息：
- DOI：10.3788/OPE.20111901.0175
  CLC： TN919.81
- Received：06 April 2010，
  
  Revised：30 June 2010，
  
  Published Online：22 January 2011，
  
  Published：22 January 2011
- 稿件说明：
移动端阅览
徐勇, 徐智勇, 张启衡. 基于游程和扩展指数哥伦布编码的任意形状感兴趣区域图像编码[J]. 光学精密工程, 2010,19(1): 175-182

XU Yong, XU Zhi-yong, ZHANG Qi-heng. Arbitrary shaped ROI image coding using Run-length coding and generalized Exp-Golomb coding[J]. Editorial Office of Optics and Precision Engineering, 2010,19(1): 175-182
徐勇, 徐智勇, 张启衡. 基于游程和扩展指数哥伦布编码的任意形状感兴趣区域图像编码[J]. 光学精密工程, 2010,19(1): 175-182 DOI： 10.3788/OPE.20111901.0175.

XU Yong, XU Zhi-yong, ZHANG Qi-heng. Arbitrary shaped ROI image coding using Run-length coding and generalized Exp-Golomb coding[J]. Editorial Office of Optics and Precision Engineering, 2010,19(1): 175-182 DOI： 10.3788/OPE.20111901.0175.

摘要

给出一种上下文自适应的游程编码和扩展指数哥伦布编码。利用游程编码算法对图像小波系数及ROI掩模进行上下文自适应建模并输出三元组样本;然后扩展普通的指数哥伦布编码

使其可以编码由游程编码建模输出的三元组样本

在对小波系数编码的同时可以携带感兴趣区域掩模标记信息。由此得到一种可以区别感兴趣区域和背景区域的高效编码算法

并以此算法为基础提出一种感兴趣区域编码的编解码框架

该框架包括5/3小波变换、小波域掩模标记生成、不均匀最佳量化、游程编码和扩展的指数哥伦布编码。该算法的游程建模过程简单

熵编码算法可用闭合公式表达

具有较高的可实现性。实验结果表明

提出的算法支持多个任意形状的感兴趣区域

感兴趣区域相对于背景区域的编码优先级可调

并且可以获得高于基于BbB-shift的SPIHT算法的压缩性能。

Abstract

A context adaptive tri-element Run length coding algorithm and an Exp-Golomb coding alogorithm were introduced.The Run-length coding was used to model the image wavelet coefficients and the Region of Interest(ROI) mask and to yield tri-element codes.Then

the conventional Exp-Golomb coding was expanded to encode tri-element codes from Run-length coding and to carry the ROI mask together. Based on the two algorithms above

a high efficient algorithm to distinguish the ROI and background was obtained and a ROI codec framework was proposed. The framework includes 5/3 wavelet transform

wavelet domain mask generation

non-uniform optimal quantization

context adaptive tri-element Run-length coding and generalized Exp-Golomb coding. The tri-element Run-length coding in this algorithm is brief

and the expanded Exp-Golomb coding can be expressed by a closed formula. Experimental results show that the algorithm supports multiple arbitrary-shaped ROI and the adjustability of the ROI is prior to that of the background region. Furthermore

it achieves higher compressing performance as compared with the BbB-shift based SPIHT compression algorithm.

关键词

Keywords

references

KUMARAYAPA A, ZHANG Y. More efficient ground truth ROI image coding technique: implementation and wavelet based application analysis [J]. Zhejiang Univ Sci A, 2007,8(6):835-840.[2] 郝红卫,蒋蓉蓉,石雅姗. 一种圆形感兴趣区域图像压缩算法[J]. 自动化学报,2008,34(5):601-604. HAO H W, JIANG R R, SHI Y SH. An image compression algorithm for circle shaped ROI [J]. ACTA Aautomatica Sinic., 2008,34(5):601-604.[3] DAVID S T, MICHEAL W M. JPEG2000 Image Compression Fundamentals, Standards and Practice [M]. Kluwer Academic Publishers, 2001.[4] WANG Z, BOVIK A C. Bitplane-by-bitplane shift (BbBShift)-a suggestion for JPEG2000 region of interest image coding [J]. IEEE Signal Processing Letters,2002,9(5):160-162.[5] 张立保, 王珂, 李光鑫. 基于部分位平面交替偏移的感兴趣区图像编码 [J]. 光电子激光,2006,17(3):356-367. ZHANG L B, WANG K, LI G X. Region of interest image coding based on partial bit-planes alternating shift[J]. Journal of Optoelectronics Laser,2006,17(3):356-367.[6] SAID A,PEARLMAN W. A new, fast and efficient image codec based on set partitioning in hierarchical trees [J]. IEEE Trans. Circuits Systems Video Techno. ,1996,6(3):243-250.[7] 徐勇,徐智勇,张启衡,等. 适于硬件实现的低复杂度图像压缩[J]. 光学精密工程, 2009,17(9):2262-2268. XU Y, XU ZH Y, ZHANG Q H. A low complexity image compression scheme for hardware implementation[J].Opt. Precision Eng., 2009,17(9):2262-2268.(in Chinese)[8] COHEN A,DAUBECHIES I,FEAUVEAU J C. Biorthogonal bases of compactly supported wavelets [J]. Communications on Pure and Appl.Math,1992,45(5):485-560.[9] TAN K C B, ARSLAN. Low power embedded extension algorithm for lifting-based discrete wavelet transform in JPEG2000 [J]. C. Electronics letters, 2001, 37(25): 1328-1330.[10] WOODS J W,NAVEEN T. A filter based bit allocation scheme for subband compression of HDTV[J].IEEE Trans. Image Process,1992,1:436-440.[11] TEUHOLA J. A compression method for clustered bit-vectors [J]. Information Processing Letters,1978,7:308-311.[12] IAIN E G, RICHARDSON H.264 and MPEG-4 Video Compression: Video Coding for Next-generation Multimedia [M]. John Wiley & Sons, Ltd., 2003.[13] 吴乐南. 数据压缩[M]. 2版.北京:电子工业出版社,2005. WU L N. Data Compression[M]. 2nd ed.Beijing: Publishing House of Electronics Industry, 2005.(in Chinese)

Views

507

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Fast test and recognition of object characters based on multilevel orientation run length coding

Computer Real time Simulation of Improved Image Coding of AC Prediction

Related Author

WANG Huan-huan

BIAN Yue-xin

WANG Xiang-jun

HE Bin

HAO Zhi-Hang

Related Institution

College of Mechanical Engineering, Tianjin University of Science and Technology

Key Laboratory of MOEMS of the Ministry of Education, Tianjin University

Changchun Institute of Optics and Fine Mechanics, Chinese Academy of Sciences

AI问答

Address：No.3888 Dong Nanhu Road, Changchun, Jilin, China Postal code：130033
Tel：0431-86176855 Email：gxjmgc@ciomp.ac.cn
Technical support is provided by Beijing Founder electronics co., LTD 吉ICP备11002662号-17 京公网安备11010802024621
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰