An algorithm for connected-component labeling, hole labeling and Euler number computing

DOI10.1007/s11390-013-1348-yzbMath1280.68287OpenAlexW2063504414WikidataQ62712200 ScholiaQ62712200MaRDI QIDQ2434594

Kenji Suzuki, Yuyan Chao, Lifeng He

Publication date: 6 February 2014

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11390-013-1348-y

zbMATH Keywords

pattern recognitioncomputer visionEuler numberholeconnected-component labeling

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Related Items (1)

Topological fidelity and image thresholding: a persistent homology approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast connected-component labeling
• A fast algorithm to calculate the Euler number for binary images
• Linear-time connected-component labeling based on sequential local operations
• Two Efficient Label-Equivalence-Based Connected-Component Labeling Algorithms for 3-D Binary Images
• Local Properties of Binary Images in Two Dimensions

This page was built for publication: An algorithm for connected-component labeling, hole labeling and Euler number computing