A Graded Approach to Shape Representation
โ Scribed by Po-Chi Chen; Wei-Chang Tsai; Shu-Yuen Hwang
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 360 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1047-3203
No coin nor oath required. For personal study only.
โฆ Synopsis
these operations were used to indicate degrees of the information detailing. With respect to computational effi-Human beings perceived real-world objects in a graded manner, with macroviews providing global information about the ciency, the use of operation parameters might be a good objects and microviews providing more detailed information. choice for the index of degree of detailing. However, Consequently, researchers in computer vision have directed using operation parameters does not directly match hutheir efforts toward building graded representations of objects, man intuition.
especially shapes of objects. Most previous approaches em-
To overcome this defect, we devised a graded approach ployed operations such as smoothing, blurring, or grouping to to deriving a shape representation with multiple degrees gradually obtain representations with different degrees of deof detail. Our approach is based on a similarity ratio that tail. Parameters of these operations are used to indicate the measures the similarity between an approximation and an degree of detail. One objection to using operator parameters original contour segment. First, a numerical value repreis that these parameters are difficult for viewers to interpret senting the similarity requirement is stated. Guided by this intuitively. To overcome this objection, we propose using a graded approach guided by a given similarity requirement to value, our approach constructs an approximation of the construct a more concise shape description. Our shape represenshape that satisfies the stated requirement. In our terminoltation matches human intuition about detailing degree and ogy, an approximation of a shape consists of a set of tokens. suits machine requirement for concise description. ยฉ 1996 Aca-A token is a line segment fitted to a partial contour of demic Press, Inc.
a shape. Our approach initially uses only two tokens to approximate the given shape. When an optimal result is obtained, we compare the similarity ratio of these tokens
๐ SIMILAR VOLUMES
The main goal of this work is to discuss a controllability approach to the image matching/shape identification problem, an important issue in many applications, medical ones in particular. The matching problem is formulated as an approximate controllability problem involving a cost functional whose
Let u be a unipotent element in a complex semisimple group G and let 3,, be the variety of Bore1 subgroups of G which contain u. In [4, 51, Springer has defined a representation of W, the Weyl group of G, on the homology of 2:, and showed how to decompose the Wrepresentation in the top homology of