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



Document title: Performance Analysis of Simulated Annealing Cooling Schedules in the Context of Dense Image Matching
Journal: Computación y sistemas
Database: PERIÓDICA
System number: 000423340
ISSN: 1405-5546
Authors: 1
1
Institutions: 1Taif University, College of Computers and Information Technology, Taif. Arabia Saudita
2University of Sfax, Multimedia Information Systems and Advanced Computing Laboratory, Sfax. Túnez
Year:
Season: Jul-Sep
Volumen: 21
Number: 3
Country: México
Language: Inglés
Document type: Artículo
Approach: Aplicado, descriptivo
English abstract Stochastic optimization is widely used in combinatorial computer vision problems, and many variant 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
Disciplines: Ciencias de la computación
Keyword: Procesamiento de datos,
Recocido simulado,
Acoplamiento denso,
Optimización
Keyword: Data processing,
Simulated annealing,
Dense matching,
Optimization
Full text: Texto completo (Ver HTML) Texto completo (Ver PDF)