Average-distance problem for parameterized curves

From MaRDI portal
Publication:2808050




Abstract: We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite positive compactly supported measure mu, for pgeq1 and lambda>0 we consider the functional [ E(gamma) = int_{mathbb{R}^d} d(x, Gamma_gamma)^p dmu(x) + lambda , extrm{Length}(gamma) ] where gamma:IomathbbRd, I is an interval in mathbbR, Gammagamma=gamma(I), and d(x,Gammagamma) is the distance of x to Gammagamma. The problem is closely related to the average-distance problem, where the admissible class are the connected sets of finite Hausdorff measure mathcalH1, 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 mu supported in two dimensions the minimizing curve is injective if pgeq2 or if mu 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.









This page was built for publication: Average-distance problem for parameterized curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808050)