Multiple Birth and Cut Algorithm for Point Process Optimization

TL;DR: A new optimization method is described which combines the recently developed Multiple Birth and Death algorithm and the Graph-Cut algorithm and is validated on the counting problem of flamingos in colony, where the algorithm outperforms the performance of the MBD algorithm.

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 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.