Scientific Programming

Scientific Programming / 2004 / Article
Special Issue

Distributed Computing and Applications

View this Special Issue

Open Access

Volume 12 |Article ID 701965 | https://doi.org/10.1155/2004/701965

J.R. Rommelse, H.X. Lin, T.F. Chan, "Efficient Active Contour and K-Means Algorithms in Image Segmentation", Scientific Programming, vol. 12, Article ID 701965, 20 pages, 2004. https://doi.org/10.1155/2004/701965

Efficient Active Contour and K-Means Algorithms in Image Segmentation

Received19 Jul 2004
Accepted19 Jul 2004

Abstract

In this paper we discuss a classic clustering algorithm that can be used to segment images and a recently developed active contour image segmentation model. We propose integrating aspects of the classic algorithm to improve the active contour model. For the resulting CVK and B-means segmentation algorithms we examine methods to decrease the size of the image domain. The CVK method has been implemented to run on parallel and distributed computers. By changing the order of updating the pixels, it was possible to replace synchronous communication with asynchronous communication and subsequently the parallel efficiency is improved.

Copyright © 2004 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views360
Downloads387
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.