Multiple Birth and Cut Algorithm for Multiple Object Detection

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 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.
Liste complète des métadonnées

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00616371
Contributor : Ahmed Gamal Eldin <>
Submitted on : Monday, August 22, 2011 - 12:20:57 PM
Last modification on : Monday, November 5, 2018 - 3:52:01 PM
Document(s) archivé(s) le : Monday, November 12, 2012 - 3:42:04 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00616371, version 1

Collections

Citation

Ahmed Gamal Eldin, Xavier Descombes, Guillaume Charpiat, Josiane Zerubia. Multiple Birth and Cut Algorithm for Multiple Object Detection. Journal of Multimedia Processing and Technologies, 2012. ⟨hal-00616371⟩

Share

Metrics

Record views

1260

Files downloads

716