The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An application of heuristic search methods to edge and contour detection
Open accessAbstract
This paper presents a method for detecting edges and contours in noisy pictures. The properties of an edge are embedded in a figure of merit and the edge detection problem becomes the problem of minimizing the given figure of merit. This problem can be represented as a shortest path problem on a graph and can be solved using well-known graph search algorithms. The relations between this representation of the minimization problem and a dynamic programming approach are discussed, showing that the graph search method can lead to substantial improvements in computing time. Moreover, if heuristic search methods are used, the computing time will depend on the amount of noise in the picture. Some experimental results are given; these show how various information about the shape of the contour of an object can be embedded in the figure of merit, thus allowing the extraction of contours from noisy pictures and the separation of touching objects.
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 note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
The Representation and Matching of Pictorial Structures
Fischler, M. A., & Elschlager, R. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223602 · Cited by 1,322
Picture processing by computer
(1971) · Icarus · doi:10.1016/0019-1035(71)90137-0 · Cited by 415
Picture Processing by Computer
Rosenfeld, A. (1969) · ACM Computing Surveys · doi:10.1145/356551.356554 · Cited by 368
Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6010-2 · Cited by 341
On the optimal detection of curves in noisy pictures
Montanari, U. (1971) · Communications of the ACM · doi:10.1145/362588.362594 · Cited by 295
Automatic interpretation and classification of images
Grasselli, A. (1969) · Cited by 229
Edge detection using heuristic search methods
Martelli, A. (1972) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(72)80013-3 · Cited by 166
Self-citationMartelli, A., & Montanari, U. (1973) · International Joint Conference on Artificial Intelligence · Cited by 146
Self-citationEdge and Curve Detection: Further Experiments
Rosenfeld, A., Thurston, M., & Lee, Y.-H. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223573 · Cited by 115
Sequential optimization in pattern recognition and pattern description.
Kovalevsky, V. (1968) · IFIP Congress · Cited by 32
Cited by
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Medical image analysis: progress over two decades and the challenges ahead
Duncan, J. S., & Ayache, N. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824822 · Cited by 4,140
A survey on image segmentation
Fu, K. S., & Mui, J. K. (1981) · Pattern Recognition · doi:10.1016/0031-3203(81)90028-5 · Cited by 1,203
A review of vessel extraction techniques and algorithms
Kirbas, C., & Quek, F. (2004) · ACM Computing Surveys · doi:10.1145/1031120.1031121 · Cited by 900
Intelligent scissors for image composition
Mortensen, E. N., & Barrett, W. A. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218442 · Cited by 778
Metadata
- Authors
- Martelli, A.
- Venue
- Communications of the ACM
- Published
- 1976-02
- Volume
- 19
- Issue
- 2
- Pages
- 73-83
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2003750906
- Cited by
- 258
- References
- 16
- FWCI
- 7.70
- Type
- journal article
- Language
- en
- Open access
- bronze
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.