Show simple item record

dc.contributor.authorYang, Xue Dongen_US
dc.date.accessioned2007-04-23T17:42:40Z
dc.date.available2007-04-23T17:42:40Z
dc.date.issued1989-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-981en_US
dc.identifier.urihttps://hdl.handle.net/1813/6897
dc.description.abstractIn 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 mechanism 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.en_US
dc.format.extent1020440 bytes
dc.format.extent268953 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Improved Algorithm for Labeling Connected Components in a Binary Imageen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics