Two strategies for sparse data interpolation
نویسنده
چکیده
I introduce two strategies to overcome the slow convergence of least squares sparse data interpolation: 1) a 2-D multiscale Laplacian regularization operator, and 2) an explicit quadtree-style upsampling scheme which produces a good initial guess for iterative schemes. The multiscale regularization produces an order-of-magnitude speedup in the interpolation of a sparsely sampled topographical map. The quadtree method produces an initial guess which leads to similar speedups for iterative methods.
منابع مشابه
Racecar Tracking and its Visualization Using Sparse Data
In motorsports there are typically long race tracks with the result that the racecars’ positions can not be surveyed easily. Professional motorsports series – such as the famous Formula 1 – introduced car tracking visualizations where the position of each participant is displayed on a virtual map. In contrast to professional motorsports series, in amateur motorsports dense data, which is crucia...
متن کاملEnhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates
In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these ...
متن کاملGeologic Storage of CO2
Dynamic imaging provides an effective way to integrate previous time-lapse data with current data in order to estimate a current model. We present two methods useful for continuous dynamic reservoir and subsurface monitoring. The first method is a stochastic method for the inversion of geophysical data. It uses the ensemble Kalman filter (EnKF) that we demonstrate using time-lapse surface seism...
متن کاملLIST OF ABSTRACTS Optimal Polynomial Interpolation of High-dimensional Functions [M-13A]
Many problems in scientific computing require the approximation of smooth, high-dimensional functions from limited amounts of data. In sufficiently high dimensions, such functions are known to possess sparse expansions in suitable orthogonal polynomial bases. Hence, it is natural to seek to apply techniques from compressed sensing to approximate such functions from small amounts of data. In thi...
متن کاملInterferometric Interpolation of 3D OBS Data
I extend the interferometric interpolation of ocean bottom seismic (OBS) data from two dimensional data to 3D data. The sparse OBS data are interferometrically correlated with the model-based Green’s functions for the sea-floor model to generate the densely recorded OBS traces, and a local matching filter is applied to reduce the artifacts in the interpolated data. Information about the source ...
متن کامل