| Revue: | Computación y sistemas |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000423340 |
| ISSN: | 1405-5546 |
| Autores: | Mahdi, Walid1 Ouali, Mohammed1 |
| Instituciones: | 1Taif University, College of Computers and Information Technology, Taif. Arabia Saudita 2University of Sfax, Multimedia Information Systems and Advanced Computing Laboratory, Sfax. Túnez |
| Año: | 2017 |
| Periodo: | Jul-Sep |
| Volumen: | 21 |
| Número: | 3 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Aplicado, descriptivo |
| Resumen en inglés | 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 |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos, Recocido simulado, Acoplamiento denso, Optimización |
| Keyword: | Data processing, Simulated annealing, Dense matching, Optimization |
| Texte intégral: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
