摘要
We propose a convex relaxation technique for computing global solutions for the nonconvex multiplicative noise model. The method is based on functional lifting by introducing an additional dimension. We employ a primal-dual-based gradient-type algorithm in numerical implementations to overcome the nondifferentiability of the total variation term. Numerical results show that our algorithm is highly efficient. Furthermore, global solutions of the original model can be obtained with no dependence on the initial guess.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 144-155 |
| 页数 | 12 |
| 期刊 | Journal of Computational and Applied Mathematics |
| 卷 | 238 |
| 期 | 1 |
| DOI | |
| 出版状态 | 已出版 - 15 1月 2013 |
学术指纹
探究 'A convex relaxation method for computing exact global solutions for multiplicative noise removal' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver