Sciweavers

2403 search results - page 77 / 481
» Optimal Randomized RANSAC
Sort
View
IJSN
2007
73views more  IJSN 2007»
15 years 2 months ago
Optimal worm-scanning method using vulnerable-host distributions
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
Zesheng Chen, Chuanyi Ji
MICCAI
2005
Springer
16 years 3 months ago
Cross Entropy: A New Solver for Markov Random Field Modeling and Applications to Medical Image Segmentation
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
Jue Wu, Albert C. S. Chung
ICML
2006
IEEE
16 years 3 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
DCC
2010
IEEE
15 years 10 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
FGR
2008
IEEE
346views Biometrics» more  FGR 2008»
15 years 9 months ago
Markov random field models for hair and face segmentation
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
Kuang-chih Lee, Dragomir Anguelov, Baris Sumengen,...