Adaptive Thinning for Terrain Modelling and Image Compression

  • Demaret L
  • Dyn N
  • Floater M
  • et al.
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Adaptive thinning algorithms are greedy point removal schemes for bivariate scattered data sets with corresponding function values, where the points are recursively removed according to some data-dependent criterion. Each subset of points, together with its function values, defines a linear spline over its Delaunay triangulation. The basic criterion for the removal of the next point is to minimize the error between the resulting linear spline at the bivariate data points and the original function values. This leads to a hierarchy of linear splines of coarser and coarser resolutions. This paper surveys the various removal strategies developed in our earlier papers, and the application of adaptive thinning to terrain modelling and to image compres-sion. In our image test examples, we found that our thinning scheme, adapted to diminish the least squares error, combined with a postprocessing least squares opti-mization and a customized coding scheme, often gives better or comparable results to the wavelet-based scheme SPIHT.

Cite

CITATION STYLE

APA

Demaret, L., Dyn, N., Floater, M. S., & Iske, A. (2005). Adaptive Thinning for Terrain Modelling and Image Compression. In Advances in Multiresolution for Geometric Modelling (pp. 319–338). Springer-Verlag. https://doi.org/10.1007/3-540-26808-1_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free