The DOI matches its Crossref record; 13 of the 13 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
Witkin, A. P. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50036-2 · Cited by 2,359
Using Canny's criteria to derive a recursively implemented optimal edge detector
Deriche, R. (1987) · International Journal of Computer Vision · doi:10.1007/bf00123164 · Cited by 1,089
Self-citationScale-space filtering: A new approach to multi-scale description
Witkin, A. (2005) · ICASSP '84. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1984.1172729 · Cited by 1,086
Digital Step Edges from Zero Crossing of Second Directional Derivatives
Haralick, R. M. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767475 · Cited by 1,026
Torre, V., & Poggio, T. A. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767769 · Cited by 989
Finding Edges and Lines in Images
Canny, J. (1983) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 833
Edge and Curve Detection for Visual Scene Analysis
Rosenfeld, A., & Thurston, M. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223290 · Cited by 781
Multiresolution Image Processing and Analysis
Rosenfeld, A. (1984) · Springer series in information sciences · doi:10.1007/978-3-642-51590-3 · Cited by 662
An optimal linear operator for step edge detection
Shen, J., & Castan, S. (1992) · CVGIP: Graphical Models and Image Processing · doi:10.1016/1049-9652(92)90060-b · Cited by 377
A Representation for Shape Based on Peaks and Ridges in the Difference of Low-Pass Transform
Crowley, J. L., & Parker, A. C. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767500 · Cited by 273
Fast Convolution with Laplacian-of-Gaussian Masks
Chen, J. S., Huertas, A., & Medioni, G. G. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767946 · Cited by 129
Fast algorithms for estimating local image properties
Burt, P. J. (1983) · Computer Vision Graphics and Image Processing · doi:10.1016/s0734-189x(83)80049-8 · Cited by 95
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
Efficient and reliable schemes for nonlinear diffusion filtering
Weickert, J., Romeny, B. M. T. H., & Viergever, M. A. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661190 · Cited by 1,130
Hossain, M. D., & Chen, D. (2019) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2019.02.009 · Cited by 697
Fast parallel image registration on CPU and GPU for diagnostic classification of Alzheimer's disease
Shamonin, D. (2013) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2013.00050 · Cited by 586
Improved Coronary Artery Definition With T2-Weighted, Free-Breathing, Three-Dimensional Coronary MRA
Botnar, R. M., Stuber, M., Danias, P. G., Kissinger, K. V., & Manning, W. J. (1999) · Circulation · doi:10.1161/01.cir.99.24.3139 · Cited by 425
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
- 13
- 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
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.