A note on minimal length polygonal approximation to a digitized contour
作者： U. Montanari
关键词:
摘要: A method for extracting a smooth polygonal contour from digitized image is illustrated. The ordered sequence of points and the connection graph are first obtained by modified Ledley algorithm in one scan. minimal perimeter polygon subjected to specified constraints then chosen as approximating contour. determination can be reduced nonlinear programming problem, solved an which takes into account weak bonds between variables. Some examples presented, corresponding computing times listed.
acm.org
sci-hub.se 参考文章(6)
R. S. Ledley, High-Speed Automatic Analysis of Biomedical Pictures Science. ,vol. 146, pp. 216- 223 ,(1964) , 10.1126/SCIENCE.146.3641.216
Herbert Freeman, Jeremy Glass, On the Quantization of Line-Drawing Data IEEE Transactions on Systems Science and Cybernetics. ,vol. 5, pp. 70- 79 ,(1969) , 10.1109/TSSC.1969.300247
U. Montanari, Sulla descrizione strutturale di immagini Calcolo. ,vol. 5, pp. 873- 894 ,(1968) , 10.1007/BF02576603
Ugo Montanari, Continuous Skeletons from Digitized Images Journal of the ACM. ,vol. 16, pp. 534- 549 ,(1969) , 10.1145/321541.321543
Azriel Rosenfeld, John L. Pfaltz, Sequential Operations in Digital Picture Processing Journal of the ACM. ,vol. 13, pp. 471- 494 ,(1966) , 10.1145/321356.321357
Herbert Freeman, On the Encoding of Arbitrary Geometric Configurations Ire Transactions on Electronic Computers. ,vol. 10, pp. 260- 268 ,(1961) , 10.1109/TEC.1961.5219197