A de-interlacing algorithm using Markov random field model.
In this paper, a motion-compensated de-interlacing algorithm using the Markov random field (MRF) model is proposed. The de-interlacing problem is formulated as a maximum a posteriori (MAP) MRF problem. The MAP solution is the one that minimizes an energy function, which imposes discontinuity-adaptive smoothness (DAS) spatial constraint on the de-interlaced frame. The edge direction information, which is used to formulate the DAS constraint, is implicitly indicated by weight vectors (weights for 16 digitized directions). Generally, large weights are assigned to along-edge directions and relatively small weights are assigned to across-edge directions. As a local statistical-based method, the proposed weighting method should be more robust than traditional edge-directed interpolation methods in deciding local edge directions. The proposed algorithm is implemented by an iterative optimization process, which guarantees convergence. However, a global optimal solution is not guaranteed due to computational complexity concern. Simulation results compare the proposed algorithm to other motion compensated de-interlacing algorithms. Significant improvements of de-interlaced edges are observed.
Li
Min
M
Video Signal Processing Laboratory, Electrical and Computer Engineering Department, University of California San Diego, La Jolla, CA 92093-0407, USA.
Nguyen
Truong
T
D000465:Algorithms; D016477:Artifacts; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D008390:Markov Chains; D015233:Models, Statistical; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D014741:Video Recording / Q000379:methods*