2012 IEEE International Symposium on Circuits and Systems 2012
DOI: 10.1109/iscas.2012.6271859
|View full text |Cite
|
Sign up to set email alerts
|

Surveillance face hallucination via variable selection and manifold learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…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%
See 1 more Smart Citation
“…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%
“…These methods solve the SR problem by learning the relationship between HR and LR image patches or coefficients from a training set containing HR and LR image pairs. The target HR image can be inferred explicitly [10][11][12][13] or implicitly, which represent the input LR patch sparsely [13], collaboratively [14], and locally [15][16][17]. In [18], face image is considered as a whole.…”
Section: Introductionmentioning
confidence: 99%
“…Super-resolution algorithms can be divided into two categories: reconstruction based algorithms and learning based algorithms. Algorithms based on learning gain more attention for its higher magnification and better performance [1][2][3][5][6][7][8][9][10][11][12][13]. In these learning based methods, they can reconstruct a HR image from an input image with priors from HR and LR face image training set.…”
Section: Introductionmentioning
confidence: 99%
“…However, the assumption must meet two premises: first, the sample data is dense sampling from the manifold space; second, the sample data is noiseless. This paper only focuses on the former; please refer to our previous work [12][13], which deal with the noisy manifold learning problem. Under the condition that training sample size is small, sample data can just constitute a sparse space of the highdimensional face manifold space, and even the most adjacent point can hardly be treated as local.…”
Section: Introductionmentioning
confidence: 99%