Sciweavers

1176 search results - page 80 / 236
» Sparse reward processes
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Exemplar-based Sparse Representation phone identification features
Exemplar-based techniques, such as k-nearest neighbors (kNNs) and Sparse Representations (SRs), can be used to model a test sample from a few training points in a dictionary set. ...
Tara N. Sainath, David Nahamoo, Bhuvana Ramabhadra...
ICASSP
2010
IEEE
15 years 4 months ago
Semi-Supervised Hyperspectral Unmixing via the Weighted Lasso
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
Konstantinos Themelis, Athanasios A. Rontogiannis,...
ICASSP
2010
IEEE
15 years 4 months ago
Performance analysis of IPNLMS for identification of time-varying systems
The tracking performance of adaptive filters is crucially important in practical applications involving time-varying systems. We present an analysis of the tracking performance f...
Pradeep Loganathan, Emanuel A. P. Habets, Patrick ...
ICASSP
2011
IEEE
14 years 7 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
ICASSP
2011
IEEE
14 years 7 months ago
Image compression using the Iteration-Tuned and Aligned Dictionary
We present a new, block-based image codec based on sparse representations using a learned, structured dictionary called the IterationTuned and Aligned Dictionary (ITAD). The quest...
Joaquin Zepeda, Christine Guillemot, Ewa Kijak