By Topic

Finding connected components in digital images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Khanna, V. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India ; Gupta, P. ; Hwang, C.J.

An efficient algorithm is presented to label the connected components in an array representation of 2D 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 (lower) bound the size of the table to [N/2]+1 for an N×N image. It is also shown that the maintenance of the table has an overall linear amortized cost

Published in:

Information Technology: Coding and Computing, 2001. Proceedings. International Conference on

Date of Conference:

Apr 2001