A fast multiple birth and cut algorithm using belief propagation

Ahmed Gamal Eldin 1 Xavier Descombes 1 Guillaume Charpiat 2 Josiane Zerubia 1
1 ARIANA - Inverse problems in earth monitoring
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - SIS - Signal, Images et Systèmes
Abstract : In this paper, we present a faster version of the newly proposed Multiple Birth and Cut (MBC) algorithm. MBC is an optimization method applied to the energy minimization of an object based model, defined by a marked point process. We show that, by proposing good candidates in the birth step of this algorithm, the speed of convergence is increased. The algorithm starts by generating a dense configuration in a special organization, the best candidates are selected using the belief propagation algorithm. Next, this candidate configuration is combined with the current configuration using binary graph cuts as presented in the original version of the MBC algorithm. We tested the performance of our algorithm on the particular problem of counting flamingos in a colony, and show that it is much faster with the modified birth step.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/inria-00592446
Contributor : Ahmed Gamal Eldin <>
Submitted on : Thursday, May 12, 2011 - 3:13:08 PM
Last modification on : Monday, November 5, 2018 - 3:52:01 PM
Long-term archiving on : Friday, November 9, 2012 - 11:15:45 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00592446, version 1

Collections

Citation

Ahmed Gamal Eldin, Xavier Descombes, Guillaume Charpiat, Josiane Zerubia. A fast multiple birth and cut algorithm using belief propagation. ICIP 2011 (International Conference on Image Processing), Sep 2011, Bruxelles, Belgium. ⟨inria-00592446⟩

Share

Metrics

Record views

469

Files downloads

216