Sciweavers

31 search results - page 2 / 7
» A Fast Approximation of the Bilateral Filter Using a Signal ...
Sort
View
ICASSP
2007
IEEE
13 years 11 months ago
Fast Search of Sequences with Complex Symbol Correlations using Profile Context-Sensitive HMMS and Pre-Screening Filters
Recently, profile context-sensitive HMMs (profile-csHMMs) have been proposed which are very effective in modeling the common patterns and motifs in related symbol sequences. Pro...
Byung-Jun Yoon, P. P. Vaidyanathan
ICASSP
2009
IEEE
14 years 1 days ago
A differential geometric approach to discrete-coefficient filter design
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
Subramanian Ramamoorthy, Lothar Wenzel, James Nagl...
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
14 years 5 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...

Book
4675views
15 years 2 months ago
Mathematics of The Discrete Fourier Transform (DFT) with Audio Applications
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
Julius O. Smith III
ICASSP
2008
IEEE
13 years 11 months ago
Distributed compressed sensing: Sparsity models and reconstruction algorithms using annihilating filter
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...
Ali Hormati, Martin Vetterli