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.