Derivatives with respect to metrics and applications: Subgradient Marching Algorithm - Archive ouverte HAL Access content directly
Journal Articles Numerische Mathematik Year : 2010

Derivatives with respect to metrics and applications: Subgradient Marching Algorithm

(1) , (1) , (1) , (1)
1

Abstract

This paper describes the Subgradient Marching algorithm to compute the derivative of the geodesic distance with respect to the metric. The geodesic distance being a concave function of the metric, this algorithm computes an element of the subgradient in O(N2 log(N)) operations on a discrete grid of N points. It performs a front propagation that computes the subgradient of a discrete geodesic distance. Equipped with this Subgradient Marching, a Riemannian metric can be designed through an optimization process. We show applications to landscape modeling and to traffic congestion. Both applications require the maximization of geodesic distances under convex constraints, and are solved by subgradient descent computed with our Subgradient Marching. We also show application to the inversion of travel time tomography, where the recovered metric is the local minimum of a non-convex variational problem involving geodesic distances
Fichier principal
Vignette du fichier
SubGradientMarching.pdf (393.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00360971 , version 1 (12-02-2009)

Identifiers

  • HAL Id : hal-00360971 , version 1

Cite

Fethallah Benmansour, Guillaume Carlier, Gabriel Peyré, Filippo Santambrogio. Derivatives with respect to metrics and applications: Subgradient Marching Algorithm. Numerische Mathematik, 2010, 116 (3), pp.357-381. ⟨hal-00360971⟩
131 View
90 Download

Share

Gmail Facebook Twitter LinkedIn More