2012 IEEE International Conference on Multimedia and Expo 2012
DOI: 10.1109/icme.2012.102
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Single Image Super-Resolution via Graph Embedding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…Our another important goal is to encode the geometry of the HR patch manifold, which is much more credible and discriminated compared with that of the LR one [9], and preserve the geometry for the reconstructed HR patch space [12]. This will ensure that the local geometric structure of the reconstructed HR patch manifold is consistent with that of the original HR one.…”
Section: Lr-hr Pairwise Dictionarymentioning
confidence: 97%
“…Our another important goal is to encode the geometry of the HR patch manifold, which is much more credible and discriminated compared with that of the LR one [9], and preserve the geometry for the reconstructed HR patch space [12]. This will ensure that the local geometric structure of the reconstructed HR patch manifold is consistent with that of the original HR one.…”
Section: Lr-hr Pairwise Dictionarymentioning
confidence: 97%
“…Manifold Manifold based methods [151] (2004), [206], [207], [310], [311], [327], [329], [343], [382], [386], [403], [404], [469], [495], [521], [553], [561], [568], [569], [570] assume that the HR and LR images form manifolds with similar local geometries in two distinct feature spaces [343]. Similar to PCA, these methods are also usually used for dimensionality reduction.…”
Section: Learning Based Single Image Sr Algorithmsmentioning
confidence: 99%
“…In the first step, they are combined with a MAP method [310], [311], [495], [568], [569], [570] or a Markov based learning method [206] like those in [65], [66], [76], [102], [146], [203] to apply a global constraint over the super-resolved image. In the second step, they use a different technique like Kernel Ridge Regression (KRR) [343], [495], graph embedding [568], radial basis function and partial least squares (RBF-PLS) regression [569], [570] to apply local constraints to the super-resolved image by finding the transformation between low and HR residual patches.…”
Section: Learning Based Single Image Sr Algorithmsmentioning
confidence: 99%
“…While the samples in the HR face space can more practically reflect the neighbor relationship compared with the LR one [15], and thus we construct the similarity graphs in the original HR image space and then preserve geometry constraint for the reconstructed HR face space. is the set of b K neighbors of i y belonging to different persons.…”
Section: Similarity Graphs On Multi-manifoldmentioning
confidence: 99%
“…As a result, the manifold margin in the reconstructed HR face space is much larger and thus more discriminant for recognition purpose. Though the multi-manifold discriminant analysis has not been considered for image SR, it has been widely investigated in many aspects in other matching learning, pattern recognition and computer vision models [13,14,15]. We empirically show that, in combination with multi-manifold structural information, the reconstructed HR faces can result in considerable FR improvements.…”
Section: Introductionmentioning
confidence: 97%