论文信息 - Algorithms for homotopy classification of binary images

Algorithms for homotopy classification of binary images

In this note using the concept of the index of pixel of a binary image [E. V. Shchepin and G. M. Nepomnyashchyi, On Topology Analysis of Images. MIP, Moscow (1990)], several algorithms for their homotopy classification are investigated. Defining the concept of a computer homotopy, we consider, in particular, the algorithm that assigns to any class of homotopy equivalent binary images a directed tree with a root.

Alexander I. Bykov | Leonid G. Zerkalov

[1] Hanspeter Bieri,et al. Algorithms for the euler characteristic and related additive functionals of digital objects , 1984, Comput. Vis. Graph. Image Process..

[2] C. Dyer. Computing the Euler number of an image from its quadtree , 1980 .

[3] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[4] T. Pavlidis. Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[5] A. ROSENFELD,et al. Distance functions on digital pictures , 1968, Pattern Recognit..

[6] R. Ho. Algebraic Topology , 2022 .

[7] Hanspeter Bieri,et al. Computing the Euler characteristic and related additive functionals of digital objects from their bintree representation , 1987, Comput. Vis. Graph. Image Process..