Applying incremental learning to parallel image segmentation
Charron, C., Hicks, Y. and Hall, P., 2009. Applying incremental learning to parallel image segmentation. In: 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009. IEEE, pp. 2064-2071.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
Segmenting large or multiple images is time and memory consuming. These issues have been addressed in the past by implementing parallel versions of popular algorithms such as Graph Cuts and Mean Shift. Here, we propose to use an incremental Gaussian Mixture Model (GMM) learning algorithm for parallel image segmentation. We show that our approach allows us to reduce the memory requirements dramatically whilst obtaining high quality of segmentation. We also compare memory, time and quality of the performance of our approach and several other state of the art segmentation algorithms in a rigorous set of experiments, which produce favorable results.
|Item Type||Book Sections|
|Creators||Charron, C., Hicks, Y. and Hall, P.|
|Departments||Faculty of Science > Computer Science|
|Additional Information||2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009. 27 September - 4 October 2009. Kyoto, Japan.|
Actions (login required)