By Topic

Geodesic matching of triangulated surfaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hamza, A.B. ; Concordia Inst. for Inf. Syst. Eng., Montreal, Que. ; Krim, H.

Recognition of images and shapes has long been the central theme of computer vision. Its importance is increasing rapidly in the field of computer graphics and multimedia communication because it is difficult to process information efficiently without its recognition. In this paper, we propose a new approach for object matching based on a global geodesic measure. The key idea behind our methodology is to represent an object by a probabilistic shape descriptor that measures the global geodesic distance between two arbitrary points on the surface of an object. In contrast to the Euclidean distance which is more suitable for linear spaces, the geodesic distance has the advantage to be able to capture the intrinsic geometric structure of the data. The matching task therefore becomes a one-dimensional comparison problem between probability distributions which is clearly much simpler than comparing three-dimensional structures. Object matching can then be carried out by an information-theoretic dissimilarity measure calculations between geodesic shape distributions, and is additionally computationally efficient and inexpensive

Published in:

Image Processing, IEEE Transactions on  (Volume:15 ,  Issue: 8 )