Recognition and labeling binary images are important problems in image processing and machine vision. In this paper, we study two classical connectivity- preserving parallel shrinking algorithms proposed for recognition and labeling two-dimensional connected components of binary images. The algorithms we consider were developed by W. T. Beyer[3] and S. Levialdi[7] independently for the purpose of shrinking 4-connected and 8-connected components of binary images in linear time. We develop a duality property between those two algorithms. It is shown that those two independently developed algorithms are closely related and in a sense they are in a dual relation such that, for any initially given binary image and its inverted one, one algorithm produces, simultaneously, a dual image of the other step by step.

Umeo, H., Mauri, G. (2001). A duality in two connectivity-preserving parallel shrinking algorithms for binary images. In S. Bandini, T. Worsch (a cura di), Theory and Practical Issues on Cellular Automata (Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry, Karlsruhe,4-6 October 2000) (pp. 144-151). Springer, London [10.1007/978-1-4471-0709-5_17].

A duality in two connectivity-preserving parallel shrinking algorithms for binary images

Mauri, Giancarlo
2001

Abstract

Recognition and labeling binary images are important problems in image processing and machine vision. In this paper, we study two classical connectivity- preserving parallel shrinking algorithms proposed for recognition and labeling two-dimensional connected components of binary images. The algorithms we consider were developed by W. T. Beyer[3] and S. Levialdi[7] independently for the purpose of shrinking 4-connected and 8-connected components of binary images in linear time. We develop a duality property between those two algorithms. It is shown that those two independently developed algorithms are closely related and in a sense they are in a dual relation such that, for any initially given binary image and its inverted one, one algorithm produces, simultaneously, a dual image of the other step by step.
Capitolo o saggio
Shrinking Algorithms; cellular automata;
English
Theory and Practical Issues on Cellular Automata (Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry, Karlsruhe,4-6 October 2000)
978-1-85233-388-1
Online ISBN 978-1-4471-0709-5
Umeo, H., Mauri, G. (2001). A duality in two connectivity-preserving parallel shrinking algorithms for binary images. In S. Bandini, T. Worsch (a cura di), Theory and Practical Issues on Cellular Automata (Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry, Karlsruhe,4-6 October 2000) (pp. 144-151). Springer, London [10.1007/978-1-4471-0709-5_17].
Umeo, H; Mauri, G
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/346850
Citazioni
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 1
Social impact