Shape-Driven Interpolation With Discontinuous Kernels: Error Analysis, Edge Extraction, and Applications in Magnetic Particle Imaging

Accurate interpolation and approximation techniques for functions with discontinuities are key tools in many applications, such as medical imaging. In this paper, we study a radial basis function type of method for scattered data interpolation that incorporates discontinuities via a variable scaling function. For the construction of the discontinuous basis of kernel functions, information on the edges of the interpolated function is necessary. We characterize the native space spanned by these kernel functions and study error bounds in terms of the fill distance of the node set. To extract the location of the discontinuities, we use a segmentation method based on a classification algorithm from machine learning. The results of the conducted numerical experiments are in line with the theoretically derived convergence rates in case that the discontinuities are a priori known. Further, an application to interpolation in magnetic particle imaging shows that the presented method is very promising in order to obtain edge-preserving image reconstructions in which ringing artifacts are reduced

Use of Anisotropic Radial Basis Functions

학위논문(박사) -- 서울대학교대학원 : 자연과학대학 통계학과, 2021.8. 오희석.Spatial inhomogeneity along the one-dimensional curve makes two-dimensional data non-stationary. Curvelet transform, first proposed by Candes and Donoho (1999), is one of the most well-known multiscale methods to represent the directional singularity, but it has a limitation in that the data needs to be observed on equally-spaced sites. On the other hand, radial basis function interpolation is widely used to approximate the underlying function from the scattered data. However, the isotropy of the radial basis functions lowers the efficiency of the directional representation. This thesis proposes a new multiscale method that uses anisotropic radial basis functions to efficiently represent the direction from the noisy scattered data in two-dimensional Euclidean space. Basis functions are orthogonalized across the scales so that each scale can represent a global or local directional structure separately. It is shown that the proposed method is remarkable for representing directional scattered data through numerical experiments. Convergence property and practical issues in implementation are discussed as well.2차원 공간에서 관측되는 비정상 자료는 그 공간적 비동질성이 1차원 곡선을 따라 나타난다. 이러한 방향적 특이성을 표현하기 위한 다중척도 방법론으로는 Candes and Donoho (1999)가 처음 제시한 커브렛 변환이 널리 알려져 있지만 이는 자료가 일정한 간격으로 관측되어야 한다는 제약이 있다. 한편 산재된 자료에 내재된 함수를 근사하기 위해서는 방사기저함수를 이용한 내삽법이 흔히 이용되지만 등방성이 있는 방사기저함수로는 방향성을 효율적으로 표현할 수 없다. 본 학위논문에서는 2차원 유클리드 공간에서 잡음과 함께 산재되어 관측되는 방향성 자료의 효율적인 표현을 위해 비등방성 방사기저함수를 이용한 새로운 다중척도 방법론을 제안한다. 이때 각 스케일에서 전반적인 방향성 구조와 국소적인 방향성 구조를 분리하여 표현하기 위해 기저함수의 스케일 간 직교화가 이루어진다. 제안된 방법이 산재된 방향성 자료를 표현하는 데 있어 우수함을 보이기 위해 모의실험과 실제 자료에 대한 수치실험을 한 결과를 제시하였다. 한편 제안된 방법의 수렴성과 실제 구현 방법에 관한 사안들도 다루었다.1 Introduction 1 2 Multiscale Analysis 4 2.1 Classical wavelet transform 5 2.1.1 Continuous wavelet transform 5 2.1.2 Multiresolution analysis 7 2.1.3 Discrete wavelet transform 10 2.1.4 Two-dimensional wavelet transform 13 2.2 Wavelets for equally-spaced directional data 14 2.2.1 Ridgelets 15 2.2.2 Curvelets 16 2.3 Wavelets for scattered data 19 2.3.1 Lifting scheme 21 2.3.2 Spherical wavelets 23 3 Radial Basis Function Approximation 26 3.1 Radial basis function interpolation 27 3.1.1 Radial basis functions and scattered data interpolation 27 3.1.2 Compactly supported radial basis functions 29 3.1.3 Error bounds 32 3.2 Multiscale representation with radial basis functions 35 3.2.1 Multiscale approximation 35 3.2.2 Error bounds 37 4 Multiscale Representation of Directional Scattered Data 41 4.1 Anisotropic radial basis function approximation 41 4.1.1 Representation of a single linear directional structure 42 4.1.2 Representation of complex directional structure 46 4.1.3 Multiscale representation of the directional structure 46 4.2 Directional wavelets for scattered data 47 4.2.1 Directional wavelets 48 4.2.2 Estimation of coefficients 49 4.2.3 Practical issues in implementation 50 5 Numerical Experiments 57 5.1 Simulation study 57 5.1.1 Scattered observation sites 60 5.1.2 Equally-spaced observation sites 69 5.2 Real data analysis 70 5.2.1 Temperature data in South Korea 70 6 Concluding Remarks 74 6.1 Summary of results 74 6.2 Future research 74 Abstract (in Korean) 82박

