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.
An Efficient Strategy for Bit-Quad-Based Euler Number Computing Algorithm
Bin YAO Hua WU Yun YANG Yuyan CHAO Atsushi OHTA Haruki KAWANAKA Lifeng HE
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2014/05/01
Online ISSN: 1745-1361
Type of Manuscript: LETTER
Category: Pattern Recognition
Euler number, topological property, computer vision, pattern recognition, binary image,
Full Text: PDF(661.3KB)>>
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.