Scattered Data Interpolation with Multilevel B-Splines

@article{Lee1997ScatteredDI,
  title={Scattered Data Interpolation with Multilevel B-Splines},
  author={Seungyong Lee and George Wolberg and Sung-yong Shin},
  journal={IEEE Trans. Vis. Comput. Graph.},
  year={1997},
  volume={3},
  pages={228-244}
}
The paper describes a fast algorithm for scattered data interpolation and approximation. Multilevel B-splines are introduced to compute a C/sup 2/ continuous surface through a set of irregularly spaced points. The algorithm makes use of a coarse to fine hierarchy of control lattices to generate a sequence of bicubic B-spline functions whose sum approaches the desired interpolation function. Large performance gains are realized by using B-spline refinement to reduce the sum of these functions… 

Quasi-interpolants Based Multilevel B-Spline Surface Reconstruction from Scattered Data

A new fast and local method of 3D surface reconstruction for scattered data that makes use of quasi-interpolants to compute the control points from a coarse to fine hierarchy to generate a sequence of bicubic B-spline functions whose sum approaches to the desired interpolation function.

Adaptive hierarchical b-spline surface approximation of large-scale scattered data

  • Weiqiang ZhangZesheng TangJie Li
  • Computer Science
    Proceedings Pacific Graphics '98. Sixth Pacific Conference on Computer Graphics and Applications (Cat. No.98EX208)
  • 1998
A fast algorithm for large scale scattered data approximation that exploits a coarse-to-fine hierarchical control lattice to fit the scattered data to ensure the C/sup 2/-continuity of the resulting surfaces is described.

Scattered Data Fitting with Bivariate Splines

  • Frank Zeilfelder
  • Mathematics, Computer Science
    Tutorials on Multiresolution in Geometric Modelling
  • 2002
This work describes scattered data fitting by bivariate splines, i.e., splines defined w.r.t. triangulations in the plane, and describes interpolation and approximation methods for bivariatesplines that have been developed recently.

BSPLND, A B-Spline N-Dimensional Package for Scattered Data Interpolation

BSPLND is a software package that produces a C-continuous interpolation function for any set of scattered data using a hierarchical set of cubic B-splines and extends the technique to work with data having an arbitrary number of dimensions for both its domain and range.

Key-Point Interpolation: A Sparse Data Interpolation Algorithm based on B-splines

A novel B-spline surface interpolation algorithm: KPI, which can interpolate sparsely and non-uniformly distributed data points, and uses the proposed KPI (Key-Point Interpolation) method to generate the control points.

Nonuniform image reconstruction using multilevel surface interpolation

  • G. Wolberg
  • Computer Science
    Proceedings of International Conference on Image Processing
  • 1997
A multiresolution approach is formulated to compute a C/sup 2/-continuous surface through a set of irregularly spaced samples through a coarse-to-fine hierarchy of control lattices to generate a sequence of surfaces whose sum approaches the desired interpolating surface.

Algorithms and Data Structures for Truncated Hierarchical B-splines

This work presents an effective implementation of the fundamental algorithms needed for the manipulation of THB–spline representations based on standard data structures by combining a quadtree data structure — which is used to represent the nested sequence of subdomains — with a suitable data structure for sparse matrices.

Adaptive method for 2.5D scattered point approximation

The method generates a B-spline surface for approximation defined by control points that are determined by directly reflecting the errors between the surface and input points that adaptively refines the control points for efficient error reduction.

C2interpolation T-splines

Integration of Moving Least Squares Method and Multilevel B-Spline Method for Scattered Data Approximation

Experimental results demonstrate that the presented strategy based on integration of moving least squares and multilevel B-spline has higher approximation accuracy.
...

References

SHOWING 1-10 OF 58 REFERENCES

Surface fitting with hierarchical splines

This work considers the fitting of tensor product parametric spline surfaces to gridded data and uses a hierarchical representation for the surface to improve efficiency and adaptively decompose the fitting process into subproblems involving only a portion of the data.

Numerical Procedures for Surface Fitting of Scattered Data by Radial Functions

The major theme of this work is the development of an iterative scheme for the construction of a smooth surface, presented by global basis functions, which approximates only the smooth components of a set of scattered noisy data.

Fast Surface Interpolation Using Hierarchical Basis Functions

  • R. Szeliski
  • Computer Science
    IEEE Trans. Pattern Anal. Mach. Intell.
  • 1990
In the present paper, an alternative to multigrid relaxation which is much easier to implement is presented, which uses conjugate-gradient descent in conjunction with a hierarchical (multiresolution) set of basis functions.

Making the Oslo algorithm more efficient

It is proved that all discrete B-splines which are nonzero at a particular point can in general be considered as lower order discrete B -splines on a subset of the knots.

Fitting surfaces to scattered data

A variety of numerical methods for fitting a function to data given at a set of points scattered throughout a domain in the plane are surveyed. Four classes of methods are discussed: (1) global

Fitting scattered data on spherelike surfaces using tensor products of trigonometric and polynomial splines

SummaryA method is presented for fitting a function defined on a general smooth spherelike surfaceS, given measurements on the function at a set of scattered points lying onS. The approximating

Moment images, polynomial fit filters. and the problem of surface interpolation

  • P. Burt
  • Computer Science
    Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition
  • 1988
A uniform hierarchical procedure for processing incomplete image data, hierarchical polynomial fit filtering, yields a multiresolution set of low-pass filtered images, combined by multiresolved interpolation to form a smooth surface passing through the original image data.

Hierarchical and variational geometric modeling with wavelets

Wavelet decompositions are shown to be useful for hierarchical control point or least squares editing and direct curve and surface manipulation methods using an underlying geometric variational principle can be solved more efficiently by using a wavelet basis.

Hierarchical B-spline refinement

This work presents a method of localizing the effect of refinement through the use of overlays, which are hierarchically controlled subdivisions, and introduces two editing techniques that are effective when using overlays.
...