.png){kind=icon}
返回
A computational algorithm for minimizing total variation in image restoration
.png){kind=icon}
PRE
AI
DOI：10.1109/83.503914.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A reliable and efficient computational algorithm for restoring blurred and noisy images is proposed, The restoration process is based on the minimal total variation principle introduced by Rudin et al, For discrete images, the proposed algorithm minimizes a piecewise linear l(1) function (a measure of total variation) subject to a single 2-norm inequality constraint (a measure of data fit). The algorithm starts by finding a feasible point for the inequality constraint using a (partial) conjugate gradient method, This corresponds to a deblurring process, Noise and other artifacts are removed by a subsequent total variation minimization process, The use of the linear l(1) objective function for the total variation measurement leads to a simplier computational algorithm, Both the steepest descent and an affine scaling Newton method are considered to solve this constrained piecewise linear l(1) minimization problem. The resulting algorithm, when viewed as an image restoration and enhancement process, has the feature that it can be used in an adaptive/interactive manner in situations when knowledge of the noise variance is either unavailable or unreliable, Numerical examples are presented to demonstrate the effectiveness of the proposed iterative image restoration and enhancement process.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容