Search

Image restoration is a fundamental problem in computer vision, with the goal of restoring high-quality images from degraded low-quality observation images. However, the ill-posedness of restoration problem often leads to artifacts in the results. It inspires us to study the combination of prior, effectively restrict the solution space and improving the quality of the restored image. In this paper, a novel hybrid regularization method for image restoration is proposed, which adopts both internal and external image priors into a unified framework. Specifically, a new hybrid regularization model is designed. The TV model and a deep image denoiser are inserted into the restoration model using the plug-and-play framework, protecting image details while implicitly using external information for deep denoising. Moreover, in order to make the proposed hybrid regularization operable, an adaptive parameter method is proposed to adaptively balance the TV model and learned model in iteration. Experiments show that the proposed method surpasses the performance of existing image restoration techniques. [ABSTRACT FROM AUTHOR]

Abstract Image restoration is a fundamental problem in computer vision, with the goal of restoring high-quality images from degraded low-quality observation images. However, the ill-posedness of restoration problem often leads to artifacts in the results. It inspires us to study the combination of prior, effectively restrict the solution space and improving the quality of the restored image. In this paper, a novel hybrid regularization method for image restoration is proposed, which adopts both internal and external image priors into a unified framework. Specifically, a new hybrid regularization model is designed. The TV model and a deep image denoiser are inserted into the restoration model using the plug-and-play framework, protecting image details while implicitly using external information for deep denoising. Moreover, in order to make the proposed hybrid regularization operable, an adaptive parameter method is proposed to adaptively balance the TV model and learned model in iteration. Experiments show that the proposed method surpasses the performance of existing image restoration techniques.

Hyperspectral images (HSIs) are usually corrupted by various noises during the image acquisition process, e.g., Gaussian noise, impulse noise, stripes, deadlines and many others. Such complex noise severely degrades the data quality, reduces the interpretation accuracy of HSIs, and restricts the subsequent HSI applications. In this paper, a spatial non-local and local rank-constrained low-rank regularized Plug-and-Play (NLRPnP) model is presented for mixed noise removal in HSIs. Specifically, we first divide HSIs into local overlapping patches. Local rank-constrained low-rank matrix recovery is adopted to effectively separate the low-rank clean HSI patches from the sparse noise and a part of Gaussian noise, and to significantly preserve local structure and detail information in HSIs. Then the spatial non-local based denoiser is introduced to promote the non-local self-similarity and obviously depress the Gaussian noise. Without increasing the difficulty of solving optimization problems, we combine the local and non-local based methods into the Plug-and-Play framework, and develop an efficient algorithm for solving the proposed NLRPnP model by using the alternating direction method of multipliers method. Finally, several experiments are conducted in both simulated and real data conditions to illustrate the better performance of the proposed NLRPnP model than the existing state-of-the-art denoising models.

Multi-dimensional images, such as color images and multi-spectral images (MSIs), are highly correlated and contain abundant spatial and spectral information. However, real-world multi-dimensional images are usually corrupted by missing entries. By integrating deterministic low-rankness prior to the data-driven deep prior, we suggest a novel regularized tensor completion model for multi-dimensional image completion. In the objective function, we adopt the newly emerged tensor nuclear norm (TNN) to characterize the global low-rankness prior of multi-dimensional images. We also formulate an implicit regularizer by plugging a denoising neural network (termed as deep denoiser), which is convinced to express the deep image prior learned from a large number of natural images. The resulting model can be solved by the alternating directional method of multipliers algorithm under the plug-and-play (PnP) framework. Experimental results on color images, videos, and MSIs demonstrate that the proposed method can recover both the global structure and fine details very well and achieve superior performance over competing methods in terms of quality metrics and visual effects. [ABSTRACT FROM AUTHOR]

This paper presents a distributed computational framework for stochastic convex optimization problems using the so-called scenario approach. Such a problem arises, for example, in a large-scale network of interconnected linear systems with local and common uncertainties. Due to the large number of required scenarios to approximate the stochasticity of these problems, the stochastic optimization involves formulating a large-scale scenario program, which is in general computationally demanding. We present two novel ideas in this paper to address this issue. We first develop a technique to decompose the large-scale scenario program into distributed scenario programs that exchange a certain number of scenarios with each other to compute local decisions using the alternating direction method of multipliers (ADMM). We show the exactness of the decomposition with a-priori probabilistic guarantees for the desired level of constraint fulfillment for both local and common uncertainty sources. As our second contribution, we develop a so-called soft communication scheme based on a set parametrization technique together with the notion of probabilistically reliable sets to reduce the required communication between the subproblems. We show how to incorporate the probabilistic reliability notion into existing results and provide new guarantees for the desired level of constraint violations. Two different simulation studies of two types of interconnected network, namely dynamically coupled and coupling constraints, are presented to illustrate advantages of the proposed distributed framework. [ABSTRACT FROM AUTHOR]