The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Digital Step Edges from Zero Crossing of Second Directional Derivatives
Abstract
We use the facet model to accomplish step edge detection. The essence of the facet model is that any analysis made on the basis of the pixel values in some neighborhood has its final authoritative interpretation relative to the underlying gray tone intensity surface of which the neighborhood pixel values are observed noisy samples. With regard to edge detection, we define an edge to occur in a pixel if and only if there is some point in the pixel's area having a negatively sloped zero crossing of the second directional derivative taken in the direction of a nonzero gradient at the pixel's center. Thus, to determine whether or not a pixel should be marked as a step edge pixel, its underlying gray tone intensity surface must be estimated on the basis of the pixels in its neighborhood. For this, we use a functional form consisting of a linear combination of the tensor products of discrete orthogonal polynomials of up to degree three. The appropriate directional derivatives are easily computed from this kind of a function. Upon comparing the performance of this zero crossing of second directional derivative operator with the Prewitt gradient operator and the Marr-Hildreth zero crossing of the Laplacian operator, we find that it is the best performer; next is the Prewitt gradient operator. The Marr-Hildreth zero crossing of the Laplacian operator performs the worst.
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
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
(1982) · Elsevier eBooks · doi:10.1016/c2009-0-21955-6 · Cited by 4,596
Johnson, A. P. (2024) · Being and Becoming Teachers of Writing · doi:10.4324/9781003334798-34 · Cited by 4,502
MACHINE PERCEPTION OF THREE-DIMENSIONAL SOLIDS,
Roberts, L. G. (1963) · Defense Technical Information Center (DTIC) · Cited by 1,551
Hartl, P. (1976) · Ecological Studies · doi:10.1007/978-3-642-66236-2_9 · Cited by 1,213
Picture processing and psychopictorics
(1971) · Icarus · doi:10.1016/0019-1035(71)90136-9 · Cited by 766
An Operator Which Locates Edges in Digitized Pictures
Hueckel, M. H. (1971) · Journal of the ACM · doi:10.1145/321623.321635 · Cited by 407
Orthogonal Polynomials for Engineers and Physicists
L., Y. L., & Beckmann, P. (1974) · Mathematics of Computation · doi:10.2307/2005720 · Cited by 169
Zero Crossing Of Second Directional Derivative Edge Operator
Haralick, R. M. (1982) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.933616 · Cited by 63
Self-citationStochastic boundary estimation and object recognition
Cooper, D. B., Elliott, H., Cohen, F. S., Reiss, L., & Symosek, P. F. (1980) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(80)90018-0 · Cited by 49
Cited by
A review on image segmentation techniques
Pal, N. R., & Pal, S. K. (1993) · Pattern Recognition · doi:10.1016/0031-3203(93)90135-j · Cited by 3,708
SUSAN—a new approach to low level image processing
Smith, S. M., & Brady, J. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007963824710 · Cited by 3,333
The design and use of steerable filters
Freeman, W. T., & Adelson, E. H. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.93808 · Cited by 2,942
Haralick, R. M., & Shapiro, L. G. (1985) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(85)90153-7 · Cited by 2,253
Self-citationUsing 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
Metadata
- Authors
- Haralick, R. M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1984-01
- Volume
- PAMI-6
- Issue
- 1
- Pages
- 58-68
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2113511941
- Cited by
- 1,026
- References
- 10
- FWCI
- 31.21
- 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.