Performance Analysis of Simulated Annealing Cooling Schedules in the Context of Dense Image Matching

Autores/as

  • Walid Mahdi Department of Computer Science, College of Computers and Information Technology, Taif University, P.O. Box 888, 21974
  • Seyyid Ahmed Medjahed University of Science and Technology Oran (USTO), Algeria
  • Mohammed Ouali Thales Canada Inc.

DOI:

https://doi.org/10.13053/cys-21-3-2553

Palabras clave:

Simulated annealing, dense matching, stereo matching, optimization

Resumen

Stochastic optimization is widely used in combinatorial computer vision problems, and many variants have been proposed. This contribution aims at analyzing and assessing several flavours of the simulated annealing algorithm. We particularly want to show the optimization performance, convergence speed, and quality of the solution with respect to the algorithm's parameters and cooling schedules. We also verify experimentally that the S.A. algorithm is a global method, i.e., it is able to lock a strong minimum regardless of the initialization. Performance evaluation is conducted in the context of stereo matching.

Descargas

Publicado

2017-09-28