Geodesic matching of triangulated surfaces

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