Efficient active contour and K-means algorithms in image segmentation

Authors:
J. R. Rommelse;H. X. Lin;T. F. Chan
Affiliations:
Department of Applied Mathematical Analysis, Delft University of Technology, Delft, 2628 CD, The Netherlands, E-mail: J.R.Rommelse@ewi.tudelft.nl;Department of Applied Mathematical Analysis, Delft University of Technology, Delft, 2628 CD, The Netherlands, E-mail: H.X.Lin@ewi.tudelft.nl;Department of Mathematics, University of California, Los Angeles Los Angeles, CA 90095-1555, USA. E-mail: Chan@math.ucla.edu
Venue:
Scientific Programming - Distributed Computing and Applications
Year:
2004

Citing 9
Cited 2

A fast level set method for propagating interfaces

Journal of Computational Physics
Digital image processing

Digital image processing
Accelerating exact k-means algorithms with geometric reasoning

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast Marching Methods

SIAM Review
A remark on computing distance functions

Journal of Computational Physics
Rapid and accurate computation of the distance function using grids

Journal of Computational Physics
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model

International Journal of Computer Vision
X-means: Extending K-means with Efficient Estimation of the Number of Clusters

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Active contours without edges

IEEE Transactions on Image Processing

Intelligent segmentation method for real-time defect inspection system

Computers in Industry
Context-aware volume modeling of skeletal muscles

EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

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.