loading...
Finding Connected Components in Digital Images
Las Vegas, NV April 02-April 04
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2001.918871International Conference on Informati ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Vikrant Khanna, Indian Institute of Technology Kanpur
P . Gupta, Indian Institute of Technology Kanpur
C. J. Hwang, Southwest Texas State University
Abstract: An efficient algorithm is presented to label the Connected Components in array representation of 2-d images. A new data structure is suggested to maintain the equivalence table that makes use of a modified version of Union-Find algorithms. The operations supported by the equivalence table enable aggressive reuse of labels and bound the size of the table by \lfloor N/2 \rfloor + 1, for a N X N image. It is also shown that the maintenance of the table has an overall linear amortized cost.
Citation:
Vikrant Khanna, P . Gupta, C. J. Hwang, "Finding Connected Components in Digital Images," itcc, pp.0652, International Conference on Information Technology: Coding and Computing (ITCC '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.