Bounded irregular pyramid: a new structure for color image segmentation

Pyramid segmentation algorithms revisited

“…Besides, if the classical irregular pyramids achieves these results in exchange for computational efficiency, the new approaches have increased their efficiency and performance. Thus, the height reduction achieved by the hierarchy of partitions [1], the computational efficiency of the combinatorial pyramid [8], the efficient region growing control achieved with the Moran test [13] or the combination of different procedures for uniform or non-uniform regions [12,14] are several recently proposed strategies that have increased the global performance of irregular pyramid-based segmentation approaches. modified to deal with HSI images.…”

“…The bounded irregular pyramid (BIP) [14] is a hierarchical structure that merges characteristics from regular and irregular pyramids. Its data structure is a combination of the simplest regular and irregular structures: the 2 × 2/4 regular one and the simple graph irregular representation.…”

“…Unforced linking [9] has been used in the linked pyramid to select region roots at different pyramid levels. We also include comparisons with six segmentation algorithms based on irregular pyramids: the classical RAG hierarchy employed by Bertolino and Montanvert [61] (ClaIPyr), the localized pyramid [12] (LocIPyr); the segmentation algorithm proposed by Lallich et al [13] (MorIPyr), the bounded irregular pyramid [14] (BouIPyr), the hierarchy of image partitions by dual graph contraction [1,6] (HieIPyr) and the hierarchical segmentation algorithm based on combinatorial pyramids proposed by Brun and Kropatsch [8] (ComIPyr). The two regular pyramid-based algorithms and the bounded irregular pyramid employ the HSI colour distance to perform the segmentation.…”

“…Therefore, they do not efficiently run in this sequential computer. However, the algorithms proposed by Marfil et al [14] and Brun and Kropatsch [8] are based on decimation techniques more suited to sequential computing. Specially, the unionfind process has proven to be very efficient when run on sequential machines.…”

“…Thus, the pyramid size cannot be bounded and hence neither can the time to execute local operations at each level [10]. This problem has been resolved by recently proposed strategies [8,[11][12][13][14].…”