In the previous chapter two shortcomings of Lowe's SIFT algorithm have been pointed out, namely its low matching efficiency (ratio between the number of correct matches and the total number of matches) and its inability to match several instances of the same object. The grouping stage of the method also is widely empirical and requires some fix.
In this chapter we shall examine three easy improvements of the SIFT method, all based on the a contrario techniques developed in the present book. They permit to treat all raised issues. The first one (Sect. 11.1) is the direct application of the theory for a contrario grouping of transformations developed in Chap. 8. The second one (Sect. 11.2) is the use of a background model for SIFT matches which prevents the elimination of multiple matches. Finally Sect. 11.4 yields an efficient a contrario technique computing a NFA for each SIFT match. In summary, the aim is to demonstrate that the whole SIFT algorithm can be secured and associated realistic NFAs, as we did in Chap. 5 and 8 for the LLD method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Securing SIFT with A Contrario Techniques. In: A Theory of Shape Identification. Lecture Notes in Mathematics, vol 1948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68481-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-68481-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68480-0
Online ISBN: 978-3-540-68481-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)