8 Bibliografia
J.VIOTTO –PARAMETRIZZAZIONE AUTOMATICA DI FIGURE PIANE -115-
[1] Ansari N., Delp E.J., On detecting dominant points, Pattern Recognition, 24:
441-450, 1991.
[2] Asada H., Brady M., The curvature primal sketch, IEEE Trans. Pattern Analysis and Machine Intelligence, 8(1):2-14, 1986.
[3] Attneave F., Some informational aspects of visual perception, Physical Review, 61:1833-193, 1954.
[4] Chen J.-M., Ventura J.A., Wu C.H., Segmentation of planar curves into circular and line segments, Image Vision and Computing, 14: 71-83, 1996.
[5] Douglas D.H., Peucker T.K., Algorithm for the reduction of the number of points required to represent a line or its caricature, The Canadian Cartographer, 10 (2):
112-122, 1973.
[6] R.O. Duda & P.E. Hart, "Use of the Hough transformation to detect lines and curves in pictures", Communication of the ACM, January 1972, Volume 15, Number 1, pp. 11-15.
[7] Fahn C.-S., Wang J.-F., Lee J.-Y., An adaptive reduction procedure for the piecewise linear approximation of digitized curves, IEEE Trans. Pattern Analysis and Machine Intelligence, 11: 967-973, 1989.
[8] Horng J.-H., Improving fitting quality of polygonal approximation by using the dynamic programming technique, Pattern Recognition Letters, 23(4): 1657- 1673, 2002.
[9] Horng J.-H., Li J.-T., An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves, Pattern Recognition Letters, 23(1-3): 171-182, 2002.
[10] J. Illingworth & J. Kittler, "A survey of the Hough transform", Computer vision, graphics, and image processing 44, 1988, pp. 87-116.
[11] Imai H., Iri M., Polygonal approximations of a curve (formulations and algorithms), in Computational Morphology, G.T.Toussaint, (Ed), 71-86, North- Holland, Amsterdam, 1988.
[12] Iñesta J.M., Buendia M., Sarti M.A., Reliable polygonal approximations of imaged real objects through dominant point detection, Pattern Recognition, 31:
685-697, 1998.
CAPITOLO 8–BIBLIOGRAFIA -116-
[13] Lee J.-H., Chung J.-W., Kim J.-K., Optimal vertex adjustment method using a Viterbi algorithm for vertex-based shape coding, Electronic Letters, 35 (9): 706- 707, 1999.
[14] Leu J.G., Chen L., Polygonal approximation of 2d shapes through boundary merging, Pattern Recognition Letters, 7(4): 231-238, 1988.
[15] F. O'Gorman & M.B. Clowes, "Finding picture edges through collinearity of feature points", IEEE Transactions on Computers, Vol C-25, No. 4, April 1976, pp.
449-456.
[16] Park R.-H., Jee Y.H.., Multistep polygonal approximation, J. Electronic Imaging, 3(3): 232-244, 1994.
[17] Pikaz A., Dinstein I., An algorithm for polygonal approximation based on iterative point elimination, Pattern Recognition Letters, 16 (6): 557-563, 1995.
[18] Ramer U., An iterative procedure for polygonal approximation of plane curves, Computer Graphics and Image Processing, 1: 244-256, 1972.
[19] Sato Y., Piecewise linear approximation of planar curves by perimeter optimization, Pattern Recognition, 25(12): 1535-1543, 1992.
[20] Schroeder K., Laurent P., Efficient polygon approximations for shape signatures, Proc. Int. Conf. on Image Processing-ICIP’99, Kobe, Japan, 2: 811-814, October 1999.
[21] Xiao Y., Zou J.J., Yan H., An adaptive split-and-merge method for binary image contour data compression, Pattern Recognition Letters, 22: 299-307, 2001.
[22] Yin P.-Y., Algorithms for straight-line fitting using k-means, Pattern Recognition Letters, 19: 31-41, 1998.
