On Minimal Accuracy Algorithm Selection in Computer Vision and Intelligent Systems
In this paper we discuss certain theoretical properties of algorithm selection approach to image processing and to intelligent system in general. We analyze the theoretical limits of algorithm selection with respect to the algorithm selection accuracy. We show the theoretical formulation of a crisp bound on the algorithm selector precision guaranteeing to always obtain better than the best available algorithm result.
PDF AbstractTasks
Datasets
Add Datasets
introduced or used in this paper
Results from the Paper
Submit
results from this paper
to get state-of-the-art GitHub badges and help the
community compare results to other papers.
Methods
No methods listed for this paper. Add
relevant methods here
