A concavity tree is a data structure for hierarchically representing the shape of two-dimensional silhouettes using convex polygons. In this paper, we present a new algorithm for concavity tree extraction. The algorithm is fast, works directly on the pixel grid of the shape, and uses exact convex hu
Pattern matching of 2-D shape using hierarchical descriptions
β Scribed by Satoru Morita; Toshio Kawashima; Yoshinao Aoki
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 662 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
One task in the interpretation of the 2-D nuclear magnetic resonance (NMR) spectrum is to assign its signal patterns to their corresponding amino acids in proteins or polypeptides. To carry out this task of interpretation, one requires sufficient chemical knowledge and expertise to reason from a set
profiles, the object contours, extracted from images, are known to be quite useful for object recognition [2]. In this In this paper, a new recognition algorithm for 2D object contours, based on the decimated wavelet transform, is prepaper, we will focus our attention to the case where an sented, em
The morphological skeleton transform is a shape representation scheme that decomposes a shape into a union of all maximal homothetics of a structuring element contained in the shape. In this paper, we develop an algorithm that generalizes the skeleton transform by allowing many di!erent rectangles o