✦ LIBER ✦

High-Speed Algorithm for Component Labeling

✍ Scribed by Toshiyuki Gotoh; Yoshiyuki Ohta; Masumi Yoshida; Yoshiaki Shirai

Book ID: 112205968
Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 758 KB
Volume: 21
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.4690210507

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A high-speed labeling algorithm for rast

A high-speed labeling algorithm for raster-scanned type

✍ Yoshiyuki Okuyama; Yoshiki Kobayashi; Hiroshi Takenaga; Kazuyoshi Asada; Kazunor 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 931 KB

An EREW PRAM algorithm for image compone

An EREW PRAM algorithm for image component labeling

✍ Cypher, R.; Sanz, J.L.C.; Snyder, L. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 656 KB

A high speed systolic architecture for l

A high speed systolic architecture for labeling connected components in an image

✍ Ranganathan, N.; Mehrotra, R.; Subramanian, S. 📂 Article 📅 1995 🏛 Institute of Electrical and Electronics Engineers ⚖ 927 KB

Algorithms for realtime component labell

Algorithms for realtime component labelling of images

✍ Amelia Fong Lochovsky 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 990 KB

High-speed optical FSK modulator for opt

High-speed optical FSK modulator for optical packet labeling

✍ Kawanishi, T.; Higuma, K.; Fujita, T.; Ichikawa, J.; Sakamoto, T.; Shinada, S.; 📂 Article 📅 2005 🏛 Optical Society of America 🌐 English ⚖ 734 KB

Algorithms for connected component label

Algorithms for connected component labeling based on quadtrees

✍ Kunio Aizawa; Shojiro Tanaka; Koyo Motomura; Ryosuke Kadowaki 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract An algorithm of linear time complexity is presented to label connected components of a binary image by a quadtree. For a given node, the search for all adjacent nodes is carried out in __O__(1) (i.e., constant time complexity for the worst case) using our formerly presented algorithm in