论文信息 - Edge expression based on tree structure

Edge expression based on tree structure

Abstract It is a difficult problem to construct the edge structure of an object from its defective line drawing after the low-level image processing phase. A tree structure edge expression is proposed, in which the tree expresses the contiguous line segments, and all the trees constitute a forest for the object. Some medium level processing algorithms, such as line connecting, pruning and appending are derived by using the tree structure. Experiments are conducted which show the advantages of the expression and corresponding algorithms.

[1] Allen R. Hanson,et al. Extracting Straight Lines , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2] Tamar Peli,et al. A study of edge detection algorithms , 1982, Comput. Graph. Image Process..

[3] Martin A. Fischler,et al. Linear delineation , 1987 .

[4] Richard O. Duda,et al. Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[5] Alberto Martelli,et al. An application of heuristic search methods to edge and contour detection , 1976, CACM.

[6] Hanan Samet,et al. Region representation: quadtrees from boundary codes , 1980, CACM.

[7] Dana H. Ballard,et al. Strip trees: a hierarchical representation for curves , 1981, CACM.

[8] Martin A. Fischler,et al. Detection of roads and linear structures in low-resolution aerial imagery using a multisource knowledge integration technique☆ , 1981 .