A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Sabyasachi Dey Articles by Bhargab B. Bhattacharya Articles by Malay K. Kundu Articles by Tinku Acharya

13th International Conference on VLSI Design

Calcutta, India

January 04-January 07

ISBN: 0-7695-0487-6

	ASCII Text	x
	Sabyasachi Dey, Bhargab B. Bhattacharya, Malay K. Kundu, Tinku Acharya, "A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation," VLSI Design, International Conference on, pp. 330, 13th International Conference on VLSI Design, 2000.

	BibTex	x
	@article{ 10.1109/ICVD.2000.812628, author = {Sabyasachi Dey and Bhargab B. Bhattacharya and Malay K. Kundu and Tinku Acharya}, title = {A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation}, journal ={VLSI Design, International Conference on}, volume = {0}, year = {2000}, issn = {1063-9667}, pages = {330}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICVD.2000.812628}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - VLSI Design, International Conference on TI - A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation SN - 1063-9667 SP EP A1 - Sabyasachi Dey, A1 - Bhargab B. Bhattacharya, A1 - Malay K. Kundu, A1 - Tinku Acharya, PY - 2000 VL - 0 JA - VLSI Design, International Conference on ER -

Sabyasachi Dey, Indian Statistical Institute

Bhargab B. Bhattacharya, Indian Statistical Institute

Malay K. Kundu, Indian Statistical Institute

Tinku Acharya, Intel Corporation

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICVD.2000.812628

Euler number is a fundamental topological feature of an image. In this paper, a novel algorithm for computing the Euler number of a binary image based on divide-and-conquer paradigm, is proposed, which outperforms significantly the conventional techniques used in image processing tools. The algorithm can be easily parallelized for computing the Euler number of an N x N image in O(N) time, with O(N) processors. Using a simple architecture, the proposed method can be implemented as a special purpose VLSI chip.

Citation:

Sabyasachi Dey, Bhargab B. Bhattacharya, Malay K. Kundu, Tinku Acharya, "A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation," vlsid, pp.330, 13th International Conference on VLSI Design, 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.