Statistical methods for descriptor matching

Olivier Collier 1, 2
2 IMAGINE [Marne-la-Vallée]
LIGM - Laboratoire d'Informatique Gaspard-Monge, CSTB - Centre Scientifique et Technique du Bâtiment, ENPC - École des Ponts ParisTech
Abstract : Many applications, as in computer vision or medicine, aim at identifying the similarities between several images or signals. There after, it is possible to detect objects, to follow them, or to overlap different pictures. In every case, the algorithmic procedures that treat the images use a selection of key points that they try to match by pairs. The most popular algorithm nowadays is SIFT, that performs key point selection, descriptor calculation, and provides a criterion for global descriptor matching. In the first part, we aim at improving this procedure by changing the original descriptor, that requires to find the argument of the maximum of a histogram: its computation is indeed statistically unstable. So we also have to change the criterion to match two descriptors. This yields a nonparametric hypothesis testing problem, in which both the null and the alternative hypotheses are composite, even nonparametric. We use the generalized likelihood ratio test to get consistent testing procedures, and carry out a minimax study. In the second part, we are interested in the optimality of the procedure of global matching. We give a statistical model in which some descriptors are present in a given order in a first image, and in another order in a second image. Descriptor matching is equivalent in this case to the estimation of a permutation. We give an optimality criterion for the estimators in the minimax sense. In particular, we use the likelihood to find several consistent estimators, which are even optimal under some conditions. Finally, we tackled some practical aspects and showed that our estimators are computable in reasonable time, so that we could then illustrate the hierarchy of our estimators by some simulations
Document type :
Complete list of metadatas

Cited literature [63 references]  Display  Hide  Download
Contributor : Abes Star <>
Submitted on : Thursday, March 20, 2014 - 2:27:12 PM
Last modification on : Thursday, February 21, 2019 - 1:04:49 AM
Long-term archiving on : Friday, June 20, 2014 - 11:25:11 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00904686, version 2


Olivier Collier. Statistical methods for descriptor matching. General Mathematics [math.GM]. Université Paris-Est, 2013. English. ⟨NNT : 2013PEST1080⟩. ⟨tel-00904686v2⟩



Record views


Files downloads