A graph-theory-based Euler number computing algorithm

This paper proposes a new graph-theory-based Euler number computing algorithm. The proposed algorithm only needs to count two bit-quad patterns in the given image, while conventional bit-quad-based algorithms need to count ten. Moreover, by use of the information obtained during processing previous pixels, the average number of pixel checked for processing a bit-quad in the proposed algorithm will be less than that in conventional algorithms. Experimental results demonstrated that the performance of the proposed algorithm significantly overpasses conventional Euler number computing algorithms.