A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast sequential rainfalling watershed segmentation algorithm
ACIVS'05 Proceedings of the 7th international conference on Advanced Concepts for Intelligent Vision Systems
Hybrid image segmentation using watersheds and fast region merging
IEEE Transactions on Image Processing
Regions adjacency graph applied to color image segmentation
IEEE Transactions on Image Processing
Tracking multiple objects using moving snakes
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Mixture models based background subtraction for video surveillance applications
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
| Hi-index | 0.01 |
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.