Multisymbol data compression using a binary arithmetic coder

2002 ◽  
Vol 38 (3) ◽  
pp. 124 ◽  
Author(s):  
Chul Soo Lee ◽  
Hyun Wook Park
Keyword(s):  
Data Compression ◽  
Binary Arithmetic ◽  
Arithmetic Coder

An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder

1988 ◽  
Vol 32 (6) ◽  
pp. 717-726 ◽  
Author(s):  
W. B. Pennebaker ◽  
J. L. Mitchell ◽  
G. G. Langdon ◽  
R. B. Arps
Keyword(s):  
Basic Principles ◽  
Binary Arithmetic ◽  
Arithmetic Coder

scholarly journals Adaptive Binary Arithmetic Coder-Based Image Feature and Segmentation in the Compressed Domain

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Hsi-Chin Hsin ◽  
Tze-Yun Sung ◽  
Yaw-Shih Shieh ◽  
Carlo Cattani
Keyword(s):  
Computational Cost ◽  
Rate Distortion ◽  
Image Feature ◽  
Compressed Domain ◽  
Boundary Displacement ◽  
Binary Arithmetic ◽  
Efficient Scheme ◽  
Band Limited ◽  
Arithmetic Coder ◽  
Efficient Transmission

Image compression is necessary in various applications, especially for efficient transmission over a band-limited channel. It is thus desirable to be able to segment an image in the compressed domain directly such that the burden of decompressing computation can be avoided. Motivated by the adaptive binary arithmetic coder (MQ coder) of JPEG2000, we propose an efficient scheme to segment the feature vectors that are extracted from the code stream of an image. We modify the Compression-based Texture Merging (CTM) algorithm to alleviate the influence of overmerging problem by making use of the rate distortion information. Experimental results show that the MQ coder-based image segmentation is preferable in terms of the boundary displacement error (BDE) measure. It has the advantage of saving computational cost as the segmentation results even at low rates of bits per pixel (bpp) are satisfactory.

Sign in / Sign up

Export Citation Format

Share Document