Graph Cut Based Segmentation of Predefined Shapes: Applications to Biological Imaging

Emmanuel Soubies 1 Pierre Weiss 2 Xavier Descombes 1
1 MORPHEME - Morphologie et Images
CRISAM - Inria Sophia Antipolis - Méditerranée , IBV - Institut de Biologie Valrose : U1091, Laboratoire I3S - SIS - Signal, Images et Systèmes
Abstract : We propose an algorithm to segment 2D ellipses or 3D ellipsoids. This problem is of fundamental importance in various applications of cell biology. The algorithm consists of minimizing a contrast invariant energy defined on sets of non overlapping ellipsoids. This highly non convex problem is solved by combining a stochastic approach based on marked point processes and a graph-cut algorithm that selects the best admissible configuration. In order to accelerate the computing times, we delineate fast algorithms to assess whether two ellispoids intersect or not and various heuristics to improve the convergence rate.
Document type :
Book sections
Complete list of metadatas

https://hal.inria.fr/hal-01088384
Contributor : Emmanuel Soubies <>
Submitted on : Thursday, November 27, 2014 - 6:28:58 PM
Last modification on : Friday, October 25, 2019 - 1:57:28 AM

Identifiers

Citation

Emmanuel Soubies, Pierre Weiss, Xavier Descombes. Graph Cut Based Segmentation of Predefined Shapes: Applications to Biological Imaging. Pattern Recognition Applications and Methods., 318, Springer-Verlag, pp.153-170, 2015, Advances in Intelligent Systems and Computing, 978-3-319-12610-4. ⟨10.1007/978-3-319-12610-4_10⟩. ⟨hal-01088384⟩

Share

Metrics

Record views

559