Tammy Riklin-Raviv, Vebjorn Ljosa, Annie L. Conery, Frederick M. Ausubel, Anne E. Carpenter, Polina Golland, and Carolina Wählby:
“Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis,”
in Proceedings of the 13th International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI), p. 634-641, 2010, doi:10.1007/978-3-642-15711-0_79.
We present a novel approach for extracting cluttered objects based on their morphological properties. Speciﬁcally, we address the problem of untangling C. 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 overlaps. The worm likelihood measure is deﬁned 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 ratio.