A novel bit-quad-based Euler number computing algorithm

AbstractThe Euler number of a binary image is an important topological property in computer vision and pattern recognition. This paper proposes a novel bit-quad-based Euler number computing algorithm. Based on graph theory and analysis on bit-quad patterns, our algorithm only needs to count two bit-quad patterns. Moreover, by use of the information obtained during processing the previous bit-quad, the average number of pixels to be checked for processing a bit-quad is only 1.75. Experimental results demonstrated that our method outperforms significantly conventional Euler number computing algorithms.

[1]  Franco Chiavetta,et al.  Parallel computation of the Euler number via Connectivity Graph , 1993, Pattern Recognit. Lett..

[2]  Juan Humberto Sossa Azuela,et al.  On the computation of the Euler number of a binary object , 1996, Pattern Recognit..

[3]  Tim J. Ellis,et al.  Image Difference Threshold Strategies and Shadow Detection , 1995, BMVC.

[4]  Kenji Suzuki,et al.  An Algorithm for Connected-Component Labeling, Hole Labeling and Euler Number Computing , 2013, Journal of Computer Science and Technology.

[5]  Erik Valdemar Cuevas Jiménez,et al.  Alternative formulations to compute the binary shape Euler number , 2014, IET Comput. Vis..

[6]  J. H. Sossa-Azuela,et al.  Computing the Euler Number of a Binary Image Based on a Vertex Codification , 2013 .

[7]  Minghua Chen,et al.  A fast algorithm to calculate the Euler number for binary images , 1988, Pattern Recognit. Lett..

[8]  Shree K. Nayar,et al.  Reflectance based object recognition , 1996, International Journal of Computer Vision.

[9]  Sargur N. Srihari Document Image Understanding , 1986, FJCC.

[10]  Xiao Zhao,et al.  A new run-based algorithm for Euler number computing , 2015, Pattern Analysis and Applications.

[11]  C. A. Murthy,et al.  A pipeline architecture for computing the Euler number of a binary image , 2005, J. Syst. Archit..

[12]  Yun Yang,et al.  An Efficient Strategy for Bit-Quad-Based Euler Number Computing Algorithm , 2014, IEICE Trans. Inf. Syst..

[13]  C. Dyer Computing the Euler number of an image from its quadtree , 1980 .

[14]  Malay Kumar Kundu,et al.  A fast algorithm for computing the Euler number of an image and its VLSI implementation , 2000, VLSI Design 2000. Wireless and Digital Imaging in the Millennium. Proceedings of 13th International Conference on VLSI Design.

[15]  Lifeng He,et al.  A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing , 2015, IEEE Transactions on Image Processing.

[16]  Kenji Suzuki,et al.  An efficient first-scan method for label-equivalence-based labeling algorithms , 2010, Pattern Recognit. Lett..

[17]  Hanan Samet,et al.  Computing Geometric Properties of Images Represented by Linear Quadtrees , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  B. Pogue,et al.  Image analysis for discrimination of cervical neoplasia. , 2000, Journal of biomedical optics.

[19]  Stephen B. Gray,et al.  Local Properties of Binary Images in Two Dimensions , 1971, IEEE Transactions on Computers.

[20]  M. Karnaugh The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[21]  Clay M. Thompson,et al.  Image processing toolbox [for use with Matlab] , 1995 .

[22]  Y. J. Tejwani,et al.  Robot vision , 1989, IEEE International Symposium on Circuits and Systems,.