A general surface matching model: application to ground evolution tracking

Tackles the general problem of surface tracking. The authors present a new method based on the computation of geodesic distance maps between a source and a destination surface. The method used in this case is a generalization to the case of surfaces of a 2D matching process introduced by Cohen and Herlin (1998). It relies on a level-set formulation, thus providing stable and robust resolution schemes. The obtained matching method accommodates both small and large deformations. Actually, the matching constraints are explicitly expressed by the definition of a hypersurface. The connecting paths between the two surfaces lie on this hypersurface. The authors construct a hypersurface that allows the matching process to preserve geometric similarities in the case of small deformations, and loosen these geometric constraints when large deformations occur. The applicative framework is the study of the Earth's crustal evolution to characterize the deformation of digital elevation models.

[1]  R. Abraham,et al.  Manifolds, Tensor Analysis, and Applications , 1983 .

[2]  Isabelle Herlin,et al.  Curves matching using geodesic paths , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[3]  Isabelle Herlin,et al.  Segmentation of temporal effects on phasimetric SAR images , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[4]  D. Massonnet,et al.  Deflation of Mount Etna monitored by spaceborne radar interferometry , 1995, Nature.

[5]  Alfred M. Bruckstein,et al.  Finding Shortest Paths on Surfaces Using Level Sets Propagation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[7]  M. Gage,et al.  The Curve Shortening Flow , 1987 .

[8]  P. Danielsson Euclidean distance mapping , 1980 .