Learning graph-constrained cascade regressors for single image super-resolution |
| |
Authors: | Yan Jianqiang Zhang Kaibing Luo Shuang Xu Jian Lu Jian Xiong Zenggang |
| |
Affiliation: | 1.School of Electronic Engineering, Xidian University, Xi’an, 710071, China ;2.School of Electronics and Information, Xi’an Polytechnic University, Xi’an, 710048, China ;3.School of Computer and Information Science, Hubei Engineering University, Xiaogan, 432000, China ; |
| |
Abstract: | Learning cascade regression has been shown an effective strategy to further enhance the perceptual quality of resulted high-resolution (HR) images. However, previous cascade regression-based SR methods have two obvious weaknesses: (1)edge structures cannot be preserved well when applying texture features to represent low-resolution (LR) images, and (2)the local manifold structures spanned by the LR-HR feature spaces cannot be revealed by the learned local linear mappings. To alleviate the aforementioned problems, a novel example regression-based super-resolution (SR) approach called learning graph-constrained cascade regressors (LGCCR) is presented, which learns a group of multi-round residual regressors in a unique way. Specifically, we improve the edge preservation capability by synthesizing the whole HR image rather than local image patches, which facilitates to extract the edge features to represent LR images. Moreover, we utilize a graph-constrained regression model to build the local linear regressors, where each local linear regressor responds to an anchored atom in the learned over-complete dictionary. Both quantitative and qualitative quality evaluations on seven benchmark databases indicate the superiority of the proposed LGCCR-based SR approach in comparing with other state-of-the-art SR predecessors. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|