Coupled recognizers

We tackle the problem of minimizing the mean computational length of pattern recognizers by absolute comparison, i. e. the average number of discriminant functions to be computed in such recognizers. To this end we consider the possibility of exploiting a less precise recognizer as a supervising system for the main recognizer. Once the optimal solution is analyzed, some conditions about the behaviour of the auxiliary recognizer are considered in order to simplify the algorithm involved and to find simpler suboptimal algorithms.