返回
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
DOI:10.1002/cpa.20042.png)
摘要
En 中文
We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary preassigned orthonormal basis. We prove that replacing the usual quadratic regularizing penalties by weighted l(p)- penalties on the coefficients of such expansions, with 1 less than or equal to p less than or equal to 2, still regularizes the problem. Use of such l(p)-penalized problems with p < 2 is often advocated when one expects the underlying ideal noiseless solution to have a sparse expansion with respect to the basis under consideration. To compute the corresponding regularized solutions, we analyze an iterative algorithm that amounts to a Landweber iteration with thresholding (or nonlinear shrinkage) applied at each iteration step. We prove that this algorithm converges in norm. (C) 2004 Wiley Periodicals, Inc.
Keyword:
WAVELET METHODS
SUPERRESOLUTION
DECONVOLUTION
DECOMPOSITION
SHRINKAGE
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
1.5K
被引数:
1.1W
机构
暂无机构信息
引用论文
Type III secretion system 1 of Vibrio parahaemolyticus induces oncosis in both epithelial and monocytic cell lines
Microbiology
IF0
Nectar trichome structure of aquatic bladderworts from the section Utricularia (Lentibulariaceae) with observation of flower visitors and pollinators
Protoplasma
IF0

