DocumentCode :
3417818
Title :
A fast algorithm for computing the Euler number of an image and its VLSI implementation
Author :
Dey, Sabyasachi ; Bhattacharya, Bhargab B. ; Kundu, Malay K. ; Acharya, Tinku
Author_Institution :
Indian Stat. Inst., Calcutta, India
fYear :
2000
fDate :
2000
Firstpage :
330
Lastpage :
335
Abstract :
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×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
Keywords :
VLSI; computational complexity; digital signal processing chips; image processing; integrated circuit layout; integrated logic circuits; logic CAD; network topology; parallel algorithms; quadtrees; recursive functions; Euler number; VLSI chip; VLSI implementation; algorithm; binary image; divide-and-conquer paradigm; fast algorithm; image processing; parallel processing; topological feature; Character recognition; Computer architecture; Concurrent computing; Digital images; Image databases; Image processing; Image recognition; Information retrieval; Shape; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI Design, 2000. Thirteenth International Conference on
Conference_Location :
Calcutta
ISSN :
1063-9667
Print_ISBN :
0-7695-0487-6
Type :
conf
DOI :
10.1109/ICVD.2000.812628
Filename :
812628
Link To Document :
بازگشت