A 3D Segmentation Algorithm for Ellipsoidal Shapes - Application to Nuclei Extraction
Emmanuel Soubies, Pierre Weiss, Xavier Descombes
2013
Abstract
We propose some improvements of the Multiple Birth and Cut algorithm (MBC) in order to extract nuclei in 2D and 3D images. This algorithm based on marked point processes was proposed recently in (Gamal Eldin et al., 2012). We introduce a new contrast invariant energy that is robust to degradations encountered in fluorescence microscopy (e.g. local radiometry attenuations). Another contribution of this paper is a fast algorithm to determine whether two ellipses (2D) or ellipsoids (3D) intersect. Finally, we propose a new heuristic that strongly improves the convergence rates. The algorithm alternates between two birth steps. The first one consists in generating objects uniformly at random and the second one consists in perturbing the current configuration locally. Performance of this modified birth step is evaluated and examples on various image types show the wide applicability of the method in the field of bio-imaging.
References
- Baddeley, A. and Van Lieshout, M. (1993). Stochastic geometry models in high-level vision. Journal of Applied Statistics, 20(5-6):231-256.
- Bertsekas, D. (1999). Nonlinear programming.
- Boykov, Y. and Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell., 26(9):1124-1137.
- Boykov, Y., Veksler, O., and Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:1222-1239.
- Descombes, X. (2011). Stochastic geometry for image analysis. Wiley/Iste, x. descombes edition.
- Dong, G. and Acton, S. (2007). Detection of rolling leukocytes by marked point processes. Journal of Electronic Imaging, 16:033013.
- Gamal-Eldin, A., Descombes, X., Charpiat, G., and Zerubia, J. (2011). A fast multiple birth and cut algorithm using belief propagation. In Image Processing (ICIP), 2011 18th IEEE International Conference on, pages 2813-2816. IEEE.
- Gamal Eldin, A., Descombes, X., Charpiat, G., Zerubia, J., et al. (2012). Multiple birth and cut algorithm for multiple object detection. Journal of Multimedia Processing and Technologies.
- Green, P. J. (1995). Reversible jump markov chain monte carlo computation and bayesian model determination. Biometrika, 82:711-732.
- Kolmogorov, V. and Zabih, R. (2004). What energy functions can be minimized via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:65-81.
- Nesterov, Y. (2004). Introductory lectures on convex optimization: A basic course, volume 87. Springer.
- Perrin, G., Descombes, X., and Zerubia, J. (2005). A marked point process model for tree crown extraction in plantations. In Image Processing, 2005. ICIP 2005. IEEE International Conference on, volume 1, pages I-661. IEEE.
Paper Citation
in Harvard Style
Soubies E., Weiss P. and Descombes X. (2013). A 3D Segmentation Algorithm for Ellipsoidal Shapes - Application to Nuclei Extraction . In Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-8565-41-9, pages 97-105. DOI: 10.5220/0004308100970105
in Bibtex Style
@conference{icpram13,
author={Emmanuel Soubies and Pierre Weiss and Xavier Descombes},
title={A 3D Segmentation Algorithm for Ellipsoidal Shapes - Application to Nuclei Extraction},
booktitle={Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2013},
pages={97-105},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004308100970105},
isbn={978-989-8565-41-9},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - A 3D Segmentation Algorithm for Ellipsoidal Shapes - Application to Nuclei Extraction
SN - 978-989-8565-41-9
AU - Soubies E.
AU - Weiss P.
AU - Descombes X.
PY - 2013
SP - 97
EP - 105
DO - 10.5220/0004308100970105