Deblurring by Solving a TVp-Regularized Optimization Problem Using Split Bregman Method
Image deblurring is formulated as an unconstrained minimization problem, and its penalty function is the sum of the error term and TVp-regularizers with 0<p<1. Although TVp-regularizer is a powerful tool that can significantly promote the sparseness of image gradients, it is neither convex nor...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2014-01-01
|
| Series: | Advances in Multimedia |
| Online Access: | http://dx.doi.org/10.1155/2014/906464 |