Geodesic distance evolution of surfaces: a new method for matching surfaces

The general problem of surface matching is considered in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in the graph of a cost function. The cost function represents the geometrical matching criterion between the two 3D surface...

Full description

Saved in:
Bibliographic Details
Main Authors: Yahia, H.M., Huot, E.G., Herlin, I.L., Cohen, I.
Format: Conference Proceeding
Language:English
Subjects:
Application software
Computer graphics
Computer vision
Cost function
Geometry
Image representation
Intelligent robots
Intelligent systems
Partial differential equations
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The general problem of surface matching is considered in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in the graph of a cost function. The cost function represents the geometrical matching criterion between the two 3D surfaces. This graph is a hypersurface in 4-dimensional space, and the theory presented herein is a generalization of the geodesic curve evolution method introduced by R. Kimmel et al. (1995). It also generalizes the 2D matching process developed in Cohen and Herlin (1998). An Eulerian level-set formulation of the geodesic surface evolution is also used, leading to a numerical scheme for solving partial differential equations originating from hyperbolic conservation laws, which has proven to be very robust and stable. The method is applied on examples showing both small and large deformations, and arbitrary topological changes.
ISSN:1063-6919
DOI:10.1109/CVPR.2000.855883