2000
DOI: 10.1007/3-540-45053-x_52
|View full text |Cite
|
Sign up to set email alerts
|

IMPSAC: Synthesis of Importance Sampling and Random Sample Consensus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0
2

Year Published

2002
2002
2018
2018

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(25 citation statements)
references
References 16 publications
0
23
0
2
Order By: Relevance
“…Using these values, there are four potential sets of change-points to evaluate at the third step. However, the change from P ðS 1 0 j0; 2Þ to P ðS 2 0 j0; 2; 3Þ is the same as that from P ðS 1 0 j0; 1; 2Þ to P ðS 2 0 j0; 1; 2; 3Þ since by (15), the probability of the sequence after a change-point at 2 is independent of the sequence before it. Hence the most probable of P ðS 1 0 j0; 2Þ and P ðS 1 0 j0; 1; 2Þ will lead to the most probable of P ðS 2 0 j0; 2; 3Þ and P ðS 2 0 j0; 1; 2; 3Þ.…”
Section: Finding Texture Change-points In a 1d Line Searchmentioning
confidence: 84%
See 1 more Smart Citation
“…Using these values, there are four potential sets of change-points to evaluate at the third step. However, the change from P ðS 1 0 j0; 2Þ to P ðS 2 0 j0; 2; 3Þ is the same as that from P ðS 1 0 j0; 1; 2Þ to P ðS 2 0 j0; 1; 2; 3Þ since by (15), the probability of the sequence after a change-point at 2 is independent of the sequence before it. Hence the most probable of P ðS 1 0 j0; 2Þ and P ðS 1 0 j0; 1; 2Þ will lead to the most probable of P ðS 2 0 j0; 2; 3Þ and P ðS 2 0 j0; 1; 2; 3Þ.…”
Section: Finding Texture Change-points In a 1d Line Searchmentioning
confidence: 84%
“…In [12], the multi-modal representation used is a piecewise combination of Gaussian distributions and is used to track rapidly moving human figures, while in [13] image corners are used with a discrete, tree-like, representation of the multiple hypotheses. RANSAC [14] based approaches have also been used [5] and numerous extensions to ransac have been proposed, in particular the idea of using RANSAC to initalise a set of particles is employed by [15] as part of a structure from motion system.…”
Section: Previous Workmentioning
confidence: 99%
“…Sullivan et al showed in [25] that, random particles can be guided by a variational search, with good convergence when the image differences between frames are low. They used a predefined threshold to switch between the probabilistic and deterministic tracking engines.…”
Section: Related Workmentioning
confidence: 98%
“…Several methods use sampling of multiple minimum-size sets to estimate common underlying parameters, and find out which elements should be discarded. Among them there are RANSAC [18], MLESAC [19], and IMPSAC [20]. M-estimators look for optimum weighting of each element, instead of just trying to discard outliers [21][22][23].…”
Section: Related Workmentioning
confidence: 99%