2403 search results - page 102 / 481 » Optimal Randomized RANSAC |
142
click to vote
ICIP
2003
IEEE
16 years 4 months ago
2003
IEEE
A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hyp...
124
click to vote
WSCG
2004
15 years 4 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
122
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
111
click to vote
RSA
2002
15 years 2 months ago
2002
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
141
click to vote
ICIP
2009
IEEE
15 years 27 days ago
2009
IEEE
The theory of compressed sensing tells a dramatic story that sparse signals can be reconstructed near-perfectly from a small number of random measurements. However, recent work ha...