In this paper we discuss certain theoretical properties of the algorithm selection approach to the problem of semantic segmentation in<br />computer vision. High quality algorithm selection is possible only if each algorithm’s suitability is well known because only then the algorithm selection result can improve the best possible result given by a single algorithm. We show that an algorithm’s evaluation score depends on final task; i.e. to properly evaluate an algorithm and to determine its suitability, only well formulated tasks must be used. When algorithm suitability is well known, the algorithm can be efficiently used for a task by applying it in the most favorable environmental conditions determined during the evaluation. The task dependent evaluation is demonstrated on segmentation and object recognition. Additionally, we also discuss the importance of high level symbolic knowledge in the selection process. The importance of this symbolic hypothesis is demonstrated on a set of learning experiments with a Bayesian Network, a SVM and with statistics obtained during algorithm selector training. We show that task dependent evaluation is required to allow efficient algorithm selection. We show that using symbolic preferences of algorithms, the accuracy of algorithm selection can be improved by 10 to 15% and the symbolic segmentation quality can be improved by up to 5% when compared with the best available algorithm.
Науковий журнал «Радіоелектроніка, інформатика, управління»
Переглянути архів Інформація| Поле | Співвідношення | |
| ##plugins.schemas.marc.fields.042.name## |
dc |
|
| ##plugins.schemas.marc.fields.720.name## |
Lukac, M.; Nazarbayev University, Astana, Kazakhstan Abdiyeva, K.; Nanyang Technological University, Singapore Kameyama, M.; Tohoku University, Sendai, Japan |
|
| ##plugins.schemas.marc.fields.520.name## |
In this paper we discuss certain theoretical properties of the algorithm selection approach to the problem of semantic segmentation in<br />computer vision. High quality algorithm selection is possible only if each algorithm’s suitability is well known because only then the algorithm selection result can improve the best possible result given by a single algorithm. We show that an algorithm’s evaluation score depends on final task; i.e. to properly evaluate an algorithm and to determine its suitability, only well formulated tasks must be used. When algorithm suitability is well known, the algorithm can be efficiently used for a task by applying it in the most favorable environmental conditions determined during the evaluation. The task dependent evaluation is demonstrated on segmentation and object recognition. Additionally, we also discuss the importance of high level symbolic knowledge in the selection process. The importance of this symbolic hypothesis is demonstrated on a set of learning experiments with a Bayesian Network, a SVM and with statistics obtained during algorithm selector training. We show that task dependent evaluation is required to allow efficient algorithm selection. We show that using symbolic preferences of algorithms, the accuracy of algorithm selection can be improved by 10 to 15% and the symbolic segmentation quality can be improved by up to 5% when compared with the best available algorithm. |
|
| ##plugins.schemas.marc.fields.260.name## |
Zaporizhzhya National Technical University 2016-04-15 00:00:00 |
|
| ##plugins.schemas.marc.fields.856.name## |
application/pdf http://ric.zntu.edu.ua/article/view/66670 |
|
| ##plugins.schemas.marc.fields.786.name## |
Radio Electronics, Computer Science, Control; No 1 (2016): Radio Electronics, Computer Science, Control |
|
| ##plugins.schemas.marc.fields.546.name## |
en |
|
| ##plugins.schemas.marc.fields.540.name## |
Copyright (c) 2016 M. Lukac, K. Abdiyeva, M. Kameyama |
|