A method for detecting correspondences in a sequence of modifying shapes

Authors:
G.G Pieroni;M.F Costabile
Affiliations:
Department of Computer Science, University of Houston, Houston, TX 77004, USA;Dipartimento di Matematica, Universita' della Calabria, 87036 Rende (Cosenza, Italy
Venue:
Pattern Recognition Letters
Year:
1985

Citing 5
Cited 0

Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
Digital Picture Processing

Digital Picture Processing
Analysis of Visual Motion by Biological and Computer Systems

Computer
A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal Shapes into Meaningful Parts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.10

Visualization

Abstract

It is interesting in many fields to analyze motion patterns generated by time-varying shape boundaries. When dealing with such a problem a possible initial approach consists of establishing a correspondence between segments obtained by decomposing boundary lines belonging to successive frames. In this work a mathematical model of moving shape boundaries is constructed. A technique for accomplishing related decompositions of such kinds of curves residing in contiguous frames is presented. Finally an algorithm based on the relaxation and tree search methods generates a correspondence process between tokens belonging to successive frames. Examples and results are displayed and discussed.