Abstract

Until now, neighbor-embedding-based (NE) algorithms for super-resolution (SR) have carried out two independent processes to synthesize high-resolution (HR) image patches. In the first process, neighbor search is performed using the Euclidean distance metric, and in the second process, the optimal weights are determined by solving a constrained least squares problem. However, the separate processes are not optimal. In this paper, we propose a sparse neighbor selection scheme for SR reconstruction. We first predetermine a larger number of neighbors as potential candidates and develop an extended Robust-SL0 algorithm to simultaneously find the neighbors and to solve the reconstruction weights. Recognizing that the k-nearest neighbor (k-NN) for reconstruction should have similar local geometric structures based on clustering, we employ a local statistical feature, namely histograms of oriented gradients (HoG) of low-resolution (LR) image patches, to perform such clustering. By conveying local structural information of HoG in the synthesis stage, the k-NN of each LR input patch is adaptively chosen from their associated subset, which significantly improves the speed of synthesizing the HR image while preserving the quality of reconstruction. Experimental results suggest that the proposed method can achieve competitive SR quality compared with other state-of-the-art baselines.

Keywords

Cluster analysisk-nearest neighbors algorithmEmbeddingPattern recognition (psychology)HistogramNearest neighbor searchEuclidean distanceArtificial intelligenceComputer scienceMetric (unit)Image (mathematics)Iterative reconstructionAlgorithmMathematics

Affiliated Institutions

Related Publications

Publication Info

Year
2012
Type
article
Volume
21
Issue
7
Pages
3194-3205
Citations
312
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

312
OpenAlex

Cite This

Xuelong Li, Xinbo Gao, Kaibing Zhang et al. (2012). Image Super-Resolution With Sparse Neighbor Embedding. IEEE Transactions on Image Processing , 21 (7) , 3194-3205. https://doi.org/10.1109/tip.2012.2190080

Identifiers

DOI
10.1109/tip.2012.2190080