The Euler number is one of the most important topological properties in a binary image. Aiming at the problem on repeated checking of pixels in the conventional computing algorithms
a new algorithm was proposed for computing the Euler number based on counting bit-quads in the given image. In the proposed algorithm
four states are constructed and taking advantage of transitions among the states
pixels can be avoided to check repeatedly. Furthermore
fewer bit-quad patterns were used in the proposed algorithm in order to improve the efficiency of the algorithm. Experimental results on various kinds of images demonstrated that the proposed algorithm is more efficient than conventional Euler number computing algorithms in most cases.
关键词
Keywords
references
Yao B, He L, Kang S, et al. A novel bit-quad- based Euler number computing algorithm[J]. Springerplus, 2015, 4(1): 1-16. DOI: 1
Bishnu A, Bhattachary B B, Kundu M K, et al. A pipeline architecture for computing the Euler number of a binary image[J]. Journal of Systems Architecture, 2005, 51(8): 470-487. DOI: 470
Gray S B. Local properties of binary images in two dimensions[J]. IEEE Trans. Computers, 1971, C-20: 551-561. DOI: 551
Juan L D S, Azuela J H S. On the computation of the Euler number of a binary object[J]. Pattern Recognition, 1996, 29(3): 471-476. DOI: 471
Pogue B W, Mycek M A, Harper D. Image analysis for discrimination of cervical neoplasia[J]. Journal of Biomedical Optics, 2000, 5(1): 72-82. DOI: 72