NDLI: A general approach to connected-component labeling for arbitrary image representations

Content Provider	ACM Digital Library
Author	Dillencourt, Michael B. Samet, Hanan Tamminen, Markku
Copyright Year	1992
Abstract	An improved and general approach to connected-component labeling of images is presented. The algorithm presented in this paper processes images in predetermined order, which means that the processing order depends only on the image representation scheme and not on specific properties of the image. The algorithm handles a wide variety of image representation schemes (rasters, run lengths, quadrees, bintrees, etc.). How to adapt the standard UNION-FIND algorithm to permit reuse of temporary labels is shown. This is done using a technique called age balancing, in which, when two labels are merged, the older label becomes the father of the younger label. This technique can be made to coexist with the more conventional rule of weight balancing, in which the label with more descendants becomes the father of the label with fewer descendants. Various image scanning orders are examined and classified. It is also shown that when the algorithm is specialized to a pixel array scanned in raster order, the total processing time is linear in the number of pixels. The linear-time processing time follows from a special property of the UNION-FIND algorithm, which may be of independent interest. This property states that under certain restrictions on the input, UNION-FIND runs in time linear in the number of FIND and UNION operations. Under these restrictions, linear-time performance can be achieved without resorting to the more complicated Gabow-Tarjan algorithm for disjoint set union.
Starting Page	253
Ending Page	280
Page Count	28
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/128749.128750
Journal	Journal of the ACM (JACM)
Volume Number	39
Issue Number	2
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1992-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Connected Component Labeling Using Quadtrees

An efficient and fast parallel-connected component algorithm

A general approach to dynamic packet routing with bounded buffers

A Unified Approach to Path Problems

Queueing Models for Computer Systems Connected by a Communication Line

Finding Zeros of Arbitrary Functions

Computer Approaches to the Representations of Lie Algebras

A Counting Approach to Lower Bounds for Selection Problems

A unified approach to approximation algorithms for bottleneck problems

A general approach to connected-component labeling for arbitrary image representations

Similar Documents

Connected Component Labeling Using Quadtrees

An efficient and fast parallel-connected component algorithm

A general approach to dynamic packet routing with bounded buffers

A Unified Approach to Path Problems

Queueing Models for Computer Systems Connected by a Communication Line

Finding Zeros of Arbitrary Functions

Computer Approaches to the Representations of Lie Algebras

A Counting Approach to Lower Bounds for Selection Problems

A unified approach to approximation algorithms for bottleneck problems

A general approach to connected-component labeling for arbitrary image representations