Issue No. 12 - December (2004 vol. 26)
Multiclass shape detection, in the sense of recognizing and localizing instances from multiple shape classes, is formulated as a two-step process in which local indexing primes global interpretation. During indexing a list of instantiations (shape identities and poses) is compiled, constrained only by no missed detections at the expense of false positives. Global information, such as expected relationships among poses, is incorporated afterward to remove ambiguities. This division is motivated by computational efficiency. In addition, indexing itself is organized as a coarse-to-fine search simultaneously in class and pose. This search can be interpreted as successive approximations to likelihood ratio tests arising from a simple ("naive Bayes”) statistical model for the edge maps extracted from the original images. The key to constructing efficient "hypothesis tests” for multiple classes and poses is local ORing; in particular, spread edges provide imprecise but common and locally invariant features. Natural tradeoffs then emerge between discrimination and the pattern of spreading. These are analyzed mathematically within the model-based framework and the whole procedure is illustrated by experiments in reading license plates.
Shape detection, multiple classes, statistical model, spread edges, coarse-to-fine search, online competition.
Y. Amit, X. Fan and D. Geman, "A Coarse-to-Fine Strategy for Multiclass Shape Detection," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 26, no. , pp. 1606-1621, 2004.