Sciweavers

3256 search results - page 413 / 652
» Learning Linear Transformations
Sort
View
JCSS
2002
95views more  JCSS 2002»
15 years 6 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
NECO
1998
116views more  NECO 1998»
15 years 6 months ago
GTM: The Generative Topographic Mapping
Latent variable models represent the probability density of data in a space of several dimensions in terms of a smaller number of latent, or hidden, variables. A familiar example ...
Christopher M. Bishop, Markus Svensén, Chri...
SPEECH
1998
171views more  SPEECH 1998»
15 years 6 months ago
Heteroscedastic discriminant analysis and reduced rank HMMs for improved speech recognition
We present the theory for heteroscedastic discriminant analysis (HDA), a model-based generalization of linear discriminant analysis (LDA) derived in the maximum-likelihood framewo...
Nagendra Kumar, Andreas G. Andreou
ICASSP
2010
IEEE
15 years 5 months ago
2-D two-fold symmetric circular shaped filter design with homomorphic processing application
A design method of a linear-phased, two-dimensional (2-D), twofold symmetric circular shaped filter is presented in this paper. Although the proposed method designs a non-separab...
Akila J. Seneviratne, Ha Hoang Kha, Hoang Duong Tu...
ICIP
2010
IEEE
15 years 4 months ago
Constructing a sparse convolution matrix for shift varying image restoration problems
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
Stanley H. Chan