Shape Recognition and Twenty Questions
Year: 1993
Type: article
Abstract: We formulate shape recognition as a coding problem. There is a finite list of possible "hypotheses" - shape classes and/or spatial positionings - and we wish to determine which one is true based on the results of various "tests," which are local image features. We use a decision tree: each interior node is assigned one of the tests and each terminal node is assigned one of the hypotheses. The assignment of tests, or "strategy," is recursive: along each branch choose the next test to remove as much uncertainty as possible (as measured by entropy) about the true hypothesis. In contrast to the standard approach of "hypothesize and test," there is no repeated elicitation of hypotheses; instead, the "indexing" is dynamic and stochastic. We gradually formulate specific conjectures as the evolving distribution on hypotheses becomes increasingly peaked. We apply this "twenty questions" approach to the recognition of two types of linear, deformable structures: handwritten numerals and roads i...
Authors: Geman, Donald, Jedynak, Bruno, Institut National de Recherche en Informatique et en Automatique (INRIA), 78 - Rocquencourt (France). Unite de Recherche de Rocquencourt
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W133580404
