The farthest point strategy for progressive image sampling
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A new method of “farthest point strategy” (FPS) for progressive image acquisition is presented. Its main advantage is in retaining its uniformity with the increased density, providing an efficient means for sparse image sampling and display. In contrast to previously presented stochastic approaches, the FPS guarantees the uniformity in a deterministic min-max sense. Within this uniformity criterion, the sampling points are irregularly spaced, exhibiting superior antialiasing properties. A straightforward modification of the FPS yields an image-dependent adaptive sampling scheme. An efficient, O(N log(N)), algorithm for both versions is introduced, and several applications of the FPS are discussed Author(s) Eldar, Y. IBM Israel Res. & Dev., Haifa, Israel Lindenbaum, M. ; Porat, M. ; Zeevi, Y.Y.Keywords
This publication has 10 references indexed in Scilit:
- Image representation using Voronoi tessellation: adaptive and securePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Image coding using an adaptive sampling techniqueSignal Processing: Image Communication, 1989
- Digital PicturesPublished by Springer Nature ,1988
- Generating antialiased images at low sampling densitiesACM SIGGRAPH Computer Graphics, 1987
- Stochastic sampling in computer graphicsACM Transactions on Graphics, 1986
- Antialiasing through stochastic samplingACM SIGGRAPH Computer Graphics, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Dynamic Voronoi diagramsIEEE Transactions on Information Theory, 1983
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Locally equiangular triangulationsThe Computer Journal, 1978