Smoothing for signals with discontinuities using higher order Mumford-Shah models
Minimizing the Mumford-Shah functional is frequently used for smoothing signals or time series with discontinuities. A significant limitation of the standard Mumford-Shah model is that linear trends—and in general polynomial trends—in the data are not well preserved. This can be improved by building...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
4 July 2019
|
| In: |
Numerische Mathematik
Year: 2019, Volume: 143, Issue: 2, Pages: 423-460 |
| ISSN: | 0945-3245 |
| DOI: | 10.1007/s00211-019-01052-8 |
| Online Access: | Verlag, Volltext: https://doi.org/10.1007/s00211-019-01052-8
|
| Author Notes: | Martin Storath, Lukas Kiefer, Andreas Weinmann |
| Summary: | Minimizing the Mumford-Shah functional is frequently used for smoothing signals or time series with discontinuities. A significant limitation of the standard Mumford-Shah model is that linear trends—and in general polynomial trends—in the data are not well preserved. This can be improved by building on splines of higher order which leads to higher order Mumford-Shah models. In this work, we study these models in the univariate situation: we discuss important differences to the first order Mumford-Shah model, and we obtain uniqueness results for their solutions. As a main contribution, we derive fast minimization algorithms for Mumford-Shah models of arbitrary orders. We show that the worst case complexity of all proposed schemes is quadratic in the length of the signal. Remarkably, they thus achieve the worst case complexity of the fastest solver for the piecewise constant Mumford-Shah model (which is the simplest model of the class). Further, we obtain stability results for the proposed algorithms. We complement these results with a numerical study. Our reference implementation processes signals with more than 10,000 elements in less than 1 s. |
|---|---|
| Item Description: | Gesehen am 10.12.2019 |
| Physical Description: | Online Resource |
| ISSN: | 0945-3245 |
| DOI: | 10.1007/s00211-019-01052-8 |