A Fast Dynamic Border Linking Algorithm for Region Merging
In this paper we present our region merging algorithm that is built with special attention on speed but still includes all the necessary functionality to use a wide range of both region based and border based dissimilarity criteria. The algorithm includes a novel method to dynamically link the common borders between two segments during the region merging. The main part of the paper will concentrate on the efficient data structures and functions that are needed to obtain a fast region merging algorithm. Also, all the special situations that can occur in the segment topology are completely covered. We give a detailed report on the execution times of the algorithm and show some of the segmentation results we obtained.
KeywordsSegmentation Result Outer Contour Start Node Neighboring Segment Common Border
Unable to display preview. Download preview PDF.
- 5.Pires, R., De Smet, P., Philips, W.: Watershed segmentation and region merging. In: IS&T/SPIE Electronic Imaging, Visual Communications and Image Processing, vol. 5308, pp. 1127–1135 (2004)Google Scholar