CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1982 vol.4 Issue No.06 - June
Issue No.06 - June (1982 vol.4)
R. L. Kashyap , School of Electrical Engineering, Purdue University, West Lafayette, IN 47907.
B. J. Oommen , School of Electrical Engineering, Purdue University, West Lafayette, IN 47907; Department of Computer Science, Carleton University, Ottowa, Ont., Canada K1S 586.
Two geometrical measures have been proposed to quantify the dissimilarity between two irregular polygons. These measures capture the intuitive notion of the dissimilarity between shapes and are related to the minimum value of the intersecting area of the polygons on superposing one on the other in various configurations. A more easily computable measure of dissimilarity, referred to as the minimum integral square error between the polygons, has also been proposed, and using the latter measure pattern classification, has been performed. Experimental results involving the classification of the noisy boundaries of the four Great Lakes, Erie, Huron, Michigan, and Superior, using this measure, have been presented.
R. L. Kashyap, B. J. Oommen, "A Geometrical Approach to Polygonal Dissimilarity and Shape Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.4, no. 6, pp. 649-654, June 1982, doi:10.1109/TPAMI.1982.4767320