A fast algorithm to calculate the Euler number for binary images
From MaRDI portal
Publication:3815558
DOI10.1016/0167-8655(88)90078-5zbMath0664.68098OpenAlexW1982391758MaRDI QIDQ3815558
Publication date: 1988
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8655(88)90078-5
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)
Related Items (5)
GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION ⋮ Computation of the Euler number using the contact perimeter ⋮ An algorithm for connected-component labeling, hole labeling and Euler number computing ⋮ An approach to the computation of the Euler number by means of the vertex chain code ⋮ A proof of image Euler number formula
This page was built for publication: A fast algorithm to calculate the Euler number for binary images
