104 search results - page 2 / 21 » An Overview Of Inverse Problem Regularization Using Sparsity |
99
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
118
Voted
NIPS
2004
15 years 2 months ago
2004
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
102
Voted
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
82
Voted
SIAMSC
2008
15 years 17 days ago
2008
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
101
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...