Sciweavers

89 search results - page 3 / 18
» An approximate Minimum MOSPA estimator
Sort
View
ICPR
2000
IEEE
14 years 8 months ago
Evaluation of Curve Length Measurements
This paper compares two techniques for measuring the length of a digital curve. Both techniques (digital straight segment approximation, minimum length polygon) are known to be co...
Reinhard Klette, Ben Yip
DGCI
2009
Springer
13 years 10 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud
TASLP
2010
122views more  TASLP 2010»
13 years 2 months ago
Error Approximation and Minimum Phone Error Acoustic Model Estimation
Minimum phone error (MPE) acoustic parameter estimation involves calculation of edit distances (errors) between correct and incorrect hypotheses. In the context of large vocabulary...
Matt Gibson 0002, Thomas Hain
CVPR
1998
IEEE
14 years 9 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICML
2002
IEEE
14 years 8 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison