Sciweavers

4057 search results - page 244 / 812
» Linear combination of transformations
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
VTC
2010
IEEE
129views Communications» more  VTC 2010»
15 years 4 months ago
A Systematic LT Coded Arrangement for Transmission over Correlated Shadow Fading Channels in 802.11 Ad-Hoc Wireless Networks
— Systematic Luby Transform (SLT) codes constitute rateless codes, which are capable of adaptively adjusting their code rate depending on the channel quality without any explicit...
Hoang Anh Ngo, Tim Stevens, Robert G. Maunder, Laj...
ICASSP
2011
IEEE
14 years 10 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
ICASSP
2011
IEEE
14 years 10 months ago
Rapid feature space MLLR speaker adaptation with bilinear models
In this paper, we propose a novel method for rapid feature space Maximum Likelihood Linear Regression (FMLLR) speaker adaptation based on bilinear models. When the amount of adapt...
Shilei Zhang, Peder A. Olsen, Yong Qin
CVPR
2012
IEEE
13 years 9 months ago
Learning rotation-aware features: From invariant priors to equivariant descriptors
Identifying suitable image features is a central challenge in computer vision, ranging from representations for lowlevel to high-level vision. Due to the difficulty of this task,...
Uwe Schmidt, Stefan Roth