Weighted Distance De-interlacing Algorithm Based on EDI and NAL 


Vol. 33,  No. 9, pp. 704-711, Sep.  2008


PDF
  Abstract

This paper proposes a new de-interlacing method which results in efficient visual improvement. In the proposed algorithm, the distance weight was considered and the previously developed the EDI (Edge Dependent Interpolation) algorithm and the NAL (New Adaptive Linear interpolation) algorithm were used as a basis. The de-interlacing method was divided into two main parts. First, the edge direction was found by using information of closer pixels. Then, missing pixels were interpolated along with the decided edge direction. In this paper, after predicting the edge through the EDI algorithm, missing pixels were interpolated by using the weighted distance based on the NAL algorithm. Experimental results indicate that the proposed algorithm be superior to the conventional algorithms in terms of the objective and subjective criteria.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Lee, S. Ku, J. Jeong, "Weighted Distance De-interlacing Algorithm Based on EDI and NAL," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 9, pp. 704-711, 2008. DOI: .

[ACM Style]

Se-young Lee, Su-il Ku, and Je-chang Jeong. 2008. Weighted Distance De-interlacing Algorithm Based on EDI and NAL. The Journal of Korean Institute of Communications and Information Sciences, 33, 9, (2008), 704-711. DOI: .

[KICS Style]

Se-young Lee, Su-il Ku, Je-chang Jeong, "Weighted Distance De-interlacing Algorithm Based on EDI and NAL," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 9, pp. 704-711, 9. 2008.