Algorithms for image component labelling on SIMD mesh-connected computers

Journal Article · Thu Feb 01 04:00:00 EST 1990 · IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)

DOI:https://doi.org/10.1109/12.45215· OSTI ID:7019959

Cypher, R E; Snyder, L ^[1]; Sanz, J L.C. ^[2]

---

1. Washington Univ., Seattle, WA (USA). Dept. of Computer Science
2. Dept. of Computer Science, IBM Almaden Research Center, San Jose, CA (US)

Two new parallel algorithms are presented for the problem of labeling the connected components of a binary image. The machine model is an SIMD two-dimensional mesh-connected computer consisting of an N {times} N array of processing elements, each containing a single pixel of an N {times} N image. Both new algorithms use a local shrinking operation defined by Levialdi and have time complexities of O(N log N) bit operations, making them the fastest local algorithms for the problem. Compared to other approaches having similar or better asymptotic time complexities, this local approach dramatically simplifies the algorithms and reduces the constants of proportionality by nearly tow orders of magnitude, thus making them the first practical algorithms for the problem. The two algorithms differ in the amount of memory required per processing element; the first uses O(N) bits while the second employs a Novel compression scheme to reduce the requirement to O(log N) bits.

• OSTI ID: 7019959
• Journal Information: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA), Journal Name: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA) Vol. 39:2; ISSN ITCOB; ISSN 0018-9340
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTER NETWORKS
DESIGN
IMAGE PROCESSING
MATHEMATICAL LOGIC
MESH GENERATION
PARALLEL PROCESSING
PROCESSING
PROGRAMMING
TWO-DIMENSIONAL CALCULATIONS