Bounded irregular pyramid: a new structure for color image segmentation

摘要

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. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.