Key points are not available for this paper at this time.
A method of representing connected components in multivalued images is proposed, and an efficient, sequential, one-pass algorithm for generating the border-line chain code for each component is introduced. Simultaneously, the algorithm produces for each component a list of all neighboring components that are encountered during a walk around the border line, thus providing full topological information. The number of different pixel values does not affect performance.>
Building similarity graph...
Analyzing shared references across papers
Loading...
Mandler et al. (Wed,) studied this question.
synapsesocial.com/papers/6a227613faaf5defc96cd65f — DOI: https://doi.org/10.1109/icpr.1990.119331
E. Mandler
Daimler (Germany)
Matthias Oberländer
Daimler (Germany)
Building similarity graph...
Analyzing shared references across papers
Loading...