.png){kind=icon}
.png){kind=icon}
Return
Segmentation of Source Symbols for Adaptive Arithmetic Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/TBC.2012.2186728.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Adaptive arithmetic coding is a general technique for coding source symbols of a stochastic process based on an adaptive model. The adaptive model provides measures of the statistics of source symbols and is updated, along with encoding/decoding processes, when more encoded/decoded symbols are fed as samples to the adaptive model. The coding performance depends on how well the adaptive model fits the statistics of source symbols. If the number of source symbols is large and the number of samples is small, the adaptive model may not be able to provide valid measures of the statistics, which results in an inefficient coding performance of the adaptive arithmetic coder. To this end, this paper presents segmentation of source symbols to improve the performance of the adaptive arithmetic coder. Each source symbol is divided into several segments. Each segment is separately coded with an adaptive arithmetic coder. With this division, possible values of each segment are concentrated within a small range. Given the limited number of samples, this concentration leads to a better fit of the adaptive model to the statistics of source symbols and therefore to an improvement of the coding efficiency. The proposed coding algorithm is applied to lossless motion vector coding for video transmission as an application example to show its performance improvement and coding gains.
Keywords:
Adaptive coding
predictive coding
signal representations
vector quantization
video coding
video compression
Journal
IF:
4.8
Papers:
2.1K
Citations:
3.0K