1355 search results - page 181 / 271 » icassp 2011 |
175
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
202
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider the problem of fitting a discrete curve to time-labeled data points on the set Pn of all n-by-n symmetric positive-definite matrices. The quality of a curve is measu...
164
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
209
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The method which is called the “tandem approach” in speech recognition has been shown to increase performance by using classifier posterior probabilities as observations in a...
199
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents a technique for the efficient compression of high dynamic range video (HDR) sequences. Such video sequences usually represent several orders of magnitude of r...