Sciweavers

104 search results - page 11 / 21
» An Overview Of Inverse Problem Regularization Using Sparsity
Sort
View
PR
2011
13 years 1 months ago
Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurrin...
Sangwoon Yun, Hyenkyun Woo
SIAMIS
2010
156views more  SIAMIS 2010»
13 years 1 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...
CIKM
2010
Springer
13 years 4 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 1 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
CDC
2008
IEEE
175views Control Systems» more  CDC 2008»
14 years 1 months ago
Transformation of optimal control problems with a state constraint avoiding interior boundary conditions
— A well–known problem in constrained optimal control is the presence of interior boundary conditions for constrained arcs which require a–priori knowledge of the optimal sol...
Knut Graichen, Nicolas Petit, Andreas Kugi