The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Edge Focusing
Abstract
Edge detection in a gray-scale image at a fine resolution typically yields noise and unnecessary detail, whereas edge detection at a coarse resolution distorts edge contours. We show that ``edge focusing'', i.e., a coarse-to-fine tracking in a continuous manner, combines high positional accuracy with good noise-reduction. This is of vital interest in several applications. Junctions of different kinds are in this way restored with high precision, which is a basic requirement when performing (projective) geometric analysis of an image for the purpose of restoring the three-dimensional scene. Segmentation of a scene using geometric clues like parallelism, etc., is also facilitated by the algorithm, since unnecessary detail has been filtered away. There are indications that an extension of the focusing algorithm can classify edges, to some extent, into the categories diffuse and nondiffuse (for example diffuse illumination edges). The edge focusing algorithm contains two parameters, namely the coarseness of the resolution in the blurred image from where we start the focusing procedure, and a threshold on the gradient magnitude at this coarse level. The latter parameter seems less critical for the behavior of the algorithm and is not present in the focusing part, i.e., at finer resolutions. The step length of the scale parameter in the focusing scheme has been chosen so that edge elements do not move more than one pixel per focusing step.
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
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
The Laplacian pyramid as a compact image code
Burt, P., & Adelson, E. (1983) · IEEE Transactions on Communications · doi:10.1109/tcom.1983.1095851 · Cited by 6,077
Koenderink, J. J. (1984) · Biological Cybernetics · doi:10.1007/bf00336961 · Cited by 2,452
Witkin, A. P. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50036-2 · Cited by 2,359
Scale-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
Perceptual Organization and Visual Recognition
Lowe, D. G. (1985) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-2551-2 · Cited by 982
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
Fast filter transform for image processing
Burt, P. J. (1981) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(81)90092-7 · Cited by 458
An Operator Which Locates Edges in Digitized Pictures
Hueckel, M. H. (1971) · Journal of the ACM · doi:10.1145/321623.321635 · Cited by 407
From Images to Surfaces: A Computational Study of the Human Early Visual System
Grimson, W. E. L. (1981) · The MIT Press eBooks · doi:10.7551/mitpress/3132.001.0001 · Cited by 405
The Recovery of Three-Dimensional Structure from Image Curves
Lowe, D. G., & Binford, T. O. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767660 · Cited by 43
A model of visual threshold detection
Hay, G. A., & Chesters, M. S. (1977) · Journal of Theoretical Biology · doi:10.1016/0022-5193(77)90196-5 · Cited by 16
Cited by
Scale-space theory: a basic tool for analyzing structures at different scales
Lindeberg, T. (1994) · Journal of Applied Statistics · doi:10.1080/757582976 · Cited by 1,196
Saliency, Scale and Image Description
Kadir, T., & Brady, M. (2001) · International Journal of Computer Vision · doi:10.1023/a:1012460413855 · Cited by 1,195
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
Boundary finding with parametrically deformable models
Staib, L. H., & Duncan, J. S. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.166621 · Cited by 756
Ding, L., & Goshtasby, A. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(00)00023-6 · Cited by 683
Metadata
- Authors
- Bergholm, F.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1987-11
- Volume
- PAMI-9
- Issue
- 6
- Pages
- 726-741
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2296297488
- Cited by
- 486
- References
- 14
- FWCI
- 16.15
- 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.