DocumentCode
1063664
Title
On edge and line linking with connectionist models
Author
Basak, Jayanta ; Chanda, Bhabatosh ; Majumder, Dwijesh Dutta
Author_Institution
Electron. & Commun. Sci. Unit, Indian Stat. Inst., Calcutta, India
Volume
24
Issue
3
fYear
1994
fDate
3/1/1994 12:00:00 AM
Firstpage
413
Lastpage
428
Abstract
In this paper two connectionist models for mid-level vision problems, namely, edge and line linking, have been presented. The processing elements (PE) are arranged in the form of two-dimensional lattice in both the models. The models take the strengths and the corresponding directions of the fragmented edges (or lines) as the input. The state of each processing element is updated by the activations received from the neighboring processing elements. In one model, each neuron interacts with its eight neighbors, while in the other model, each neuron interacts over a larger neighborhood. After convergence, the output of the neurons represent the linked edge (or line) segments in the image. The first model directly produces the linked line segments, while the second model produces a diffused edge cover. The linked edge segments are found by finding out the spine of the diffused edge cover. The experimental results and the proof of convergence of the network models have also been provided
Keywords
edge detection; neural nets; 2D lattice; connectionist models; convergence; diffused edge cover; edge linking; fragmented edges; line linking; linked line segments; mid-level vision problems; processing elements; Convergence; Image edge detection; Image segmentation; Joining processes; Laplace equations; Lattices; Layout; Neurons; Strips; Uncertainty;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9472
Type
jour
DOI
10.1109/21.278991
Filename
278991
Link To Document