Average-distance problem for parameterized curves

preprint2014arXivOpen access

Abstract

We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite positive compactly supported measure μμ, for p≥1p \geq 1 and λ>0λ>0 we consider the functional E(γ)=∫Rdd(x,Γγ)pdμ(x)+λ Length(γ) E(γ) = \int_{\mathbb{R}^d} d(x, Γ_γ)^p dμ(x) + λ\,\textrm{Length}(γ) where γ:I→Rdγ:I \to \mathbb{R}^d, II is an interval in R\mathbb{R}, Γγ=γ(I)Γ_γ= γ(I), and d(x,Γγ)d(x, Γ_γ) is the distance of xx to ΓγΓ_γ. The problem is closely related to the average-distance problem, where the admissible class are the connected sets of finite Hausdorff measure H1\mathcal H^1, and to (regularized) principal curves studied in statistics. We obtain regularity of minimizers in the form of estimates on the total curvature of the minimizers. We prove that for measures μμ supported in two dimensions the minimizing curve is injective if p≥2p \geq 2 or if μμ has bounded density. This establishes that the minimization over parameterized curves is equivalent to minimizing over embedded curves and thus confirms that the problem has a geometric interpretation.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.