Thumbnail
Access Restriction
Subscribed

Author Montanari, U.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Digitized image ♦ Connection tree ♦ Optimal approximation ♦ Nonlinear programming ♦ Minimal polygon
Abstract 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.
Description Affiliation: Consiglio Nazionale delle Ricerche, Pisa, Italy (Montanari, U.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 13
Issue Number 1
Page Count 7
Starting Page 41
Ending Page 47


Open content in new tab

   Open content in new tab
Source: ACM Digital Library