Adaptive simulated annealing for energy minimization problem in a marked point process application

G. Perrin (1) , Xavier Descombes (2) , Josiane Zerubia (2)

1 MAS - Mathématiques Appliquées aux Systèmes - EA 4037
2 ARIANA - Inverse problems in earth monitoring

We use marked point processes to detect an unknown number of trees from high resolution aerial images. This is in fact an energy minimization problem, where the energy contains a prior term which takes into account the geometrical properties of the objects, and a data term to match these objects to the image. This stochastic process is simulated via a Reversible Jump Markov Chain Monte Carlo procedure, which embeds a Simulated Annealing scheme to extract the best configuration of objects. We compare here different cooling schedules of the Simulated Annealing algorithm which could provide some good minimization in a short time. We also study some adaptive proposition kernels.

Mots clés: GLOBAL OPTIMIZATION; CONVERGENCE; ALGORITHMS; SCHEDULES

Domaines: Algorithme et structure de données [cs.DS]

G. Perrin, Xavier Descombes, Josiane Zerubia. Adaptive simulated annealing for energy minimization problem in a marked point process application. International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, Nov 2005, St Augustine, United States. pp.3-17, ⟨10.1007/11585978_1⟩. ⟨hal-00113382⟩