The DOI matches its Crossref record.
The farthest point strategy for progressive image sampling
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
GraspNet-1Billion: A Large-Scale Benchmark for General Object Grasping
Fang, H.-S., Wang, C., Gou, M., & Lu, C. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01146 · Cited by 683
Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0508601103 · Cited by 538
Physics-Inspired Structural Representations for Molecules and Materials
Musil, F., Grisafi, A., Bartók, A. P., Ortner, C., Csányi, G., & Ceriotti, M. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00021 · Cited by 523
Möbius voting for surface correspondence
Lipman, Y., & Funkhouser, T. (2009) · ACM Transactions on Graphics · doi:10.1145/1531326.1531378 · Cited by 332
CGC-Net: Cell Graph Convolutional Network for Grading of Colorectal Cancer Histology Images
Zhou, Y., Graham, S., Alemi Koohbanani, N., Shaban, M., Heng, P.-A., & Rajpoot, N. (2019) · 2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW) · doi:10.1109/iccvw.2019.00050 · Cited by 225
Metadata
- Authors
- Eldar, Y., Lindenbaum, M., Porat, M., & Zeevi, Y. Y.
- Venue
- IEEE Transactions on Image Processing
- Published
- 1997-09
- Volume
- 6
- Issue
- 9
- Pages
- 1305-1315
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2563408008
- Cited by
- 693
- References
- 0
- FWCI
- 1.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The farthest point strategy for progressive image sampling. https://app.cochat.ai/papers/10.1109/83.623193
- The paper
- Eldar, Y., Lindenbaum, M., Porat, M., & Zeevi, Y. Y. (1997). The farthest point strategy for progressive image sampling. IEEE Transactions on Image Processing. https://doi.org/10.1109/83.623193
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
