Sciweavers

1120 search results - page 145 / 224
» Eager Markov Chains
Sort
View
SAC
2008
ACM
14 years 11 months ago
Particle methods for maximum likelihood estimation in latent variable models
Standard methods for maximum likelihood parameter estimation in latent variable models rely on the Expectation-Maximization algorithm and its Monte Carlo variants. Our approach is ...
Adam M. Johansen, Arnaud Doucet, Manuel Davy
CVPR
2009
IEEE
1216views Computer Vision» more  CVPR 2009»
16 years 6 months ago
Marked Point Processes for Crowd Counting
A Bayesian marked point process (MPP) model is developed to detect and count people in crowded scenes. The model couples a spatial stochastic process governing number and placem...
Robert T. Collins, Weina Ge
CORR
2008
Springer
111views Education» more  CORR 2008»
14 years 10 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth
ICST
2010
IEEE
14 years 10 months ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...
ICIP
2010
IEEE
14 years 9 months ago
Instrument parameter estimation in bayesian convex deconvolution
This paper proposes a Bayesian approach for estimation of instrument parameter in convex image deconvolution. The parameters of the instrument response (PSF) are jointly estimated...
François Orieux, Thomas Rodet, Jean-Fran&cc...