Moving least-squares method for interlaced to progressive scanning format conversion

Jin Wang, Gwanggil Jeon, Jechang Jeong

Research output: Contribution to journalArticle

2 Scopus citations


In this paper, we introduce an efficient intra-field deinterlacing algorithm based on moving least squares (MLS). The MLS algorithm has proven successful for approximating scattered data by minimizing a weighted mean-square error norm. In order to estimate the value of the missing point using the given data, we utilize MLS to generate a generic local approximation function about this point. In the MLS method, we adopt trigonometric functions to approximate the local function. This method is compared to other benchmark algorithms in terms of peak signal-to-noise ratio and structural similarity objective quality measures and deinterlacing speed. It was found to provide excellent performance and the best quality-speed tradeoff among the methods studied.

Original languageEnglish
Article number6469202
Pages (from-to)1865-1872
Number of pages8
JournalIEEE Transactions on Circuits and Systems for Video Technology
Issue number11
Publication statusPublished - 2013 Nov 20



  • Deinterlacing
  • moving least squares (MLS)
  • trigonometric functions

Cite this