Sciweavers

1176 search results - page 54 / 236
» Sparse reward processes
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Compressed learning of high-dimensional sparse functions
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...
Karin Schnass, Jan Vybíral
ICASSP
2011
IEEE
14 years 10 months ago
Optical MEMS image enhancement with sparse signal representation
This paper describes a complete low-complexity imaging system based on a single MEMS scanning mirror and a single photodetector, together with customized image enhancement algorit...
Ganchi Zhang, Li Li, Vladimir Stankovic, Lina Stan...
ICIP
2009
IEEE
16 years 7 months ago
Facial Expression Recognition Based On Graph-preserving Sparse Non-negative Matrix Factorization
In this paper, we present a novel algorithm for representing facial expressions. The algorithm is based on the non-negative matrix factorization (NMF) algorithm, which decomposes ...
ICIP
2009
IEEE
16 years 7 months ago
Weighted Average Denoising With Sparse Orthonormal Transforms
Sparse Orthonormal Transforms (SOT) has recently been proposed as a data compression method that can achieve sparser representations in transform domain. Given initial conditions,...
ICASSP
2008
IEEE
16 years 1 months ago
Frequency domain selective tap adaptive algorithms for sparse system identification
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...
Andy W. H. Khong, Xiang Lin, Milos Doroslovacki, P...