A Novel Deinterlacing Algorithm Based on Adaptive Polynomial Interpolation

In this paper, a novel deinterlacing algorithm is proposed. The proposed algorithm approximates the distribution of the luminance into a polynomial function. Instead of using one polynomial function for all pixels, different polynomial functions are used for the uniform, texture, and directional edge regions. The function coefficients for each region are computed by matrix multiplications. Experimental results demonstrate that the proposed method performs better than the conventional algorithms.




References:
[1] T. Doyle, "Interlaced to sequential conversion for EDTV applications," in
Proc. Second Int. Workshop Signal Processing of HDTV, pp. 412-430,
Feb. 1998.
[2] M. H. Lee, J. H. Kim, J. S. Lee, K. K. Ryu, and D. I. Song, "A new
algorithm for interlaced to progressive scan conversion based on
directional correlations and its IC design," IEEE Trans. Consumer
Electnon., vol. 40, no. 2, pp. 119-129, May. 1994.
[3] M. K. Park, M. G. Kang, and S. G. Oh, "New edge dependent
deinterlacing algorithm based on horizontal edge pattern," IEEE Trans.
on Consumer Electron., vol. 49, no. 4, Nov. 2003.
[4] S.-H Hong, R.-H Park, S. Yang, and J.-Y Kim, "Edge-preserving spatial
deinterlacing for still images using block-based region classification," in
Proc. Second Int. Workshop Signal Processing of HDTV, pp. 412-430,
Feb. 2006.
[5] J. W. Suh and J. Jeong, "Fast sub-pixel motion estimation techniques
having lower computational complexity," IEEE Trans. on Consumer
Electnon., vol. 50, no. 3, pp. 968-973, Aug. 2004.
[6] M. I. Sezan and A. M. Tekalp, "Adaptive image restoration with artifact
suppression using the theory of convex projections," IEEE Trans. on
Acoustics, Speech, and Signal Processing, vol. 38, no. 1, Jan. 1990.