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 · 2014
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.