The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal edge detectors for ramp edges
Abstract
It is argued that the best way to model an edge is by assuming all ideal mathematical function passed through a low-pass filter and and immersed in noise. Using techniques similar to those developed by J. Canny (1983, 1986) and L.A. Spacek (1986), optimal filters are derived for ramp edges of various slopes. The optimal nonrecursive filter for ideal step edges is then derived as a limiting case of the filters for ramp edges. Because there are no step edges in images, edge detection is improved when the ramp filter is used instead of the filters developed for step edges. For practical purposes, some convolution masks are given which can be used directly for edge detection without the need to go into the details of the subject.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Cited by
Edge Detection and Ridge Detection with Automatic Scale Selection
Lindeberg, T. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008097225773 · Cited by 1,024
Gabor filter-based edge detection
Mehrotra, R., Namuduri, K. R., & Ranganathan, N. (1992) · Pattern Recognition · doi:10.1016/0031-3203(92)90121-x · Cited by 444
Edge and line oriented contour detection: State of the art
Papari, G., & Petkov, N. (2011) · Image and Vision Computing · doi:10.1016/j.imavis.2010.08.009 · Cited by 357
Edge detection and ridge detection with automatic scale selection
Lindeberg, T. (1996) · Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1996.517113 · Cited by 345
Metadata
- Authors
- Petrou, M., & Kittler, J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1991-05
- Volume
- 13
- Issue
- 5
- Pages
- 483-491
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W1982975308
- Cited by
- 187
- References
- 1
- FWCI
- 10.93
- 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.