Monotonicity preserving approximation of multivariate scattered data

This paper describes a new method of monotone interpolation and smoothing of multivariate scattered data. It is based on the assumption that the function to be approximated is Lipschitz continuous. The method provides the optimal approximation in the worst case scenario and tight error bounds. Smoothing of noisy data subject to monotonicity constraints is converted into a quadratic programming problem. Estimation of the unknown Lipschitz constant from the data by sample splitting and cross-validation is described. Extension of the method for locally Lipschitz functions is presented.<br /

Error bound for radial basis interpolation in terms of a growth function

We suggest an improvement of Wu-Schaback local error bound for radial basis interpolation by using a polynomial growth function. The new bound is valid without any assumptions about the density of the interpolation centers. It can be useful for the localized methods of scattered data fitting and for the meshless discretization of partial differential equation

Local RBF approximation for scattered data fitting with bivariate splines

In this paper we continue our earlier research [4] aimed at developing effcient methods of local approximation suitable for the first stage of a spline based two-stage scattered data fitting algorithm. As an improvement to the pure polynomial local approximation method used in [5], a hybrid polynomial/radial basis scheme was considered in [4], where the local knot locations for the RBF terms were selected using a greedy knot insertion algorithm. In this paper standard radial local approximations based on interpolation or least squares are considered and a faster procedure is used for knot selection, signicantly reducing the computational cost of the method. Error analysis of the method and numerical results illustrating its performance are given

Extending the range of error estimates for radial approximation in Euclidean space and on spheres

We adapt Schaback's error doubling trick [R. Schaback. Improved error bounds for scattered data interpolation by radial basis functions. Math. Comp., 68(225):201--216, 1999.] to give error estimates for radial interpolation of functions with smoothness lying (in some sense) between that of the usual native space and the subspace with double the smoothness. We do this for both bounded subsets of R^d and spheres. As a step on the way to our ultimate goal we also show convergence of pseudoderivatives of the interpolation error.Comment: 10 page

Scattered Data Interpolation on Embedded Submanifolds with Restricted Positive Definite Kernels: Sobolev Error Estimates

In this paper we investigate the approximation properties of kernel interpolants on manifolds. The kernels we consider will be obtained by the restriction of positive definite kernels on $\R^d$, such as radial basis functions (RBFs), to a smooth, compact embedded submanifold \M\subset \R^d. For restricted kernels having finite smoothness, we provide a complete characterization of the native space on \M. After this and some preliminary setup, we present Sobolev-type error estimates for the interpolation problem. Numerical results verifying the theory are also presented for a one-dimensional curve embedded in $\R^3$ and a two-dimensional torus

On Prediction Properties of Kriging: Uniform Error Bounds and Robustness

Kriging based on Gaussian random fields is widely used in reconstructing unknown functions. The kriging method has pointwise predictive distributions which are computationally simple. However, in many applications one would like to predict for a range of untried points simultaneously. In this work we obtain some error bounds for the (simple) kriging predictor under the uniform metric. It works for a scattered set of input points in an arbitrary dimension, and also covers the case where the covariance function of the Gaussian process is misspecified. These results lead to a better understanding of the rate of convergence of kriging under the Gaussian or the Mat\'ern correlation functions, the relationship between space-filling designs and kriging models, and the robustness of the Mat\'ern correlation functions