Abstract
This paper presents a new segmentation technique for color images. It relies on building an irregular pyramid into a regular one, presenting only nodes associated to homogeneous color regions. Hence, the size of the irregular pyramid is bounded. Segmentation is performed by rearranging the set of links among pyramid nodes. Unlike other hierarchical methods based on relinking procedures, our algorithm does not operate in an iterative way and it preserves region connectivity.
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 callDisclaimer: 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.
