Multiple Birth and Cut Algorithm for Point Process Optimization - Archive ouverte HAL
Communication Dans Un Congrès Année : 2010

Multiple Birth and Cut Algorithm for Point Process Optimization

Ahmed Gamal Eldin
  • Fonction : Auteur
  • PersonId : 879000
X. Descombes
Josiane Zerubia

Résumé

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 the energy minimization of an object based model, the marked point process. We compare the MBC to the MBD showing the advantages and disadvantages, where the most important advantage is the reduction of the number of parameters. We validated our algorithm on the counting problem of flamingos in colony, where our algorithm outperforms the performance of the MBD algorithm.
Fichier principal
Vignette du fichier
paper.pdf (1.39 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00516305 , version 1 (09-09-2010)
inria-00516305 , version 2 (21-09-2010)
inria-00516305 , version 3 (15-10-2010)

Identifiants

  • HAL Id : inria-00516305 , version 3

Citer

Ahmed Gamal Eldin, X. Descombes, Josiane Zerubia. Multiple Birth and Cut Algorithm for Point Process Optimization. Signal-Image Technology and Internet-Based Systems (SITIS 2010), Dec 2010, Kuala Lumpur, Malaysia. ⟨inria-00516305v3⟩
298 Consultations
454 Téléchargements

Partager

More