Intrinsic spherical smoothing method based on generalized Bezier curves and sparsity inducing penalization

Citations

WEB OF SCIENCE

2
Citations

SCOPUS

2

초록

This study examines an intrinsic penalized smoothing method on the 2-sphere. We propose a method based on the spherical Bezier curves obtained using a generalized de Casteljau algorithm to provide a degree-based regularity constraint to the spherical smoothing problem. A smooth Bezier curve is found by minimizing the least squares criterion under the regularization constraint. The de Casteljau algorithm constructs higher-order Bezier curves in a recursive manner using linear Bezier curves. We introduce a local penalization scheme based on a penalty function that regularizes the velocity differences in consecutive linear Bezier curves. The imposed penalty induces sparsity on the control points so that the proposed method determines the number of control points, or equivalently the order of the Bezier curve, in a data-adaptive way. An efficient Riemannian block coordinate descent algorithm is devised to implement the proposed method. Numerical studies based on real and simulated data are provided to illustrate the performance and properties of the proposed method. The results show that the penalized Bezier curve adapts well to local data trends without compromising overall smoothness.

키워드

Curve fitting; de casteljau algorithm; generalized Bezier curve; Riemannian coordinate descent; sparsity; spherical data; SPLINES; REGRESSION
제목
Intrinsic spherical smoothing method based on generalized Bezier curves and sparsity inducing penalization
저자
Bak, Kwan-Young; Shin, Jae-Kyung; Koo, Ja-Yong
DOI
10.1080/02664763.2022.2054962
발행일
2023
유형
Article; Early Access
저널명
Journal of Applied Statistics
권
50
호
9
페이지
1942 ~ 1961