A fundamental problem in model-based computer vision is that of identifying to which of a given set of concept classes of geometric models an observed model belongs. Considering a “probe” to be an oracle that tells whether or not the observed model is present at a given point in an image, we study the problem of computing efficient strategies (“decision trees”) for probing an image, with the goal to minimize the number of probes necessary (in the worst case) to determine in which class the observed model belongs. We prove a hardness result and give strategies that obtain decision trees whose height is within a log factor of optimal.
CITATION STYLE
Arkin, E. M., Goodrich, M. T., Mitchell, J. S. B., Mount, D., Piatko, C. D., & Skiena, S. S. (1993). Point probe decision trees for geometric concept classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 709 LNCS, pp. 95–106). Springer Verlag. https://doi.org/10.1007/3-540-57155-8_239
Mendeley helps you to discover research relevant for your work.