Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
Author(s)
Raviv, T. Riklin; Ljosa, V.; Conery, Annie L.; Ausubel, Frederick M.; Carpenter, Anne E.; Golland, Polina; Wahlby, C.; ... Show more Show less
DownloadGolland_Morphology-guided graph.pdf (1.083Mb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2010Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Medical Image Computing and Computer-Assisted Intervention – MICCAI 2010
Publisher
Springer-Verlag Berlin Heidelberg
Citation
Raviv, T. Riklin, V. Ljosa, A. L. Conery, F. M. Ausubel, A. E. Carpenter, P. Golland, and C. Wahlby. “Morphology-Guided Graph Search for Untangling Objects: C. Elegans Analysis.” in Medical Image Computing and Computer-Assisted Intervention – MICCAI 2010, Part III. Edited by Tianzi Jiang, Nassir Navab, Josien P. W. Pluim, and Max A Viergever. Springer-Verlag Berlin Heidelberg, (Lecture Notes in Computer Science; volume 6363) (2010): 634–641.
Version: Author's final manuscript
ISBN
978-3-642-15710-3
978-3-642-15711-0
ISSN
0302-9743
1611-3349