A fast multiple birth and cut algorithm using belief propagation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

A fast multiple birth and cut algorithm using belief propagation

Résumé

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.
Fichier principal
Vignette du fichier
paper.pdf (165.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00592446 , version 1 (12-05-2011)

Identifiants

  • HAL Id : inria-00592446 , version 1

Citer

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⟩
248 Consultations
224 Téléchargements

Partager

Gmail Facebook X LinkedIn More