title: Planar-shape prototype generation using a tree-based random greedy algorithm.
abstract: A prototype is representative of a set of similar objects. This paper proposes an approach that formulates the problem of prototype generation as finding the mean from a given set of objects, where the prototype solution must satisfy certain constraints. These constraints describe the important perceptual features of the sample shapes that the proposed prototype must retain. The contour prototype generated from a set of planar objects was used as an example of the approach, and the corners were used as the perceptual features to be preserved in the proposed prototype shape. However, finding a prototype solution for more than two contours is computationally intractable. A tree-based approach is therefore proposed in which an efficient greedy random algorithm is used to obtain a good approximation of the proposed prototype and analyze the expected complexity of the algorithm. The proposed prototype-generation process for hand-drawn patterns is described and discussed in this paper.
authors.affiliation: Institute of Information Science, Academia Sinica, Taipei, Taiwan, ROC. wenyao@iis.sinica.edu.tw
authors.forename: Wen-Yao
authors.initials: WY
authors.lastname: Chen
authors.forename: Wen-Liang
authors.initials: WL
authors.lastname: Hwang
authors.forename: Tien-Ching
authors.initials: TC
authors.lastname: Lin
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D010151:Paintings; D010363:Pattern Recognition, Automated / Q000379:methods*