Nonlinear total variation based noise removal algorithms
Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Iterative methods for total variation denoising
SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
SIAM Journal on Scientific Computing
Removing camera shake from a single photograph
ACM SIGGRAPH 2006 Papers
Total variation minimizing blind deconvolution with shock filter reference
Image and Vision Computing
High-quality motion deblurring from a single image
ACM SIGGRAPH 2008 papers
The Split Bregman Method for L1-Regularized Problems
SIAM Journal on Imaging Sciences
Deblurring Poissonian images by split Bregman techniques
Journal of Visual Communication and Image Representation
Total variation restoration of speckled images using a split-Bregman algorithm
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A novel blind deconvolution scheme for image restoration usingrecursive filtering
IEEE Transactions on Signal Processing
A regularization approach to joint blur identification and image restoration
IEEE Transactions on Image Processing
Total variation blind deconvolution
IEEE Transactions on Image Processing
Blind Deconvolution Using a Variational Approach to Parameter, Image, and Blur Estimation
IEEE Transactions on Image Processing
Computers & Mathematics with Applications
Robust blind motion deblurring using near-infrared flash image
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
Blind image deconvolution is one of the most challenging problems in image processing. The total variation (TV) regularization approach can effectively recover edges of image. In this paper, we propose a new TV blind deconvolution algorithm by employing split Bregman iteration (called as TV-BDSB). Considering the operator splitting and penalty techniques, we present also a new splitting objective function. Then, we propose an extended split Bregman iteration to address the minimizing problems, the latent image and the blur kernel are estimated alternately. The TV-BDSB algorithm can greatly reduce the computational cost and improve remarkably the image quality. Experiments are conducted on both synthetic and real-life degradations. Comparisons are also made with some existing blind deconvolution methods. Experimental results indicate the advantages of the proposed algorithm.