The farthest point strategy for progressive image sampling

نویسندگان

  • Yuval Eldar
  • Michael Lindenbaum
  • Moshe Porat
  • Yehoshua Y. Zeevi
چکیده

A new method of farthest point strategy (FPS) for progressive image acquisition-an acquisition process that enables an approximation of the whole image at each sampling stage-is presented. Its main advantage is in retaining its uniformity with the increased density, providing 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 anti-aliasing properties comparable to those characteristic of the best available method (Poisson disk). 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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Farthest-Point Masks for Image Halftoning

In an earlier paper, we briefly presented a new halftoning algorithm called farthest-point halftoning. In the present paper, this method is analyzed in detail, and a novel dispersion measure is defined to improve the simplicity and flexibility of the result. This new stochastic screen algorithm is loosely based on Kang’s dispersed-dot ordered dither halftone array construction technique used as...

متن کامل

Fast Marching farthest point sampling

We introduce the Fast Marching farthest point sampling (FastFPS) approach for the progressive sampling of planar domains and curved manifolds in triangulated, point cloud or implicit form. By using Fast Marching methods2, 3, 6 for the incremental computation of distance maps across the sampling domain, we obtain a farthest point sampling technique superior to earlier point sampling principles i...

متن کامل

Image Compression with Anisotropic Geodesic Triangulations

We propose a new image compression method based on geodesic Delaunay triangulations. Triangulations are generated by a progressive geodesic meshing algorithm which exploits the anisotropy of images through a farthest point sampling strategy. This seeding is performed according to anisotropic geodesic distances which force the anisotropic Delaunay triangles to follow the geometry of the image. G...

متن کامل

Stylized rendering for multiresolution image representation

By integrating stylized rendering with an efficient multiresolution image representation, we enable the user to control how compression affects the aesthetic appearance of an image. Adopting a point-based rendering approach to progressive image transmission and compression, we represent an image by a sequence of color values. To best approximate the image at progressive levels of detail, a nove...

متن کامل

A new point cloud simplification algorithm

We present a new technique for the simplification of pointsampled geometry without any prior surface reconstruction. Using Fast Marching farthest point sampling for implicit surfaces and point clouds [1], we devise a coarse-tofine uniform or feature-sensitive simplification algorithm with user-controlled density guarantee. The algorithm is computationally and memory efficient, easy to implement...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society

دوره 6 9  شماره 

صفحات  -

تاریخ انتشار 1997