Sciweavers

941 search results - page 5 / 189
» Optimal Filters on the Sphere
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Filter banks for multiple description coding
In this paper we review some of our recent results on the design of critically sampled and oversampled filter banks for multiple description coding. For the case of critically sam...
Pier Luigi Dragotti
CORR
2012
Springer
158views Education» more  CORR 2012»
12 years 3 months ago
Sparse grid quadrature on products of spheres
This paper examines sparse grid quadrature on weighted tensor products (wtp) of reproducing kernel Hilbert spaces on products of the unit sphere S2 . We describe a wtp quadrature ...
Markus Hegland, Paul Leopardi
GLOBECOM
2008
IEEE
13 years 7 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
ICIP
1999
IEEE
14 years 9 months ago
Minimum Mean Square Error Fir Filter Banks with Arbitrary Filter Lengths
The performance of subband image coders depends on the proper choice of filter banks. It is therefore desirable to find algorithms for optimizing the filter banks. A theory for fi...
Are Hjørungnes, Helge Coward, Tor A. Ramsta...
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
11 years 10 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman