.png){kind=icon}
返回
Efficient Algorithm for Nonconvex Minimization and Its Application to PM Regularization
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2012.2208979.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In image processing, nonconvex regularization has the ability to smooth homogeneous regions and sharpen edges but leads to challenging computation. We propose some iterative schemes to minimize the energy function with nonconvex edge-preserving potential. The schemes are derived from the duality-based algorithm proposed by Berm dez and Moreno and the fixed point iteration. The convergence is proved for the convex energy function with nonconvex potential and the linear convergence rate is given. Applying the proposed schemes to Perona and Malik's nonconvex regularization, we present some efficient algorithms based on our schemes, and show the approximate convergence behavior for nonconvex energy function. Experimental results are presented, which show the efficiency of our algorithms, including better denoised performance of nonconvex regularization, faster convergence speed, higher calculation precision, lower calculation cost under the same number of iterations, and less implementation time under the same peak signal noise ratio level.
Keyword:
Image processing
nonconvex
duality
fixed point iteration
regularization
convergence
optimization
algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
引用论文
.png){kind=icon}
Family Businesses in Spain: Tracks Followed and Outcomes Reached by Those Among the Largest Thousand
PREAI
分享收藏
查看更多内容