Loading [a11y]/accessibility-menu.js
The Desargues theorem to build matching graph for N images | IEEE Conference Publication | IEEE Xplore

The Desargues theorem to build matching graph for N images


Abstract:

In this paper, we propose a new approach for matching image points by exploiting minimal geometric knowledge and in a correspondenceless way. The idea underlying our appr...Show More

Abstract:

In this paper, we propose a new approach for matching image points by exploiting minimal geometric knowledge and in a correspondenceless way. The idea underlying our approach is to use a generalization of the Desargues theorem in images sequence context. This approach allows the matching image points over a sequence without using correlation techniques. The corresponding points are calculated directly using the Desargues invariants. Examples on real and synthetic images are presented. Results are illustrated and discussed.
Date of Conference: 01-03 December 2004
Date Added to IEEE Xplore: 13 June 2005
Print ISBN:0-7803-8645-0
Conference Location: Singapore

References

References is not available for this document.