Blind motion deblurring is one of the most basic and challenging problems in image processing and computer vision. It aims to recover a sharp image from its blurred version knowing nothing about the blur process. Many existing methods use Maximum A Posteriori (MAP) or Expectation Maximization (EM) frameworks to deal with this kind of problems, but they cannot handle well the figh frequency features of natural images. Most recently, deep neural networks have been emerging as a powerful tool for image deblurring. In this paper, we prove that encoder-decoder architecture gives better results for image deblurring tasks. In addition, we propose a novel end-to-end learning model which refines generative adversarial network by many novel training strategies so as to tackle the problem of deblurring. Experimental results show that our model can capture high frequency features well, and the results on benchmark dataset show that proposed model achieves the competitive performance.
Chan and Wang @cite_43 proposed a robust total variation minimization method which is effective for regularizing the gradient or the edge of the sharp image. @cite_13 proposed a sparse coding method for sharp image recovering, which assumes that the natural image patch can be sparsely represented by a over-complete dictionary. @cite_27 applied sparse representation for estimate sharp image and blur kernel at the same time. @cite_49 found that the minimum of their loss function in many existing methods do not correspond to their real sharp images,so @cite_49 proposed a normalized sparsity prior to handle this problems. Michaeli and Irani @cite_31 found that multiscale properties can also be used for blind deblurring problems, so Michaeli and Iranli @cite_31 proposed self-similarity as image prior. @cite_16 proposed low rank prior for both images and their gradients.
@cite_43 @cite_27 @cite_49 @cite_31 @cite_16 @cite_13
2952773148 2133957619 2198155329 2220123745
This paper proposes a simple, accurate, and robust approach to single image nonparametric blind Super-Resolution (SR). This task is formulated as a functional to be minimized with respect to both an intermediate super-resolved image and a nonparametric blur-kernel. The proposed approach includes a convolution consistency constraint which uses a non-blind learning-based SR result to better guide the estimation process. Another key component is the unnatural bi-l0-l2-norm regularization imposed on the super-resolved, sharp image and the blur-kernel, which is shown to be quite beneficial for estimating the blur-kernel accurately. The numerical optimization is implemented by coupling the splitting augmented Lagrangian and the conjugate gradient (CG). Using the pre-estimated blur-kernel, we finally reconstruct the SR image by a very simple non-blind SR method that uses a natural image prior. The proposed approach is demonstrated to achieve better performance than the recent method by Michaeli and Irani [2] in both terms of the kernel estimation accuracy and image SR quality. This paper addresses the problem of restoring images subjected to unknown and spatially varying blur caused by defocus or linear (say, horizontal) motion. The estimation of the global (non-uniform) image blur is cast as a multi-label energy minimization problem. The energy is the sum of unary terms corresponding to learned local blur estimators, and binary ones corresponding to blur smoothness. Its global minimum is found using Ishikawa's method by exploiting the natural order of discretized blur values for linear motions and defocus. Once the blur has been estimated, the image is restored using a robust (non-uniform) deblurring algorithm based on sparse regularization with global image statistics. The proposed algorithm outputs both a segmentation of the image into uniform-blur layers and an estimate of the corresponding sharp image. We present qualitative results on real images, and use synthetic data to quantitatively compare our approach to the publicly available implementation of Chakrabarti et al Patch-based low-rank models have shown effective in exploiting spatial redundancy of natural images especially for the application of image denoising. However, two-dimensional low-rank model can not fully exploit the spatio-temporal correlation in larger data sets such as multispectral images and 3D MRIs. In this work, we propose a novel low-rank tensor approximation framework with Laplacian Scale Mixture (LSM) modeling for multi-frame image denoising. First, similar 3D patches are grouped to form a tensor of d-order and high-order Singular Value Decomposition (HOSVD) is applied to the grouped tensor. Then the task of multiframe image denoising is formulated as a Maximum A Posterior (MAP) estimation problem with the LSM prior for tensor coefficients. Both unknown sparse coefficients and hidden LSM parameters can be efficiently estimated by the method of alternating optimization. Specifically, we have derived closed-form solutions for both subproblems. Experimental results on spectral and dynamic MRI images show that the proposed algorithm can better preserve the sharpness of important image structures and outperform several existing state-of-the-art multiframe denoising methods (e.g., BM4D and tensor dictionary learning). It is difficult to design an image super-resolution algorithm that can not only preserve image edges and texture structure but also keep lower computational complexity. A new super-resolution model based on sparsity regularization in Bayesian framework is presented. The fidelity term restricts the underlying image to be consistent with the observation image in terms of the image degradation model. The sparsity regularization term constraints the underlying image with a sparse representation in a proper dictionary. The non-local self-similarity is also introduced into the model. In order to make the sparse domain better represent the underlying image, we use high-frequency features extracted from the underlying image patches for sparse representation, which increases the effectiveness of sparse modeling. The proposed method learns dictionary directly from the estimated high-resolution image patches (extracted features), and the dictionary learning and the super-resolution can be fused together naturally into one coherent and iterated process. Such a self-learning method has stronger adaptability to different images and reduces dictionary training time. Experiments demonstrate the effectiveness of the proposed method. Compared with some state-of-the-art methods, the proposed method can better preserve image edges and texture details.