EDI-based deinterlacing using edge patterns

In this paper, a new EDI-based deinterlacing algorithm is proposed. Generally, EDI algorithms perform visually better than any other intrafield deinterlacing algorithm. However, they produce unpleasant results due to their failure in estimating edge direction. To estimate the edge direction precisel...

Full description

Saved in:
Bibliographic Details
Published inIEEE International Conference on Image Processing 2005 Vol. 2; pp. II - 1018
Main Authors Min Byun, Min Kyu Park, Moon Gi Kang
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Bandwidth
Biometrics
Difference equations
Electrical capacitance tomography
HDTV
Interpolation
Moon
Pattern analysis
Telephony
Online AccessGet full text
ISBN9780780391345
0780391349
ISSN1522-4880
DOI10.1109/ICIP.2005.1530231

Cover

More Information
Summary:In this paper, a new EDI-based deinterlacing algorithm is proposed. Generally, EDI algorithms perform visually better than any other intrafield deinterlacing algorithm. However, they produce unpleasant results due to their failure in estimating edge direction. To estimate the edge direction precisely, not only simple difference between adjacent two lines but also edge patterns are used. Here, we analyze properties of edge patterns and model them as weight functions. The weight functions help the proposed method to estimate the edge direction precisely.
ISBN:9780780391345
0780391349
ISSN:1522-4880
DOI:10.1109/ICIP.2005.1530231