1981
DOI: 10.1145/358669.358692
|View full text |Cite
|
Sign up to set email alerts
|

Random sample consensus

Abstract: Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
1,056
0
18

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 19,679 publications
(1,120 citation statements)
references
References 1 publication
1
1,056
0
18
Order By: Relevance
“…Nishida and Kurita (2008) proposed a hybrid algorithm (RANSAC-SVM) which couples random sampling, consensus approach (Fischler and Bolles 1981) and a simple evolutionary technique to retrieve T 's. In their approach, several refined training sets of a small size are randomly drawn at first.…”
Section: Evolutionary Methodsmentioning
confidence: 99%
“…Nishida and Kurita (2008) proposed a hybrid algorithm (RANSAC-SVM) which couples random sampling, consensus approach (Fischler and Bolles 1981) and a simple evolutionary technique to retrieve T 's. In their approach, several refined training sets of a small size are randomly drawn at first.…”
Section: Evolutionary Methodsmentioning
confidence: 99%
“…For comparative analysis, precision and putative match ratio [17] were used. Precision of matching has a practical significance, since all returned pairs often undergo further processing, e.g., using RANSAC [30]. Putative match ratio (PMR) counts how many detected keypoints were returned as matched.…”
Section: Discussionmentioning
confidence: 99%
“…It can be seen, the obtained mean values are promising, and the results are characterised by small standard deviations. The best result (F C (x best ) = 2119.1) was obtained for the set of P = 12 patches with the following multipliers S p = [7,10,16,19,23,28,30,34,44,56,69,89]. This gives the descriptor with 1296 bits.…”
Section: Optimisationmentioning
confidence: 99%
“…Among the algorithms that can be used for tracking objects with simple geometries, two are widely known, namely the Hough transform [46] and the RANSAC paradigm [47]. In the prototype application presented here, the RANSAC approach is used for shape detection.…”
Section: Methodology Of Kinect-based Trackingmentioning
confidence: 99%