2019Unpublished venueRequires access

One-dimensional Edge-preserving Spline Smoothing for Estimation of Piecewise Smooth Functions

Daichi Kitahara, Laurent Condat, Akira Hirabayashi

Open publisher page 3 citations

Abstract

Splines are piecewise polynomials and widely used for interpolation and smoothing of observed data, due to their flexibility and optimality in the sense of certain variational problems for one-dimensional (1D) data. However, spline interpolation and smoothing are applicable only to the estimation of continuous functions, and not suitable for that of piecewise smooth functions. In this paper, we propose a novel spline smoothing technique for the estimation of 1D piecewise smooth functions. We newly define the set of breaking splines, which are permitted to have several discontinuous knots. Then, we estimate a piecewise smooth function as a breaking spline minimizing the sum of the data fidelity term, the roughness penalty term, and the number of the discontinuous knots. Numerical experiments show the effectiveness of the breaking splines compared to the conventional splines and the state-of-the-art total generalized variation (TGV) denoising.

About this research paper

What this paper is about

Splines are piecewise polynomials and widely used for interpolation and smoothing of observed data, due to their flexibility and optimality in the sense of certain variational problems for one-dimensional (1D) data. However, spline interpolation and smoothing are applicable only to the estimation of continuous functions, and not suitable for that of piecewise smooth functions. In this paper, we propose a novel spline smoothing technique for the estimation of 1D piecewise smooth functions. We newly define the set of breaking splines, which are permitted to have several discontinuous knots. Then, we estimate a piecewise smooth function as a breaking spline minimizing the sum of the data fidelity term, the roughness penalty term, and the number of the discontinuous knots. Numerical experiments show the effectiveness of the breaking splines compared to the conventional splines and the state-of-the-art total generalized variation (TGV) denoising.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Splines are piecewise polynomials and widely used for interpolation and smoothing of observed data, due to their flexibility and optimality in the sense of certain variational problems for one-dimensional (1D) data. However, spline interpolation and smoothing are applicable only to the estimation of continuous functions, and not suitable for that of piecewise smooth functions. In this paper, we propose a novel spline smoothing technique for the estimation of 1D piecewise smooth functions. We newly define the set of breaking splines, which are permitted to have several discontinuous knots. Then, we estimate a piecewise smooth function as a breaking spline minimizing the sum of the data fidelity term, the roughness penalty term, and the number of the discontinuous knots. Numerical experiments show the effectiveness of the breaking splines compared to the conventional splines and the state-of-the-art total generalized variation (TGV) denoising.

Key concepts: Piecewise, Smoothing, Smoothing spline, Spline (mechanical), Mathematics, Box spline, Interpolation (computer graphics), Spline interpolation

Related papers

Back to paper searchBrowse research topicsOriginal source
One-dimensional Edge-preserving Spline Smoothing for Estimation of Piecewise Smooth Functions — Research Paper | ScholarLens