On Minimal Accuracy Algorithm Selection in Computer Vision and Intelligent Systems

08/12/2016
by   Martin Lukac, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2015

ICON Challenge on Algorithm Selection

We present the results of the ICON Challenge on Algorithm Selection....
research
05/29/2015

Symbolic Segmentation Using Algorithm Selection

In this paper we present an alternative approach to symbolic segmentatio...
research
08/12/2016

Reasoning and Algorithm Selection Augmented Symbolic Segmentation

In this paper we present an alternative method to symbolic segmentation:...
research
10/10/2016

A New Theoretical and Technological System of Imprecise-Information Processing

Imprecise-information processing will play an indispensable role in inte...
research
08/16/2020

Selection on X_1 + X_1 + ⋯ X_m via Cartesian product tree

Selection on the Cartesian product is a classic problem in computer scie...
research
07/07/2021

Oblivious Median Slope Selection

We study the median slope selection problem in the oblivious RAM model. ...

Please sign up or login with your details

Forgot password? Click here to reset