3D Image Segmentation Using the Bounded Irregular Pyramid

Abstract

This paper presents a novel pyramid approach for fast segmentation of 3D images. A pyramid is a hierarchy of successively reduced graphs whose efficiency is strongly influenced by the data structure that codes the information within the pyramid and the decimation process used to build a graph from the graph below. Depending on these two features, pyramids have been classified as regular and irregular ones. The proposed approach extends the idea of the Bounded Irregular Pyramid (BIP) [5] to 3D images. Thus, the 3D-BIP is a mixture of both types of pyramids whose goal is to combine their advantages: the low computational cost of regular pyramids with the consistent and useful results provided by the irregular ones. Specifically, its data structure combines a regular decimation process with an union-find strategy to build the successive 3D levels of the structure. Experimental results show that this approach is able to provide a low---level segmentation of 3D images at a low computational cost.