The Community for Technology Leaders
Green Image
<p>A novel approach is proposed for learning a visual model from real shape samples of the same class. The approach can directly acquire a visual model by generalizing the multiscale convex/concave structure of a class of shapes, that is, the approach is based on the concept that shape generalization is shape simplification wherein perceptually relevant features are retained. The simplification does not mean the approximation of shapes but rather the extraction of the optimum scale convex/concave structure common to shape samples of the class. The common structure is obtained by applying the multiscale convex/concave structure-matching method to all shape pairs among given shape samples of the class and by integrating the matching results. The matching method, is applicable to heavily deformed shapes and is effectively implemented with dynamic programming techniques. The approach can acquire a visual model from a few samples without any a priori knowledge of the class. The obtained model is very useful for shape recognition. Results of applying the proposed method are presented.</p>
computer vision; pattern recognition; visual models; shape contours; multiscale convex/concave structure matching; shape generalization; shape simplification; perceptually relevant features; dynamic programming; shape recognition; computer vision; dynamic programming; pattern recognition
N. Ueda, S. Suzuki, "Learning Visual Models from Shape Contours Using Multiscale Convex/Concave Structure Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 337-352, April 1993, doi:10.1109/34.206954
90 ms
(Ver 3.3 (11022016))