Bit-Quad-Based Euler Number Computing

Bin YAO; Lifeng HE; Shiying KANG; Xiao ZHAO; Yuyan CHAO

doi:10.1587/transinf.2017EDP7012

Bit-Quad-Based Euler Number Computing

Bin YAO, Lifeng HE, Shiying KANG, Xiao ZHAO, Yuyan CHAO

Full Text Views

0

Cite this

Summary :

The Euler number of a binary image is an important topological property for pattern recognition, image analysis, and computer vision. A famous method for computing the Euler number of a binary image is by counting certain patterns of bit-quads in the image, which has been improved by scanning three rows once to process two bit-quads simultaneously. This paper studies the bit-quad-based Euler number computing problem. We show that for a bit-quad-based Euler number computing algorithm, with the increase of the number of bit-quads being processed simultaneously, on the one hand, the average number of pixels to be checked for processing a bit-quad will decrease in theory, and on the other hand, the length of the codes for implementing the algorithm will increase, which will make the algorithm less efficient in practice. Experimental results on various types of images demonstrated that scanning five rows once and processing four bit-quads simultaneously is the optimal tradeoff, and that the optimal bit-quad-based Euler number computing algorithm is more efficient than other Euler number computing algorithms.

Publication: IEICE TRANSACTIONS on Information Vol.E100-D No.9 pp.2197-2204

Publication Date: 2017/09/01

Publicized: 2017/06/20

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2017EDP7012

Type of Manuscript: PAPER

Category: Image Recognition, Computer Vision

Authors

Bin YAO
  Shaanxi University of Science and Technology
Lifeng HE
  Shaanxi University of Science and Technology,Aichi Prefectural University
Shiying KANG
  Xianyang Normal University
Xiao ZHAO
  Shaanxi University of Science and Technology
Yuyan CHAO
  Nagoya Sangyo University

Keyword

Euler number, topological property, computer vision, pattern recognition, image analysis

Cite this

Copy

Bin YAO, Lifeng HE, Shiying KANG, Xiao ZHAO, Yuyan CHAO, "Bit-Quad-Based Euler Number Computing" in IEICE TRANSACTIONS on Information, vol. E100-D, no. 9, pp. 2197-2204, September 2017, doi: 10.1587/transinf.2017EDP7012.
Abstract: The Euler number of a binary image is an important topological property for pattern recognition, image analysis, and computer vision. A famous method for computing the Euler number of a binary image is by counting certain patterns of bit-quads in the image, which has been improved by scanning three rows once to process two bit-quads simultaneously. This paper studies the bit-quad-based Euler number computing problem. We show that for a bit-quad-based Euler number computing algorithm, with the increase of the number of bit-quads being processed simultaneously, on the one hand, the average number of pixels to be checked for processing a bit-quad will decrease in theory, and on the other hand, the length of the codes for implementing the algorithm will increase, which will make the algorithm less efficient in practice. Experimental results on various types of images demonstrated that scanning five rows once and processing four bit-quads simultaneously is the optimal tradeoff, and that the optimal bit-quad-based Euler number computing algorithm is more efficient than other Euler number computing algorithms.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2017EDP7012/_p

Copy

@ARTICLE{e100-d_9_2197,
author={Bin YAO, Lifeng HE, Shiying KANG, Xiao ZHAO, Yuyan CHAO, },
journal={IEICE TRANSACTIONS on Information},
title={Bit-Quad-Based Euler Number Computing},
year={2017},
volume={E100-D},
number={9},
pages={2197-2204},
abstract={The Euler number of a binary image is an important topological property for pattern recognition, image analysis, and computer vision. A famous method for computing the Euler number of a binary image is by counting certain patterns of bit-quads in the image, which has been improved by scanning three rows once to process two bit-quads simultaneously. This paper studies the bit-quad-based Euler number computing problem. We show that for a bit-quad-based Euler number computing algorithm, with the increase of the number of bit-quads being processed simultaneously, on the one hand, the average number of pixels to be checked for processing a bit-quad will decrease in theory, and on the other hand, the length of the codes for implementing the algorithm will increase, which will make the algorithm less efficient in practice. Experimental results on various types of images demonstrated that scanning five rows once and processing four bit-quads simultaneously is the optimal tradeoff, and that the optimal bit-quad-based Euler number computing algorithm is more efficient than other Euler number computing algorithms.},
keywords={},
doi={10.1587/transinf.2017EDP7012},
ISSN={1745-1361},
month={September},}

Copy

TY - JOUR
TI - Bit-Quad-Based Euler Number Computing
T2 - IEICE TRANSACTIONS on Information
SP - 2197
EP - 2204
AU - Bin YAO
AU - Lifeng HE
AU - Shiying KANG
AU - Xiao ZHAO
AU - Yuyan CHAO
PY - 2017
DO - 10.1587/transinf.2017EDP7012
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2017
AB - The Euler number of a binary image is an important topological property for pattern recognition, image analysis, and computer vision. A famous method for computing the Euler number of a binary image is by counting certain patterns of bit-quads in the image, which has been improved by scanning three rows once to process two bit-quads simultaneously. This paper studies the bit-quad-based Euler number computing problem. We show that for a bit-quad-based Euler number computing algorithm, with the increase of the number of bit-quads being processed simultaneously, on the one hand, the average number of pixels to be checked for processing a bit-quad will decrease in theory, and on the other hand, the length of the codes for implementing the algorithm will increase, which will make the algorithm less efficient in practice. Experimental results on various types of images demonstrated that scanning five rows once and processing four bit-quads simultaneously is the optimal tradeoff, and that the optimal bit-quad-based Euler number computing algorithm is more efficient than other Euler number computing algorithms.
ER -