[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

An application of heuristic search methods to edge and contour detection

Published: 01 February 1976 Publication History

Abstract

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.

References

[1]
Rosenfeld, A. Picture Processing by Computer. Academic Press, New York, 1969.
[2]
Hueckel, M.H. A local visual operator which recognizes edges and lines. J. ACM 20, 4 (Oct. 1973), 634-647.
[3]
Rosenfeld, A., Thurston, M., and Lee, Y.-H. Edge and curve detection: further experiments. IEEE Trans. on Computers C-21, 7 (July 1972), 677-715.
[4]
Pingle, K.K., and Tenenbaum, J.M. An accommodating edge follower. In Proc. 2nd Int. Joint Conf. on Artificial Intelligence, London, Sept. 1971, pp. 1-7.
[5]
Kovalewsky, V.A. Sequential optimization in pattern recognition and pattern description. Proc. IFIP Congress, 68, North- Holland Pub. Co., Amsterdam, 1968 pp. 146-151.
[6]
Montanari, U. On the optimal detection of curves in noisy pictures. Comm. ACM 14, 5 (May 1971), 335-345.
[7]
Martelli, A., and Montanari, U. Optimal smoothing in picture processing: An application to fingerprints. Proc. IFIP Congress 71, North-Holland Pub. Co., Amsterdam, 1971 pp. 173-178.
[8]
Fischler, M.A., and Elschlager, R.A. The representation and matching of pictorial structures. IEEE Trans. on Computers C-22, 1 (Jan. 1973), 67-92.
[9]
Martelli, A. Edge detection using heuristic search methods. Computer Graphics and Image Processing 1, 2 (Aug. 1972), 169- 182.
[10]
Martelli, A. Contour detection in noisy pictures using heuristic search methods. Proc. 1st Int. Joint Conf. on Pattern Recognition, Washington, 1973, pp. 375-388.
[11]
Ramer, U. Computer edge extraction from photographs of curved objects. Ph,D. dissertation, Tech. Rep. CRL-34, New York U., Dec, 1973.
[12]
Ballard, D.H., and Sklansky, J. Hierarchic recognition of tumors in chest radiographs. Proc. Second Int. Joint Conf. on Pattern Recognition, Copenhagen, August 1974, pp. 258-263.
[13]
Kaufmann, A., and Cruon, R. Dynamic Programming. Academic Press, New York, 1967.
[14]
Bellman, R., and Dreyfus, S. Applied Dynamic Programming. Princeton U. Press, Princeton, N.J., 1962.
[15]
Nilsson, N.J. Problem-Solving Methods in Artificial bttelligence. McGraw-Hill, New York, 1971.
[16]
Hart, P., Nilsson, N., and Raphael, B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on System Science and Cybernetics SSC-4, 2 (July 1968), 100-107.
[17]
Dijkstra, E. A note on two problems in connection with graphs. Numer. Math. 1 (1959), 269-271.
[18]
Bertel, U., and Brioschi, F. Nonserial Dynamic Programming. Academic Press, New York, 1973.
[19]
Martelli, A., and Montanari U. Nonserial Dynamic Programming: on the optimal strategy of variable elimination for the rectangular lattice. J. Math. Analysis Appl. 40, 1 (Oct. 1972), 226-242.
[20]
Martelli, A., and Montanari, U. Additive AND/OR graphs. Proc. 3rd Int. Joint Conf. on Artificial Intelligence, Stanford, Calif. 1973, pp. 1-11.
[21]
Pingle, K.K. Visual perception by a computer. In Automatic Interpretation and Classification of Images, A. Grasselli (Ed.), Academic Press, New York, 1969, pp. 277-284.

Cited By

View all
  • (2023)La confiance : nouvel horizon social ?La confiance : nouvel horizon social ?10.3917/chaso.obert.2023.01.0119(119-139)Online publication date: 30-Sep-2023
  • (2022)Signal Processing for Telemedicine ApplicationsImage and Signal Processing for Networked eHealth Applications10.1007/978-3-031-01609-7_2(3-9)Online publication date: 8-Mar-2022
  • (2021)HMDS: A Makespan Minimizing DAG Scheduler for Heterogeneous Distributed SystemsACM Transactions on Embedded Computing Systems10.1145/347703720:5s(1-26)Online publication date: 17-Sep-2021
  • Show More Cited By
  1. An application of heuristic search methods to edge and contour detection

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Communications of the ACM
    Communications of the ACM  Volume 19, Issue 2
    Feb. 1976
    53 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/359997
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 February 1976
    Published in CACM Volume 19, Issue 2

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. contour detection
    2. contour following
    3. dynamic programming
    4. edge detection
    5. heuristic search methods
    6. optimization problems
    7. pattern recognition
    8. picture processing
    9. problem solving methods
    10. shortest path

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)224
    • Downloads (Last 6 weeks)63
    Reflects downloads up to 25 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)La confiance : nouvel horizon social ?La confiance : nouvel horizon social ?10.3917/chaso.obert.2023.01.0119(119-139)Online publication date: 30-Sep-2023
    • (2022)Signal Processing for Telemedicine ApplicationsImage and Signal Processing for Networked eHealth Applications10.1007/978-3-031-01609-7_2(3-9)Online publication date: 8-Mar-2022
    • (2021)HMDS: A Makespan Minimizing DAG Scheduler for Heterogeneous Distributed SystemsACM Transactions on Embedded Computing Systems10.1145/347703720:5s(1-26)Online publication date: 17-Sep-2021
    • (2020)Decision Support System for Dental Clinics: A Systematic Literature Review ProtocolIntelligent Technologies and Applications10.1007/978-981-15-5232-8_22(250-257)Online publication date: 9-May-2020
    • (2020)Heuristically Ordered Search in State GraphsA Guided Tour of Artificial Intelligence Research10.1007/978-3-030-06167-8_1(1-26)Online publication date: 8-May-2020
    • (2019)Comparative Analysis of Vessel Segmentation Techniques in Retinal ImagesIEEE Access10.1109/ACCESS.2019.29359127(114862-114887)Online publication date: 2019
    • (2018)Automated Dental Image Analysis by Deep Learning on Small Dataset2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)10.1109/COMPSAC.2018.00076(492-497)Online publication date: Jul-2018
    • (2017)Bandeirantes: A Graph-Based Approach for Curve Tracing and Boundary TrackingMathematical Morphology and Its Applications to Signal and Image Processing10.1007/978-3-319-57240-6_8(95-106)Online publication date: 12-Apr-2017
    • (2016)A review on graph based segmentation techniques2016 10th International Conference on Intelligent Systems and Control (ISCO)10.1109/ISCO.2016.7727008(1-6)Online publication date: Jan-2016
    • (2016)Anytime pack searchNatural Computing: an international journal10.1007/s11047-015-9490-915:3(395-414)Online publication date: 1-Sep-2016
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Full Access

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media