Smoothing Splines for Discontinuous Signals

Smoothing splines are twice differentiable by construction, so they cannot capture potential discontinuities in the underlying signal. In this work, we consider a special case of the weak rod model of Blake and Zisserman that allows for discontinuities penalizing their number by a linear term. The c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational and graphical statistics Jg. 33; H. 2; S. 651 - 664
Hauptverfasser: Storath, Martin, Weinmann, Andreas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Alexandria Taylor & Francis 02.04.2024
Taylor & Francis Ltd
Schlagworte:
Algorithms
Convexity
Data analysis
Data points
Discontinuity
Estimates
Nonparametric regression
Numerical optimization
Penalized optimization
Sampled data
Signal processing
Smoothing
Solvers
ISSN:1061-8600, 1537-2715
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Smoothing splines are twice differentiable by construction, so they cannot capture potential discontinuities in the underlying signal. In this work, we consider a special case of the weak rod model of Blake and Zisserman that allows for discontinuities penalizing their number by a linear term. The corresponding estimates are cubic smoothing splines with discontinuities (CSSD) which serve as representations of piecewise smooth signals and facilitate exploratory data analysis. However, computing the estimates requires solving a non-convex optimization problem. So far, efficient and exact solvers exist only for a discrete approximation based on equidistantly sampled data. In this work, we propose an efficient solver for the continuous minimization problem with non-equidistantly sampled data. Its worst case complexity is quadratic in the number of data points, and if the number of detected discontinuities scales linearly with the signal length, we observe linear growth in runtime. This efficient algorithm allows to use cross-validation for automatic selection of the hyperparameters within a reasonable time frame on standard hardware. We provide a reference implementation and supplementary material . We demonstrate the applicability of the approach for the aforementioned tasks using both simulated and real data. Supplementary materials for this article are available online.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1061-8600
1537-2715
DOI:10.1080/10618600.2023.2262000