A fast algorithm to calculate the Euler number for binary images

DOI10.1016/0167-8655(88)90078-5MaRDI QIDQ3815558zbMATH OpenOpenAlexFDO

Authors Minghua Chen, Pingfan Yan

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

zbMATH Keywords

binary imageEuler number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Cited in

(7)

• A fast algorithm for Euclidean distance maps of a 2-D binary image
• An approach to the computation of the Euler number by means of the vertex chain code
• An algorithm for connected-component labeling, hole labeling and Euler number computing
• A proof of image Euler number formula
• scientific article; zbMATH DE number 5139590 (Why is no real title available?)
• GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
• Computation of the Euler number using the contact perimeter

This page was built for publication: A fast algorithm to calculate the Euler number for binary images

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815558)