14 March 2005 Optimized mean shift algorithm for color segmentation in image sequences
Author Affiliations +
Abstract
The application of the mean shift algorithm to color image segmentation has been proposed in 1997 by Comaniciu and Meer. We apply the mean shift color segmentation to image sequences, as the first step of a moving object segmentation algorithm. Previous work has shown that it is well suited for this task, because it provides better temporal stability of the segmentation result than other approaches. The drawback is higher computational cost. For speed up of processing on image sequences we exploit the fact that subsequent frames are similar and use the cluster centers of previous frames as initial estimates, which also enhances spatial segmentation continuity. In contrast to other implementations we use the originally proposed CIE LUV color space to ensure high quality segmentation results. We show that moderate quantization of the input data before conversion to CIE LUV has little influence on the segmentation quality but results in significant speed up. We also propose changes in the post-processing step to increase the temporal stability of border pixels. We perform objective evaluation of the segmentation results to compare the original algorithm with our modified version. We show that our optimized algorithm reduces processing time and increases the temporal stability of the segmentation.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Werner Bailer, Werner Bailer, Peter Schallauer, Peter Schallauer, Harald Bergur Haraldsson, Harald Bergur Haraldsson, Herwig Rehatschek, Herwig Rehatschek, } "Optimized mean shift algorithm for color segmentation in image sequences", Proc. SPIE 5685, Image and Video Communications and Processing 2005, (14 March 2005); doi: 10.1117/12.586945; https://doi.org/10.1117/12.586945
PROCEEDINGS
8 PAGES


SHARE
Back to Top