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

  title={Graph Cut Based Segmentation of Predefined Shapes: Applications to Biological Imaging},
  author={Emmanuel Soubies and Pierre Weiss and Xavier Descombes},
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… 
Segmentation of cell structures using Model-Based Set Covering with iterative reweighting
A new method for cell segmentation is presented which combines a marked point process model with a combinatorics-based method of finding global optima and is found to improve upon previous approaches.
Segmentation of cell nuclei using intensity-based model fitting and sequential convex programming
A convex model-based approach for the segmentation of cell nuclei, which exploits both shape and intensity information, is introduced, which relies on a fast second-order optimization scheme to solve a sequence of convex programs and estimate the globally optimal solution based on the image intensities.
Application of the Maximum Flow–Minimum Cut Algorithm to Segmentation and Clustering of Materials Datasets
This work proposes the application of graph cutting as a versatile technique that can provide solutions to numerous materials data analysis problems so long as a network of nodes can be effectively established within the model system.
Planetary crater detection and registration using marked point processes, graph cut algorithms, and wavelet transforms
This paper addresses the problem of semi-automatic image registration on planetary images by proposing a joint feature-based and area-based approach, which matches the craters extracted from the images based on a generalized Hausdorff distance.
Crater Detection and Registration of Planetary Images Through Marked Point Processes, Multiscale Decomposition, and Region-Based Analysis
A new framework for crater detection based on marked point processes (MPPs) that can be used for planetary image registration is developed and two different methods—one based on birth–death processes and region-of-interest analysis and the other based on graph cuts and decimated wavelets—are developed within the proposed framework.
A Survey of Sperm Detection Techniques in Microscopic Videos
This survey comprehensively analyses studies focus on target detection in CASA since 1988 to help CASA obtain more objective and quantitative analysis results rapidly.


Stochastic geometry for image analysis
This book develops the stochastic geometry framework for image analysis purpose. Two main frameworks are described: marked point process and random closed sets models. We derive the main issues for
Detection of rolling leukocytes by marked point processes
An MPP-based approach that aims at improving both the accuracy and efficiency of the detection process by means of exploiting the spatial interrelationships and can serve as a fully automated substitute to the tedious and time-consuming manual rolling leukocyte detection process.
Object Extraction Using a Stochastic Birth-and-Death Dynamics in Continuum
This framework is developed to address image processing problems consisting in detecting a configuration of objects from a digital image and proves the convergence of the continuous process and proposes a discrete scheme converging to the continuous case.
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision, comparing the running times of several standard algorithms, as well as a new algorithm that is recently developed.
A marked point process model for tree crown extraction in plantations
This work presents a framework to extract tree crowns from remotely sensed data, especially in plantation images, using stochastic geometry, and presents results on optical aerial images of poplars provided by IFN.
Multiple Birth and Cut Algorithm for Multiple Object Detection
A new optimization method which is described, which combines the recently developed Multiple Birth and Death algorithm and the Graph-Cut algorithm, and it is demonstrated that by proposing good candidates throughout the selection phase in the birth step, the speed of convergence is increased.
A fast Multiple Birth and Cut algorithm using belief propagation
This paper presents a faster version of the newly proposed Multiple Birth and Cut (MBC) algorithm, and shows that, by proposing good candidates in the birth step of this algorithm, the speed of convergence is increased.
Stochastic geometry models in high-level vision
We survey the use of Markov models from stochastic geometry as priors in ‘high-level’ computer vision, in direct analogy with the use of discrete Markov random fields in ‘low-level’ vision. There are
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some fixed
Introductory Lectures on Convex Optimization - A Basic Course
It was in the middle of the 1980s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization, and it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments.