Correctness and robustness of 3D rigid matching with bounded sensor error - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1993

Correctness and robustness of 3D rigid matching with bounded sensor error

Xavier Pennec

Abstract

We present in this paper a precise study of alignment and geometric hashing for the recognition of 3D rigid objects in the presence of uncertainty. Given a bounded error on point features, we propagate it through the computations to determine the translation and rotation error. This allows the computation of the compatibility zone, either in the image or in the hash table, to insure the correctness of the algorithm, i.e. the absence of false negatives. This work is presented for the least squaresand a basis definition methods. We show the equivalence of these two methods and point out the accuracy of the compatibility zones. We also study the robustness of the algnment algorithm in computing the mean number of hyoptheses and false positives with uniform random models and scene. Experiments confirm our analysis. This theoretical study has important practical applications : in volume medical images analysis, we show that for typical situations, an alignment scheme can achieve 3D registration for an occlusion ratio as large as 80% with a negligible risk of false (lower than 10-5).

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2111.pdf (566.13 Ko) Télécharger le fichier

Dates and versions

inria-00074561 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074561 , version 1

Cite

Xavier Pennec. Correctness and robustness of 3D rigid matching with bounded sensor error. RR-2111, INRIA. 1993. ⟨inria-00074561⟩
125 View
92 Download

Share

Gmail Facebook Twitter LinkedIn More