Flexible Matching Algorithm For 2-D Polygonal Shapes

J. Belleau; P. Cohen

doi:10.1117/12.941292

14 October 1987 Flexible Matching Algorithm For 2-D Polygonal Shapes

J. Belleau, P. Cohen

Proceedings Volume 0804, Advances in Image Processing; (1987) https://doi.org/10.1117/12.941292
Event: Fourth International Symposium on Optical and Optoelectronic Applied Sciences and Engineering, 1987, The Hague, Netherlands

Abstract

A new technique is presented for identification of thin objects whose appearance in an image is altered by contour noise, partial occlusions and distortions induced by 3-D flexible deformations. Starting from polygonal approximations of the shape to be analysed and of the object prototypes, the technique is based on an iterative deformation of each prototype which aims at reducing its dissimilarity with the shape under consideretion. Identification is then decided in favor of the most similar deformed prototype.

Citation Download Citation

J. Belleau and P. Cohen "Flexible Matching Algorithm For 2-D Polygonal Shapes", Proc. SPIE 0804, Advances in Image Processing, (14 October 1987); https://doi.org/10.1117/12.941292

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available