2012
DOI: 10.1109/lsp.2011.2178595
|View full text |Cite
|
Sign up to set email alerts
|

Video Super-Resolution Using Generalized Gaussian Markov Random Fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 37 publications
(18 citation statements)
references
References 14 publications
0
18
0
Order By: Relevance
“…Therefore, these small motions are first found in the smaller images and then are interpolated in the lower level (higher resolution) images of the pyramid until the original image is met. This method, known as optical flow, works quite well when motion is to be computed between objects, which are non-rigid, non-planar, non-Lambertian, and are subject to self occlusion, like human faces, [55], [57], [58], [71], [82], [99], [100], [115], [116], [128], [126], [176], [190], [270], [288], [295], [296], [299], [307], [414], [468], [478], [492], [500], [529], [534], [555], [592]. It is discussed in [592] that using optical flows of strong candidate feature points (like those obtained by Scale Invariant Feature Transform (SIFT)) for SR algorithms produces better results than dense optical flows in which the flow involves every pixel.…”
Section: Geometric Registrationmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, these small motions are first found in the smaller images and then are interpolated in the lower level (higher resolution) images of the pyramid until the original image is met. This method, known as optical flow, works quite well when motion is to be computed between objects, which are non-rigid, non-planar, non-Lambertian, and are subject to self occlusion, like human faces, [55], [57], [58], [71], [82], [99], [100], [115], [116], [128], [126], [176], [190], [270], [288], [295], [296], [299], [307], [414], [468], [478], [492], [500], [529], [534], [555], [592]. It is discussed in [592] that using optical flows of strong candidate feature points (like those obtained by Scale Invariant Feature Transform (SIFT)) for SR algorithms produces better results than dense optical flows in which the flow involves every pixel.…”
Section: Geometric Registrationmentioning
confidence: 99%
“…In [606] the TV terms are weighted with an adaptive spatial algorithm based on differences in the curvature. Table 8), which is used to approximate TV, is defined by: [123], [277], [328], [363], [365], [368], [388], [414], [500], [547], [551], [ [123], [133], [149], [253], [260], [272], [276], [282], [313], [314], [328], [375], [428], [452], [588] GMRF [123], [129], [163], [181], [209], [276], [282], [305], [496], [535], [555], [574], [575], [598] TV [73], [84], [124], [157], [245], …”
Section: Markov Random Fields (Mrf)mentioning
confidence: 99%
See 1 more Smart Citation
“…Superresolution (SR) reconstruction technology [1][2][3][4] aims to reconstruct high-resolution (HR) video sequences from their lowresolution (LR) counterparts. With rapid and significant development of computer vision, there is a growing need for HR videos.…”
Section: Introductionmentioning
confidence: 99%
“…SR techniques have been developed to solve SR problems from the frequency domain to the spatial domain. Currently relevant studies include three main categories: interpolation-based SR methods [5,6], multiframe-based SR methods [7][8][9], and learning-based SR methods [10,11]. Interpolation-based SR methods have relatively low computational cost and therefore are well suited for real-time applications.…”
Section: Introductionmentioning
confidence: 99%