SHAPE MATCHING BY CORRELATING RELATIONAL MODELS.

Ho Soo Lee, Nitish V Thakor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper describes a new shape matching algorithm using the correlation of the relational models. Relational descriptions of shapes are incorporated in a correlation matching method. From relational decriptions of a shape, a list of relational spectrums for each feature is constructed, which preserves the global information of the whole shape. Shape matching of a candidate shape against the prototype model is performed by correlating the relational spectrums of the prototype and candidate models. Although the correlation technique is adopted in matching process, the proposed matching algorithm is invariant under elementary transformations such as translation, rotation, and scaling since the items being correlated are global relations among shape features.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherIEEE
Pages1178-1181
Number of pages4
Volume2
ISBN (Print)0818605456
StatePublished - 1984
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lee, H. S., & Thakor, N. V. (1984). SHAPE MATCHING BY CORRELATING RELATIONAL MODELS. In Proceedings - International Conference on Pattern Recognition (Vol. 2, pp. 1178-1181). IEEE.

SHAPE MATCHING BY CORRELATING RELATIONAL MODELS. / Lee, Ho Soo; Thakor, Nitish V.

Proceedings - International Conference on Pattern Recognition. Vol. 2 IEEE, 1984. p. 1178-1181.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, HS & Thakor, NV 1984, SHAPE MATCHING BY CORRELATING RELATIONAL MODELS. in Proceedings - International Conference on Pattern Recognition. vol. 2, IEEE, pp. 1178-1181.
Lee HS, Thakor NV. SHAPE MATCHING BY CORRELATING RELATIONAL MODELS. In Proceedings - International Conference on Pattern Recognition. Vol. 2. IEEE. 1984. p. 1178-1181
Lee, Ho Soo ; Thakor, Nitish V. / SHAPE MATCHING BY CORRELATING RELATIONAL MODELS. Proceedings - International Conference on Pattern Recognition. Vol. 2 IEEE, 1984. pp. 1178-1181
@inproceedings{2ccb1800e12a4f2dbbd30cb644db1735,
title = "SHAPE MATCHING BY CORRELATING RELATIONAL MODELS.",
abstract = "This paper describes a new shape matching algorithm using the correlation of the relational models. Relational descriptions of shapes are incorporated in a correlation matching method. From relational decriptions of a shape, a list of relational spectrums for each feature is constructed, which preserves the global information of the whole shape. Shape matching of a candidate shape against the prototype model is performed by correlating the relational spectrums of the prototype and candidate models. Although the correlation technique is adopted in matching process, the proposed matching algorithm is invariant under elementary transformations such as translation, rotation, and scaling since the items being correlated are global relations among shape features.",
author = "Lee, {Ho Soo} and Thakor, {Nitish V}",
year = "1984",
language = "English (US)",
isbn = "0818605456",
volume = "2",
pages = "1178--1181",
booktitle = "Proceedings - International Conference on Pattern Recognition",
publisher = "IEEE",

}

TY - GEN

T1 - SHAPE MATCHING BY CORRELATING RELATIONAL MODELS.

AU - Lee, Ho Soo

AU - Thakor, Nitish V

PY - 1984

Y1 - 1984

N2 - This paper describes a new shape matching algorithm using the correlation of the relational models. Relational descriptions of shapes are incorporated in a correlation matching method. From relational decriptions of a shape, a list of relational spectrums for each feature is constructed, which preserves the global information of the whole shape. Shape matching of a candidate shape against the prototype model is performed by correlating the relational spectrums of the prototype and candidate models. Although the correlation technique is adopted in matching process, the proposed matching algorithm is invariant under elementary transformations such as translation, rotation, and scaling since the items being correlated are global relations among shape features.

AB - This paper describes a new shape matching algorithm using the correlation of the relational models. Relational descriptions of shapes are incorporated in a correlation matching method. From relational decriptions of a shape, a list of relational spectrums for each feature is constructed, which preserves the global information of the whole shape. Shape matching of a candidate shape against the prototype model is performed by correlating the relational spectrums of the prototype and candidate models. Although the correlation technique is adopted in matching process, the proposed matching algorithm is invariant under elementary transformations such as translation, rotation, and scaling since the items being correlated are global relations among shape features.

UR - http://www.scopus.com/inward/record.url?scp=0021627212&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021627212&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0021627212

SN - 0818605456

VL - 2

SP - 1178

EP - 1181

BT - Proceedings - International Conference on Pattern Recognition

PB - IEEE

ER -