104 search results - page 2 / 21 » An Overview Of Inverse Problem Regularization Using Sparsity |
ECCV
2008
Springer
14 years 7 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...
NIPS
2004
13 years 6 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...
PKDD
2010
Springer
13 years 3 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...
SIAMSC
2008
13 years 5 months 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...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...