Multiple Birth and Cut Algorithm for Multiple Object Detection

In this paper, we describe a new optimization method which we call Multiple Birth and Cut (MBC). It combines the recently developed Multiple Birth and Death (MBD) algorithm and the Graph-Cut algorithm. MBD and MBC optimization methods are applied to energy minimization of an object based model, the marked point process. We compare the MBC to the MBD showing their respective advantages and drawbacks, where the most important advantage of the MBC is the reduction of number of parameters. We demonstrate that by proposing good candidates throughout the selection phase in the birth step, the speed of convergence is increased. In this selection phase, the best candidates are chosen from object sets by a belief propagation algorithm. We validate our algorithm on the flamingo counting problem in a colony and demonstrate that our algorithm outperforms the MBD algorithm.

[1]  Davi Geiger,et al.  Mapping image restoration to a graph problem , 1999, NSIP.

[2]  Patrick Pérez,et al.  Interactive Image Segmentation Using an Adaptive GMMRF Model , 2004, ECCV.

[3]  Robert T. Collins,et al.  Marked point processes for crowd counting , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Josiane Zerubia,et al.  A Gibbs Point Process for Road Extraction from Remotely Sensed Images , 2004, International Journal of Computer Vision.

[5]  Josiane Zerubia,et al.  Automatic Flamingo detection using a multiple birth and death process , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[6]  Josiane Zerubia,et al.  Multiple Birth and Cut Algorithm for Point Process Optimization , 2010, 2010 Sixth International Conference on Signal-Image Technology and Internet Based Systems.

[7]  Davi Geiger,et al.  Occlusions, Discontinuities, and Epipolar Lines in Stereo , 1998, ECCV.

[8]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Adrian Baddeley,et al.  Modelling Spatial Point Patterns in R , 2006 .

[10]  Olga Veksler,et al.  Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[11]  A. Baddeley,et al.  Stochastic geometry models in high-level vision , 1993 .

[12]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[13]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[14]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[15]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Josiane Zerubia,et al.  Building Outline Extraction from Digital Elevation Models Using Marked Point Processes , 2007, International Journal of Computer Vision.

[18]  Josiane Zerubia,et al.  Extraction of arbitrarily-shaped objects using stochastic multiple birth-and-death dynamics and active contours , 2010, Electronic Imaging.

[19]  D. Stoyan,et al.  Fractals, random shapes and point fields : methods of geometrical statistics , 1996 .

[20]  P. Green.  Reversible jump Markov chain Monte Carlo computation and Bayesian model determination , 1995 .

[21]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Ingemar J. Cox,et al.  A maximum-flow formulation of the N-camera stereo correspondence problem , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[23]  Josiane Zerubia,et al.  Parameter Estimation for Marked Point Processes. Application to Object Extraction from Remote Sensing Images , 2009, EMMCVPR.

[24]  Yu Liu,et al.  Simulating Classic Mosaics with Graph Cuts , 2007, EMMCVPR.

[25]  Xavier Descombes,et al.  Author manuscript, published in "Journal of Mathematical Imaging and Vision (2009)" Object , 2008 .

[26]  van Marie-Colette Lieshout,et al.  Markov Point Processes and Their Applications , 2000 .

[27]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[28]  Pushmeet Kohli,et al.  Dynamic Graph Cuts for Efficient Inference in Markov Random Fields , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Vladimir Kolmogorov,et al.  Visual correspondence using energy minimization and mutual information , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[30]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[31]  Josiane Zerubia,et al.  2D and 3D Vegetation Resource Parameters Assessment using Marked Point Processes , 2006, 18th International Conference on Pattern Recognition (ICPR'06).