Morphology-Guided Graph Search for Untangling Objects: C. Elegans Analysis

T. Riklin Raviv, V. Ljosa, A. L. Conery, F. M. Ausubel, A. E. Carpenter, P. Golland, C. Wählby

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

Abstract

We present a novel approach for extracting cluttered objects based on their morphological properties. Specifically, we address the problem of untangling Caenorhabditis elegans clusters in high-throughput screening experiments. We represent the skeleton of each worm cluster by a sparse directed graph whose vertices and edges correspond to worm segments and their adjacencies, respectively. We then search for paths in the graph that are most likely to represent worms while minimizing overlap. The worm likelihood measure is defined on a low-dimensional feature space that captures different worm poses, obtained from a training set of isolated worms. We test the algorithm on 236 microscopy images, each containing 15 C. elegans worms, and demonstrate successful cluster untangling and high worm detection accuracy.

Original languageEnglish
Title of host publicationMedical Image Computing and Computer-Assisted Intervention, MICCAI2010 - 13th International Conference, Proceedings
PublisherSpringer Berlin Heidelberg
Pages634-641
Number of pages8
EditionPART 3
ISBN (Electronic)978-3-642-15711-0
ISBN (Print)3642157106, 9783642157103
DOIs
StatePublished - 22 Nov 2010
Externally publishedYes
Event13th International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2010 - Beijing, China
Duration: 20 Sep 201024 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume6363 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2010
Country/TerritoryChina
CityBeijing
Period20/09/1024/09/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Morphology-Guided Graph Search for Untangling Objects: C. Elegans Analysis'. Together they form a unique fingerprint.

Cite this