The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fast algorithms for low-level vision
Abstract
A recursive filtering structure is proposed that drastically reduces the computational effort required for smoothing, performing the first and second directional derivatives, and carrying out the Laplacian of an image. These operations are done with a fixed number of multiplications and additions per output point independently of the size of the neighborhood considered. The key to the approach is, first, the use of an exponentially based filter family and, second, the use of the recursive filtering. Applications to edge detection problems and multiresolution techniques are considered, and an edge detector allowing the extraction of zero-crossings of an image with only 14 operations per output element at any resolution is proposed. Various experimental results are shown.>
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
Cites
Marr, D., & Hildreth, E. (1980) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1980.0020 · Cited by 6,510
Cited by
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Scharstein, D., & Szeliski, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014573219977 · Cited by 6,740
Variational Methods for Multimodal Image Matching
Hermosillo, G., Chefd'Hotel, C., & Faugeras, O. (2002) · International Journal of Computer Vision · doi:10.1023/a:1020830525823 · Cited by 388
Fast anisotropic gauss filtering
Geusebroek, J., Smeulders, A. W. M., & van de Weijer, J. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.812429 · Cited by 331
Stuber, M., Botnar, R. M., Danias, P. G., Kissinger, K. V., & Manning, W. J. (1999) · Radiology · doi:10.1148/radiology.212.2.r99au50579 · Cited by 256
4D MR phase and magnitude segmentations with GPU parallel computing
Bergen, R. V., Lin, H.-Y., Alexander, M. E., & Bidinosti, C. P. (2015) · Magnetic Resonance Imaging · doi:10.1016/j.mri.2014.08.019 · Cited by 11
Metadata
- Authors
- Deriche, R.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1990
- Volume
- 12
- Issue
- 1
- Pages
- 78-87
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2173710661
- Cited by
- 492
- References
- 1
- FWCI
- 13.18
- 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: Fast algorithms for low-level vision. https://app.cochat.ai/papers/10.1109/34.41386
- The paper
- Deriche, R. (1990). Fast algorithms for low-level vision. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.41386
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.
