Binary Image Processing for Computation of Connected Components, Image Holes and Euler Number Using Graph Theory

This paper focuses on binary image processing for the computation of Euler number along with connected components and holes in the image. The proposed algorithm incorporates two different fields of computer science: image processing and graph theory which makes it unique and very efficient. This algorithm transforms the binary image into a planer graph by considering image pixels as graph vertices and then applies the graph theory principles. Experimental results corroborate that the performance of the proposed algorithm remarkably surpass all the standard Euler number computing algorithms.