Efficient active contour and K-means algorithms in image segmentation

J. R. Rommelse*, H. X. Lin, T. F. Chan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)101-120
Number of pages20
JournalScientific Programming
Issue number2
StatePublished - 2004
Externally publishedYes


  • Active contour model
  • Clustering algorithm
  • Image segmentation
  • Level set functions
  • Synchronous and asynchronous communication

ASJC Scopus subject areas

  • Software
  • Computer Science Applications


Dive into the research topics of 'Efficient active contour and K-means algorithms in image segmentation'. Together they form a unique fingerprint.

Cite this