Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
From MaRDI portal
Abstract: We propose a model for finding one-dimensional structure in a given measure. Our approach is based on minimizing an objective functional which combines the average-distance functional to measure the quality of the approximation and penalizes the curvature, similarly to the elastica functional. Introducing the curvature penalization overcomes some of the shortcomings of the average-distance functional, in particular the lack of regularity of minimizers. We establish existence, uniqueness and regularity of minimizers of the proposed functional. In particular we establish estimates on the minimizers.
Recommendations
- Average-distance problem for parameterized curves
- Regularity of densities in relaxed and penalized average distance problem
- Counterexample to regularity in average-distance problem
- More counterexamples to regularity for minimizers of the average-distance problem
- The average-distance problem with an Euler elastica penalization
Cites work
- 10.1162/15324430152748227
- A phase field formulation of the Willmore problem
- A phase field model for the optimization of the Willmore energy in the class of connected surfaces
- A practical guide to splines.
- About the regularity of average distance minimizers in \(\mathbb R^{2}\)
- Another look at principal curves and surfaces
- Average-distance problem for parameterized curves
- Counterexample to regularity in average-distance problem
- Example of minimizer of the average-distance problem with non closed set of corners
- Hamilton-Jacobi equations and distance functions on Riemannian manifolds
- scientific article; zbMATH DE number 6377991 (Why is no real title available?)
- scientific article; zbMATH DE number 1996419 (Why is no real title available?)
- scientific article; zbMATH DE number 2159262 (Why is no real title available?)
- scientific article; zbMATH DE number 850150 (Why is no real title available?)
- Locally defined principal curves and surfaces
- Methodus inveniendi lineas curvas maximi minimive proprietate gaudentes, sive solutio problematis isoperimetrici lattissimo sensu accepti
- Multiple penalized principal curves: analysis and computation
- On principal curves with a length constraint
- Optimal Pricing Policies for Public Transportation Networks
- Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
- Optimal urban networks via mass transportation
- Parameter Selection for Principal Curves
- Principal Curves
- Properties of minimizers of average-distance problem via discrete approximation of measures
- Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rn
- Regularization of discrete contour by Willmore energy
- Stationary configurations for the average distance functional and related problems
- The Lazy Travelling Salesman Problem in $\mathbb{R}^2$
Cited in
(5)
This page was built for publication: Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999510)
