Fast super-resolution via dense local training and inverse regressor search

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Regression-based Super-Resolution (SR) addresses the upscaling problem by learning a mapping function (i.e. regressor) from the low-resolution to the high-resolution manifold. Under the locally linear assumption, this complex non-linear mapping can be properly modeled by a set of linear regressors distributed across the manifold. In such methods, most of the testing time is spent searching for the right regressor within this trained set. In this paper we propose a novel inverse-search approach for regression-based SR. Instead of performing a search from the image to the dictionary of regressors, the search is done inversely from the regressors’ dictionary to the image patches. We approximate this framework by applying spherical hashing to both image and regressors, which reduces the inverse search into computing a trained function. Additionally, we propose an improved training scheme for SR linear regressors which improves perceived and objective quality. By merging both contributions we improve speed and quality compared to the stateof- the-art.

Cite

CITATION STYLE

APA

Pérez-Pellitero, E., Salvador, J., Torres-Xirau, I., Ruiz-Hidalgo, J., & Rosenhahn, B. (2015). Fast super-resolution via dense local training and inverse regressor search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9005, pp. 346–359). Springer Verlag. https://doi.org/10.1007/978-3-319-16811-1_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free