An Improved Algorithm for Labeling Connected Components in a Binary Image

Abstract

In this note, we present an improved algorithm to Schwartz, Sharir and Siegel's algorithm (8) for labeling the connected components of a binary image. Our algorithm uses the same bracket marking mechanisms as is used in the original algorithm to associate equivalent groups. The main improvement of our algorithm is that it reduces the three scans on each line required by the original algorithm in its first pass into only one scan by using a recursive group-boundary dynamic tracking technique, while maintaining the computation on each pixel during scan still a constant time. This algorithm is fast enough to handle images in real time and simple enough to allow an easy and very economical hardware implementation. Keywords: Image intensification; Television display screens.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1989
Accession Number
ADA210100

Entities

People

  • Xue D. Yang

Organizations

  • Cornell University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • C Programming Language
  • Computations
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Language
  • New York
  • Parallel Computing
  • Pipelines
  • Programming Languages
  • Sequences
  • Universities

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Approximation Theory.
  • Human-Computer Interaction (HCI).