Variable Pyramid Structures for Image Segmentation

Linked pyramid structures have proved to be a useful tool in digital image processing for many applicatins because of their ability to face problems at different levels of detail. Some variations suggested by usage to existent pyramid algorithms have been investigated for the segmentation of compact objects in noisy IR images. In particular, the efficacy of increasing the span at the very last iterations in order to correct the link deficiency of the boundary nodes is reported. We also report about a method which separate segment roots at any level in the pyramid and mergess the segments under the constraint of the maximum number of regions to be distinguished. The method is applied to IR image segmentation and comparative results are given.