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.
Lifeng HE
Shaanxi University of Science and Technology,Aichi Prefectural University
Bin YAO
Shaanxi University of Science and Technology
Xiao ZHAO
Shaanxi University of Science and Technology
Yun YANG
Shaanxi University of Science and Technology
Yuyan CHAO
Nagoya Sangyo University
Atsushi OHTA
Aichi Prefectural University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Lifeng HE, Bin YAO, Xiao ZHAO, Yun YANG, Yuyan CHAO, Atsushi OHTA, "A Graph-Theory-Based Algorithm for Euler Number Computing" in IEICE TRANSACTIONS on Information,
vol. E98-D, no. 2, pp. 457-461, February 2015, doi: 10.1587/transinf.2014EDL8155.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2014EDL8155/_p
Copy
@ARTICLE{e98-d_2_457,
author={Lifeng HE, Bin YAO, Xiao ZHAO, Yun YANG, Yuyan CHAO, Atsushi OHTA, },
journal={IEICE TRANSACTIONS on Information},
title={A Graph-Theory-Based Algorithm for Euler Number Computing},
year={2015},
volume={E98-D},
number={2},
pages={457-461},
abstract={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.},
keywords={},
doi={10.1587/transinf.2014EDL8155},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - A Graph-Theory-Based Algorithm for Euler Number Computing
T2 - IEICE TRANSACTIONS on Information
SP - 457
EP - 461
AU - Lifeng HE
AU - Bin YAO
AU - Xiao ZHAO
AU - Yun YANG
AU - Yuyan CHAO
AU - Atsushi OHTA
PY - 2015
DO - 10.1587/transinf.2014EDL8155
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E98-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2015
AB - 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.
ER -