For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Graph-Theory-Based Algorithm for Euler Number Computing
Lifeng HE Bin YAO Xiao ZHAO Yun YANG Yuyan CHAO Atsushi OHTA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/02/01
Online ISSN: 1745-1361
Type of Manuscript: LETTER
Category: Pattern Recognition
Euler number, topological property, graph theory, computer vision, pattern recognition, image analysis,
Full Text: PDF(565.1KB)
>>Buy this Article
This paper proposes a graph-theory-based Euler number computing algorithm. According to the graph theory and the analysis of a mask's configuration, the Euler number of a binary image in our algorithm is calculated by counting four patterns of the mask. Unlike most conventional Euler number computing algorithms, we do not need to do any processing of the background pixels. Experimental results demonstrated that our algorithm is much more efficient than conventional Euler number computing algorithms.