Proceedings Article10.1109/CVPR.2015.7299003
Fast and accurate image upscaling with super-resolution forests
Samuel Schulter,Christian Leistner,Horst Bischof +2 more
- 07 Jun 2015
- pp 3791-3799
TL;DR: This paper shows the close relation of previous work on single image super-resolution to locally linear regression and demonstrates how random forests nicely fit into this framework, and proposes to directly map from low to high-resolution patches using random forests.
read more
Abstract: The aim of single image super-resolution is to reconstruct a high-resolution image from a single low-resolution input. Although the task is ill-posed it can be seen as finding a non-linear mapping from a low to high-dimensional space. Recent methods that rely on both neighborhood embedding and sparse-coding have led to tremendous quality improvements. Yet, many of the previous approaches are hard to apply in practice because they are either too slow or demand tedious parameter tweaks. In this paper, we propose to directly map from low to high-resolution patches using random forests. We show the close relation of previous work on single image super-resolution to locally linear regression and demonstrate how random forests nicely fit into this framework. During training the trees, we optimize a novel and effective regularized objective that not only operates on the output space but also on the input space, which especially suits the regression task. During inference, our method comprises the same well-known computational efficiency that has made random forests popular for many computer vision problems. In the experimental part, we demonstrate on standard benchmarks for single image super-resolution that our approach yields highly accurate state-of-the-art results, while being fast in both training and evaluation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Deep Back-ProjectiNetworks for Single Image Super-Resolution
TL;DR: Deep Back-Projection Networks (DBPN) as discussed by the authors exploit iterative up-and down-sampling layers to exploit the mutual dependencies of low and high-resolution images, which is the winner of two image super-resolution challenges (NTIRE2018 and PIRM2018).
76
Single Image Super-Resolution Based on Wiener Filter in Similarity Domain.
TL;DR: This paper introduces a novel prior leading to the collaborative filtering of patch groups in a 1D similarity domain and couple it with an iterative back-projection framework that outperforms the current non-convolutional neural network-based methods on the tested data sets for various scaling factors.
73
Practical Single-Image Super-Resolution Using Look-Up Table
Younghyun Jo,Seon Joo Kim +1 more
- 01 Jun 2021
TL;DR: In this article, a look-up table (LUT) based super-resolution method is proposed to retrieve the HR output values from the LUT for query LR input pixels.
Image super-resolution with an enhanced group convolutional neural network
TL;DR: In this article , an enhanced super-resolution group CNN (ESRGCNN) was proposed by fully fusing deep and wide channel features to extract more accurate low-frequency information in terms of correlations of different channels in single image superresolution (SISR).
Underwater Image Super-Resolution using Deep Residual Multipliers
Jahidul Islam,Sadman Sakib Enan,Peigen Luo,Junaed Sattar +3 more
- 01 May 2020
TL;DR: In this paper, a deep residual network-based generative model for single image super-resolution (SISR) of underwater imagery for use by autonomous underwater robots is presented. And an adversarial training pipeline for learning SISR from paired data is also provided.
70
References
Random Forests
Leo Breiman
- 01 Oct 2001
TL;DR: Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the forest, and are also applicable to regression.
$rm K$ -SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
TL;DR: A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data.
10K
Extremely randomized trees
TL;DR: A new tree-based ensemble method for supervised classification and regression problems that consists of randomizing strongly both attribute and cut-point choice while splitting a tree node and builds totally randomized trees whose structures are independent of the output values of the learning sample.
Contour Detection and Hierarchical Image Segmentation
TL;DR: This paper investigates two fundamental problems in computer vision: contour detection and image segmentation and presents state-of-the-art algorithms for both of these tasks.
Learning a Deep Convolutional Network for Image Super-Resolution
Chao Dong,Chen Change Loy,Kaiming He,Xiaoou Tang +3 more
- 06 Sep 2014
TL;DR: This work proposes a deep learning method for single image super-resolution (SR) that directly learns an end-to-end mapping between the low/high-resolution images and shows that traditional sparse-coding-based SR methods can also be viewed as a deep convolutional network.