Open Access

Fast Graph Partitioning Active Contours for Image Segmentation Using Histograms

EURASIP Journal on Image and Video Processing20102009:820986

DOI: 10.1155/2009/820986

Received: 10 April 2009

Accepted: 16 October 2009

Published: 26 January 2010


We present a method to improve the accuracy and speed, as well as significantly reduce the memory requirements, for the recently proposed Graph Partitioning Active Contours (GPACs) algorithm for image segmentation in the work of Sumengen and Manjunath (2006). Instead of computing an approximate but still expensive dissimilarity matrix of quadratic size, , for a 2D image of size and regular image tiles of size , we use fixed length histograms and an intensity-based symmetric-centrosymmetric extensor matrix to jointly compute terms associated with the complete dissimilarity matrix. This computationally efficient reformulation of GPAC using a very small memory footprint offers two distinct advantages over the original implementation. It speeds up convergence of the evolving active contour and seamlessly extends performance of GPAC to multidimensional images.

Publisher note

To access the full article, please see PDF.

Authors’ Affiliations

Department of Computer Science, University of Missouri


© S. K. Nath and K. Palaniappan. 2009

This article is published under license to BioMed Central Ltd. 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.