Efficient Gaussian Source Coding Based on Distribution Mapping
暂无分享,去创建一个
Gaussian sources are commonly found in the fields of mathematics and engineering.There is instantaneous code for geometric and two-sided geometric distributions; however,there is no simple,instantaneous code for normal distributions.Therefore,we have developed a method of mapping a normal distribution onto a geometric distribution before applying Golomb codes.Experimental results showed that our method consistently yielded coding efficiency of more than 98% for quantized Gaussian sources,which is comparable to the coding efficiency of second-order Huffman codes.For actual video coding residual signals,our codes were more efficient by six points than straightforward Golomb codes.Furthermore,we developed and demonstrated an accurate estimation method for determining optimal Golomb parameters,and we investigated the use of hybrid coding to enhance the coding performance.
[1] Youzhi Xu,et al. Hybrid Golomb codes for a group of quantised GG sources , 2003 .
[2] Neri Merhav,et al. Optimal prefix codes for sources with two-sided geometric distributions , 2000, IEEE Trans. Inf. Theory.
[3] Henrique S. Malvar. Adaptive run-length/Golomb-Rice encoding of quantized generalized Gaussian sources with unknown statistics , 2006, Data Compression Conference (DCC'06).
[4] Sebastiano Vigna,et al. Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups , 2005, SPIRE.