Deeply Aggregated Alternating Minimization for Image Restoration

Abstract

Regularization-based image restoration has remained an active research topic in image processing and computer vision. It often leverages a guidance signal captured in different fields as an additional cue. In this work, we present a general framework for image restoration, called deeply aggregated alternating minimization (DeepAM). We propose to train deep neural network to advance two of the steps in the conventional AM algorithm: proximal mapping and b-continuation. Both steps are learned from a large dataset in an end-to-end manner. The proposed framework enables the convolutional neural networks (CNNs) to operate as a regularizer in the AM algorithm. We show that our learned regularizer via deep aggregation outperforms the recent data-driven approaches as well as the nonlocal-based methods. The flexibility and effectiveness of our framework are demonstrated in several restoration tasks, including single image denoising, RGB-NIR restoration, and depth super-resolution.

Cite

Text

Kim et al. "Deeply Aggregated Alternating Minimization for Image Restoration." Conference on Computer Vision and Pattern Recognition, 2017. doi:10.1109/CVPR.2017.38

Markdown

[Kim et al. "Deeply Aggregated Alternating Minimization for Image Restoration." Conference on Computer Vision and Pattern Recognition, 2017.](https://mlanthology.org/cvpr/2017/kim2017cvpr-deeply/) doi:10.1109/CVPR.2017.38

BibTeX

@inproceedings{kim2017cvpr-deeply,
  title     = {{Deeply Aggregated Alternating Minimization for Image Restoration}},
  author    = {Kim, Youngjung and Jung, Hyungjoo and Min, Dongbo and Sohn, Kwanghoon},
  booktitle = {Conference on Computer Vision and Pattern Recognition},
  year      = {2017},
  doi       = {10.1109/CVPR.2017.38},
  url       = {https://mlanthology.org/cvpr/2017/kim2017cvpr-deeply/}
}