.png){kind=icon}
.png){kind=icon}
Return
An MRF-Based DeInterlacing Algorithm With Exemplar-Based Refinement
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2009.2012906.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose an MRF-based deinterlacing algorithm that combines the benefits of rule-based algorithms such as motion-adaptation, edge-directed interpolation, and motion compensation, with those of an MRF formulation. MRF-based interpolation and enhancement algorithms are typically formulated as an optimization over pixel intensities or colors, which can make them relatively slow. In comparison, our MRF-based deinterlacing algorithm uses interpolation functions as labels. We use seven interpolants (three spatial, three temporal, and one for motion compensation). The core dynamic programming algorithm is, therefore, sped up greatly over the direct use of intensity as labels. We also show how an exemplar-based learning algorithm can be used to refine the output of our MRF-based algorithm. The training set can be augmented with exemplars from static regions of the same video, as a form of self-learning.
Keywords:
Exemplar-based learning
Markov-random fields (MRF)
mosaicing
self-learning
super-resolution
TEC-ISR interpolation
video deinterlacing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W