53 search results - page 7 / 11 » A Non-convex Relaxation Approach to Sparse Dictionary Learni... |
SIGPRO
2011
13 years 2 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
AADA
2011
12 years 7 months ago
2011
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves ...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Texture classification is a classical yet still active topic in computer vision and pattern recognition. Recently, several new texture classification approaches by modeling textur...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...