Streaming level set algorithm for 3D segmentation of confocal microscopy images.

Annu Int Conf IEEE Eng Med Biol Soc

Systems Biology Department, Harvard Medical School, 200 Longwood Avenue, Boston, MA 02215, USA.

Published: April 2010

We present a high performance variant of the popular geodesic active contours which are used for splitting cell clusters in microscopy images. Previously, we implemented a linear pipelined version that incorporates as many cues as possible into developing a suitable level-set speed function so that an evolving contour exactly segments a cell/nuclei blob. We use image gradients, distance maps, multiple channel information and a shape model to drive the evolution. We also developed a dedicated seeding strategy that uses the spatial coherency of the data to generate an over complete set of seeds along with a quality metric which is further used to sort out which seed should be used for a given cell. However, the computational performance of any level-set methodology is quite poor when applied to thousands of 3D data-sets each containing thousands of cells. Those data-sets are common in confocal microscopy. In this work, we explore methods to stream the algorithm in shared memory, multi-core environments. By partitioning the input and output using spatial data structures we insure the spatial coherency needed by our seeding algorithm as well as improve drastically the speed without memory overhead. Our results show speed-ups up to a factor of six.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3136103PMC
http://dx.doi.org/10.1109/IEMBS.2009.5333522DOI Listing

Publication Analysis

Top Keywords

confocal microscopy
8
microscopy images
8
spatial coherency
8
streaming level
4
level set
4
set algorithm
4
algorithm segmentation
4
segmentation confocal
4
images high
4
high performance
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!