A Graph-Theory-Based Algorithm for Euler Number Computing

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

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

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

[4]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[5]  L S Juan Diaz-de-Leon,et al.  On the computation of the Euler number of a binary object , 1996 .

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

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

[8]  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.

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

[10]  Berthold K. P. Horn.  Robot vision , 1986, MIT electrical engineering and computer science series.

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

[12]  Luigi Cinque,et al.  Run-Based Algorithms for Binary Image Analysis and Processing , 1996, IEEE Trans. Pattern Anal. Mach. Intell..