Abstract
AbstractGiven a binary image of n pixels, assign integral labels to all pixels so that any background pixel has label 0 and any two foreground pixels have the same positive integral labels, if and only if they belong to the same connected components. This problem is referred to as ’Connected Components Labeling’ and it is one of the most fundamental problems in image processing and analysis. This paper presents a new algorithmic framework for the problem. From an algorithmic point of view, the problem can be solved in O(n) time and O(n) space. We propose new algorithms which use smaller work space without much sacrifice of the running time. More specifically, assuming that an input binary image is given by a read-only array, our algorithm outputs correct labels in the raster order in O(n logn) time using only \(O(\sqrt{n})\) work space. Some applications of the algorithms are also given.KeywordsConnected componentLimited work spaceComputational complexity
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.