Sciweavers

150 search results - page 22 / 30
» Optimization with EM and Expectation-Conjugate-Gradient
Sort
View
ICA
2010
Springer
13 years 9 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
JCB
2006
107views more  JCB 2006»
13 years 7 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
CVPR
2005
IEEE
14 years 10 months ago
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang
DAC
2005
ACM
14 years 8 months ago
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design
As the d esig n-m anu factu ring interface becom es increasing ly com plicated with IC technolog y scaling , the correspond ing process variability poses g reat challeng es for na...
Yang Xu, Kan-Lin Hsiung, Xin Li, Ivan Nausieda, St...
ICPR
2004
IEEE
14 years 9 months ago
Morphology Analysis of Physiological Signals Using Hidden Markov Models
We describe a clustering algorithm based on continuous Hidden Markov Models (HMM) to automatically classify both electrocardiogram (ECG) and intracranial pressure (ICP) beats base...
Daniel Novák, Lenka Lhotská, David C...