๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A measure of 2D shape-of-object dissimilarity

โœ Scribed by E. Bribiesca; R.G. Wilson

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
755 KB
Volume
10
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

describe an approach for measuring 2D shape-of-object dissimilarity.

The shape of the different objects to be compared is mapped to a representation invariant under translation, rotation, and area. Thus, the shapes will have the same amount of information to describe them (equal number of pixels). The measure of dissimilarity is based on the transformation of one shape into another. This transformation is performed by moving pixels. Thus, the shape difference could be ascertained by counting how many pixels we have to move and how far to change one shape into another.

When the shape transformation is performed, the distribution of the shape difference is computed, which permits an improvement in shape comparison.

๐Ÿ“œ SIMILAR VOLUMES

Measurement of 3D-line shaped objects
Measurement of 3D-line shaped objects
โœ Marcel Worring; Pia Pfluger; Arnold W.M. Smeulders; Adriaan B. Houtsmuller ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 432 KB
Compositional dissimilarity as a robust
Compositional dissimilarity as a robust measure of ecological distance
โœ Faith, Daniel P. ;Minchin, Peter R. ;Belbin, Lee ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 881 KB

The robustness of quantitative measures of compositional dissimilarity between sites was evaluated using extensive computer simulations of species' abundance patterns over one and two dimensional configurations of sample sites in ecological space. Robustness was equated with the strength, over a ran

Shape recognition and chirality measure:
Shape recognition and chirality measure: reestablishing the link between similarity and dissimilarity in discrete space
โœ M Raji; A Cossรฉ-Barbi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 163 KB

This paper outlines a new method for matching discrete structures when atom correspondences are unknown. Instead of optimizing at once in discrete space, this method first optimizes the location of one of the two discrete entities onto a continuous interpolation of the other. On the basis of the ato