Finding Connected Components in Digital Images

	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 Vikrant Khanna Articles by P . Gupta Articles by C. J. Hwang

International Conference on Information Technology: Coding and Computing (ITCC '01)

Las Vegas, NV

April 02-April 04

ISBN: 0-7695-1062-0

	ASCII Text	x
	Vikrant Khanna, P . Gupta, C. J. Hwang, "Finding Connected Components in Digital Images," Information Technology: Coding and Computing, International Conference on, pp. 0652, International Conference on Information Technology: Coding and Computing (ITCC '01), 2001.

	BibTex	x
	@article{ 10.1109/ITCC.2001.918871, author = {Vikrant Khanna and P . Gupta and C. J. Hwang}, title = {Finding Connected Components in Digital Images}, journal ={Information Technology: Coding and Computing, International Conference on}, volume = {0}, year = {2001}, isbn = {0-7695-1062-0}, pages = {0652}, doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2001.918871}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Technology: Coding and Computing, International Conference on TI - Finding Connected Components in Digital Images SN - 0-7695-1062-0 SP EP A1 - Vikrant Khanna, A1 - P . Gupta, A1 - C. J. Hwang, PY - 2001 VL - 0 JA - Information Technology: Coding and Computing, International Conference on ER -

Vikrant Khanna, Indian Institute of Technology Kanpur

P . Gupta, Indian Institute of Technology Kanpur

C. J. Hwang, Southwest Texas State University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2001.918871

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

Peer Review Notice | Give Us Feedback

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