IEICE TRANSACTIONS on Information
An Efficient Strategy for Bit-Quad-Based Euler Number Computing Algorithm
Summary :
The Euler number of a binary image is an important topological property for pattern recognition, and can be calculated by counting certain bit-quads in the image. This paper proposes an efficient strategy for improving the bit-quad-based Euler number computing algorithm. By use of the information obtained when processing the previous bit quad, the number of times that pixels must be checked in processing a bit quad decreases from 4 to 2. Experiments demonstrate that an algorithm with our strategy significantly outperforms conventional Euler number computing algorithms.
- Publication
- IEICE TRANSACTIONS on Information Vol.E97-D No.5 pp.1374-1378
- Publication Date
- 2014/05/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E97.D.1374
- Type of Manuscript
- LETTER
- Category
- Pattern Recognition
Authors
Bin YAO
Shaanxi University of Science and Technology
Hua WU
Shaanxi University of Science and Technology
Yun YANG
Shaanxi University of Science and Technology
Yuyan CHAO
Nagoya Sangyo University
Atsushi OHTA
Aichi Prefectural University
Haruki KAWANAKA
Aichi Prefectural University
Lifeng HE
Aichi Prefectural University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Bin YAO, Hua WU, Yun YANG, Yuyan CHAO, Atsushi OHTA, Haruki KAWANAKA, Lifeng HE, "An Efficient Strategy for Bit-Quad-Based Euler Number Computing Algorithm" in IEICE TRANSACTIONS on Information,
vol. E97-D, no. 5, pp. 1374-1378, May 2014, doi: 10.1587/transinf.E97.D.1374.
Abstract: The Euler number of a binary image is an important topological property for pattern recognition, and can be calculated by counting certain bit-quads in the image. This paper proposes an efficient strategy for improving the bit-quad-based Euler number computing algorithm. By use of the information obtained when processing the previous bit quad, the number of times that pixels must be checked in processing a bit quad decreases from 4 to 2. Experiments demonstrate that an algorithm with our strategy significantly outperforms conventional Euler number computing algorithms.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E97.D.1374/_p
Copy
@ARTICLE{e97-d_5_1374,
author={Bin YAO, Hua WU, Yun YANG, Yuyan CHAO, Atsushi OHTA, Haruki KAWANAKA, Lifeng HE, },
journal={IEICE TRANSACTIONS on Information},
title={An Efficient Strategy for Bit-Quad-Based Euler Number Computing Algorithm},
year={2014},
volume={E97-D},
number={5},
pages={1374-1378},
abstract={The Euler number of a binary image is an important topological property for pattern recognition, and can be calculated by counting certain bit-quads in the image. This paper proposes an efficient strategy for improving the bit-quad-based Euler number computing algorithm. By use of the information obtained when processing the previous bit quad, the number of times that pixels must be checked in processing a bit quad decreases from 4 to 2. Experiments demonstrate that an algorithm with our strategy significantly outperforms conventional Euler number computing algorithms.},
keywords={},
doi={10.1587/transinf.E97.D.1374},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - An Efficient Strategy for Bit-Quad-Based Euler Number Computing Algorithm
T2 - IEICE TRANSACTIONS on Information
SP - 1374
EP - 1378
AU - Bin YAO
AU - Hua WU
AU - Yun YANG
AU - Yuyan CHAO
AU - Atsushi OHTA
AU - Haruki KAWANAKA
AU - Lifeng HE
PY - 2014
DO - 10.1587/transinf.E97.D.1374
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2014
AB - The Euler number of a binary image is an important topological property for pattern recognition, and can be calculated by counting certain bit-quads in the image. This paper proposes an efficient strategy for improving the bit-quad-based Euler number computing algorithm. By use of the information obtained when processing the previous bit quad, the number of times that pixels must be checked in processing a bit quad decreases from 4 to 2. Experiments demonstrate that an algorithm with our strategy significantly outperforms conventional Euler number computing algorithms.
ER -
English
