Abstract
Component trees have many applications. We introduce a new component tree computation algorithm, applicable to 4-/8-connectivity and 6-connectivity. The algorithm consists of two steps: building level line trees using an optimized top-down algorithm, and computing components from level lines by a novel line-by-line approach. As compared with traditional component computation algorithms, the new algorithm is fast for images of limited levels. It represents components by level lines, offering boundary information which traditional algorithms do not provide.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE transactions on pattern analysis and machine intelligence
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.
