351 search results - page 22 / 71 » The Skip-Innovation Model for Sparse Images |
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
SDM
2012
SIAM
11 years 9 months ago
2012
SIAM
In this paper, we consider the multi-task sparse learning problem under the assumption that the dimensionality diverges with the sample size. The traditional l1/l2 multi-task lass...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we propose a Bayesian model and a Monte Carlo Markov chain (MCMC) algorithm for reconstructing images that consist of only few non-zero pixels. An appropriate distr...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a semisupervised manner: the model is learnt from example ...
ICIAP
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, a novel learning algorithm for Hidden Markov Models (HMMs) has been devised. The key issue is the achievement of a sparse model, i.e., a model in which all irreleva...