低复杂度的图像信源-信道联合译码算法
Low-Complexity Joint Source Channel Decoding of Image
-
摘要: 该文提出将图像编码后残留冗余的马尔可夫场模型分解为4个方向的马尔可夫链，并结合简化的模型及低密度奇偶校验码(LDPC)译码的软输出进行信源-信道联合译码。将分解后信源中多个方向上同时存在的相关性看作一种特殊的天然信道编码方式，利用前向-后向算法、和积算法以及信道译码软输出分别对信源符号进行串行和并行的译码。仿真实验表明，与传统利用马尔可夫场模型的联合译码算法相比，该联合译码算法降低了复杂度，同时提高了重建图像的峰值信噪比。Abstract: Markov Random Field Model (MRFM) is separated into four Markov chains which are used to represent the residuals of encoded image source. Combined with the soft output of Low Density Parity Check (LDPC) code, this simplified model is used in joint source channel decoding. Different correlation in different direction in source is regarded as a kind of natural channel code. In order to utilize the correlation, a serial decoding using forward-backward algorithm and a parallel decoding using sum-product algorithm are proposed respectively. Simulations show that compared with the traditional joint source channel decoding algorithm based on the MRFM, the proposed algorithm has lower complexity and better PSNR of the rebuilt images.
-
Buch G, Burkert F, Hagenauer J, et al. To compress or not to compress? [C]. IEEE GLOBECOM 1996, London, U.K., Nov. 1996: 198 - 203.[2]Fingscheidt T, Hindelang T, Cox R V, et al.. Joint source-channel (de-)coding for mobile communications[J].IEEE Trans. on Communications.2002,50(2):200-[3]Lahouti F, Khandani A K. Efficient source decoding over memoryless noisy channels using higher order Markov models [J].IEEE Trans. on Information Theory.2004, 50(9):2103-[4]Park M, Miller D J. Improved image decoding over noisy channels using minimum mean-squared estimation and a Markov mesh [J].IEEE Trans. on Image Processing.1999, 8(6):863-[5]Othman H, Aboulnasr T. A separable low complexity 2D HMM with application to face recognition [J].IEEE Trans. on Pattern Analysis and Machine Intelligence.2003, 25(10):1229-[6]Kschischang F R, Frey B J, Loeliger H A. Factor graphs and the sum-product algorithm [J].IEEE Trans. on Information Theory.2001, 47(2):498-[7]Hagenauer J, Gortz N. The turbo principle in joint source-channel coding [C]. IEEE Information Theory Workshop 2003, Paris, France, Mar. 2003: 275-278.[8]Kschischang F R, Frey B J. Iterative decoding of compound codes by probability propagation in graphical models [J].IEEE Journal on Selected Areas in Communications.1998, 16(2):219- -
计量
- 文章访问数: 2298
- HTML全文浏览量: 125
- PDF下载量: 835
- 被引次数: 0
下载:
