PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Montanari U. A note on minimal-length polygonal approximations to a digitalized contour. Internal note IEI-B68-12, 1968.
 
 
Abstract
(English)
A method for extracting a smooth polygonal contour from a digitized image is illustrated. The ordered sequence of contour points and the connection graph of the image are first obtained by a modified Ledley algorithm in one image scan. A minimal perimeter polygon subjected to specified constraints is then chosen as the approximating contour. The determination of the minimal polygon can be reduced to a nonlinear programming problem, solved by an algorithm which takes into account the weak bonds between variables. Some examples are presented, and the corresponding computing times are listed.
Subject digitized image
connection tree
minimal polygon
optimal approximation
nonlinear programming


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional