arrow
返回

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

delete2004-08-26
delete3.9K
delete
OA
AI
I
Ingrid Daubechies
M
Michel Defrise
C
Christine De Mol
DOI:10.1002/cpa.20042delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Communications on Pure and Applied Mathematics 封面图
Communications on Pure and Applied Mathematics
IF:
2.7
论文数:
1.5K
被引数:
1.1W

机构

暂无机构信息
引用论文

引用论文

Predicting the time required to conceive
err1964-07-01
err0
PREAI
errR. G. Potter; M. P. Parker
err分享
err收藏
err分享
err收藏
err分享
err收藏
Nectar trichome structure of aquatic bladderworts from the section Utricularia (Lentibulariaceae) with observation of flower visitors and pollinators
err2018-02-05
err0
errOAAI
errBartosz J. Płachno; Małgorzata Stpiczyńska; Lubomír Adamec; Vitor Fernandes Oliveira Miranda; Piotr Świątek
err分享
err收藏
Statistical Literacy of Obstetrics-Gynecology Residents
err2013-06-01
err0
errOAAI
errBritta L. Anderson; Sterling Williams; Jay Schulkin
err分享
err收藏
学者 查看更多内容