MULTISPECTRAL IMAGE RESTORATION USING A VECTOR-VALUED REACTION-DIFFUSION BASED MIXED NOISE REMOVAL TECHNIQUE

A novel multispectral image filtering technique is proposed in this article. Since the multispectral images are often corrupted by mixed Poisson-Gaussian noise during the sensing and acquisition process, a nonlinear anisotropic diffusion-based restoration approach that deals efficiently with this type of noise mixture is considered here. A second-order vector-valued reaction-diffusion model that leads to a system of well-posed single-valued anisotropic diffusion equations coupled by correlation terms is introduced for this purpose. A finite difference method-based fast-converging approximation algorithm that solves numerically this nonlinear diffusion-based system is then proposed. This iterative numerical approximation scheme is successfully used for removing both the additive Gaussian and quantum noises while preserving the essential features of the multi-valued image. The effectiveness of the described mixed denoising technique is illustrated by the results of the restoration experiments and method comparisons that are also presented here. The proposed restoration approach enhances considerably the spectral image quality, making it well-prepared for the further MSI analysis and computer vision processes, such as the geospatial and remote sensing image analysis

Bregman Cost for Non-Gaussian Noise

One of the tasks of the Bayesian inverse problem is to find a good estimate based on the posterior probability density. The most common point estimators are the conditional mean (CM) and maximum a posteriori (MAP) estimates, which correspond to the mean and the mode of the posterior, respectively. From a theoretical point of view it has been argued that the MAP estimate is only in an asymptotic sense a Bayes estimator for the uniform cost function, while the CM estimate is a Bayes estimator for the means squared cost function. Recently, it has been proven that the MAP estimate is a proper Bayes estimator for the Bregman cost if the image is corrupted by Gaussian noise. In this work we extend this result to other noise models with log-concave likelihood density, by introducing two related Bregman cost functions for which the CM and the MAP estimates are proper Bayes estimators. Moreover, we also prove that the CM estimate outperforms the MAP estimate, when the error is measured in a certain Bregman distance, a result previously unknown also in the case of additive Gaussian noise

Fully Convolutional Network with Multi-Step Reinforcement Learning for Image Processing

This paper tackles a new problem setting: reinforcement learning with pixel-wise rewards (pixelRL) for image processing. After the introduction of the deep Q-network, deep RL has been achieving great success. However, the applications of deep RL for image processing are still limited. Therefore, we extend deep RL to pixelRL for various image processing applications. In pixelRL, each pixel has an agent, and the agent changes the pixel value by taking an action. We also propose an effective learning method for pixelRL that significantly improves the performance by considering not only the future states of the own pixel but also those of the neighbor pixels. The proposed method can be applied to some image processing tasks that require pixel-wise manipulations, where deep RL has never been applied. We apply the proposed method to three image processing tasks: image denoising, image restoration, and local color enhancement. Our experimental results demonstrate that the proposed method achieves comparable or better performance, compared with the state-of-the-art methods based on supervised learning.Comment: Accepted to AAAI 201

Image denoising with multi-layer perceptrons, part 1: comparison with existing algorithms and with bounds

Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with cleverly engineered algorithms. In this work we attempt to learn this mapping directly with plain multi layer perceptrons (MLP) applied to image patches. We will show that by training on large image databases we are able to outperform the current state-of-the-art image denoising methods. In addition, our method achieves results that are superior to one type of theoretical bound and goes a large way toward closing the gap with a second type of theoretical bound. Our approach is easily adapted to less extensively studied types of noise, such as mixed Poisson-Gaussian noise, JPEG artifacts, salt-and-pepper noise and noise resembling stripes, for which we achieve excellent results as well. We will show that combining a block-matching procedure with MLPs can further improve the results on certain images. In a second paper, we detail the training trade-offs and the inner mechanisms of our MLPs