|
 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
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Rosenfeld, A. Picture Processing by Computer. Academic Press, New York, 1969.
|
 |
2
|
|
| |
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
|
|
| |
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
|
|
| |
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
|
|
| |
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
|
|
| |
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.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf