A practical algorithm for tanner graph based image interpolation

This paper interprets image interpolation as a decoding problem on tanner graph and proposes a practical belief propagation algorithm based on a gaussian autoregressive image model. This algorithm regards belief propagation as a way to generate and fuse predictions from various check nodes. A low complexity implementation of this algorithm measures and distributes the departure of current interpolation result from the image model. Convergence speed of the proposed algorithm is discussed. Experimental results show that good interpolation results can be obtained by a very small number of iterations.

[1]  H.-A. Loeliger,et al.  An introduction to factor graphs , 2004, IEEE Signal Process. Mag..

[2]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[3]  Xiangjun Zhang,et al.  Image Interpolation by Adaptive 2-D Autoregressive Modeling and Soft-Decision Estimation , 2008, IEEE Transactions on Image Processing.

[4]  Dimitris Anastassiou,et al.  Subpixel edge localization and the interpolation of still images , 1995, IEEE Trans. Image Process..

[5]  Ping Wah Wong,et al.  Edge-directed interpolation , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[6]  Bryan S. Morse,et al.  Isophote-based interpolation , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[7]  Wen Gao,et al.  Tanner Graph Based Image Interpolation , 2010, 2010 Data Compression Conference.