A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-controllable probability n. A provably optimal model verification strategy is designed for the situation when the contamination of data by outliers is known, i.e. the algorithm is the fastest possible (on average) of all randomized RANSAC algorithms guaranteeing 1 - n confidence in the solution. The derivation of the optimality property is based on Wald's theory of sequential decision making. The R-RANSAC with SPRT which does not require the a priori knowledge of the fraction of outliers and has results close to the optimal strategy is introduced. We show experimentally that on standard test data the method is 2 to 10 times faster than the standard RANSAC and up to 4 times faster than previously published methods.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Randomized RANSAC with sequential probability ratio test


    Contributors:
    Matas, J. (author) / Chum, O. (author)


    Publication date :

    2005-01-01


    Size :

    598311 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Randomized RANSAC with Sequential Probability Ratio Test

    Matas, J. / Chum, O. / IEEE | British Library Conference Proceedings | 2005


    Randomized RANSAC with Td,d test

    Matas, J. / Chum, O. | British Library Online Contents | 2004



    Demonstrating system reliability by sequential probability ratio test

    Tiger, B. / Brewington, W.H. | Engineering Index Backfile | 1957


    TYPED DIGITS RECOGNITION USING SEQUENTIAL PROBABILITY RATIO TEST

    Volodymyr Kharchenko / Iurii Chyrka | DOAJ | 2018

    Free access