Sciweavers

495 search results - page 24 / 99
» Sparse representation algorithms based on mean-field approxi...
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Image prediction based on non-negative matrix factorization
This paper presents a novel spatial texture prediction method based on non-negative matrix factorization. As an extension of template matching, approximation based iterative textu...
Mehmet Türkan, Christine Guillemot
ECCV
2008
Springer
15 years 12 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
CORR
2011
Springer
179views Education» more  CORR 2011»
14 years 5 months ago
Recovery of Sparsely Corrupted Signals
We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise adm...
Christoph Studer, Patrick Kuppinger, Graeme Pope, ...
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
14 years 11 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
CGF
2010
157views more  CGF 2010»
14 years 7 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen