Shape Analysis of Functional Data with Elastic Partial Matching
Not on the map. Why?
Abstract (arXiv)
Elastic Riemannian metrics have been used successfully in the past for statistical treatments of functional and curve shape data. However, this usage has suffered from an important restriction: the function boundaries are assumed fixed and matched. Functional data exhibiting unmatched boundaries typically arise from dynamical systems with variable evolution rates such as COVID-19 infection rate curves associated with different geographical regions. In this case, it is more natural to model such data with sliding boundaries and use partial matching, i.e., only a part of a function is matched to another function. Here, we develop a comprehensive Riemannian framework that allows for partial matching, comparing, and clustering of functions under both phase variability and uncertain boundaries. We extend past work by: (1) Forming a joint action of the time-warping and time-scaling groups; (2) Introducing a metric that is invariant to this joint action, allowing for a gradient-based approach to elastic partial matching; and (3) Presenting a modification that, while losing the metric property, allows one to control relative influence of the two groups. This framework is illustrated for registering and clustering shapes of COVID-19 rate curves, identifying essential patterns, minimizing mismatch errors, and reducing variability within clusters compared to previous methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 4 of its 38 references that are in the map. First posted on arXiv 18 May 2021.
Builds on
4 of 38 references.
References · 4
- 2015Functional Data Analysis of Amplitude and Phase Variationcited by 16
- 2016Elastic Functional Coding of Riemannian Trajectoriescited by 2
- 2015Bayesian Clustering of Shapes of Curvescited by 1
- 2016Combined Analysis of Amplitude and Phase Variations in Functional Datacited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
3 papers.