Segmentation of Plane Curves

IEEE Transactions on Computers

Volumn C-23, Issue 8, 1974, Pages 860-870

  Pavlidis, Theodosios ^a   Horowitz, Steven L ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Boundary segmentation; data compaction; feature extracton; pattern recognition; piecewise functional approximation; polygonal contours; waveform segmentation

Indexed keywords

MATHEMATICAL TECHNIQUES;

EID: 0016092958     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1974.224041     Document Type: Article

References (30)

1. T. Pavlidis, “Analysis of set patterns,” Pattern Recognition, vol. 1, pp. 165–178, 1968.
2. T. Pavlidis, “Linguistic analysis of waveforms,” in Software Engineering, J. Tou, Ed. New York: Academic, 1971, pp. 203–225.
3. D. E. McClure, “Feature selection for the analysis of line patterns,” Ph.D. dissertation, Div. Appl. Math., Brown Univ., Providence, R. I., 1970.
4. J. Sklansky, “Recognition of convex blobs,” Pattern Recognition, vol. 2, pp. 3–10, 1970.
5. U. Montanari, “A note on minimal length polygonal approximation to a digitized contour,” Commun. Ass, Comput. Mach. vol. 13, pp. 4–47, 1970.
6. T. Kaneko and R. Mancini, “Straight line approximation for boundary of left ventricular chamber from a cardiac cineangiogram,” in Proc. 6th Annu. Princeton Conf., Princeton, N. J., pp. 337–341, 1972.
7. T. Pavlidis, “Piecewise approximation of functions of two variables through regions with variable boundaries,” in Proc. of Ass. Comput. Mach. Annu. Conf., Aug. 1972, pp. 652–662.
8. U. Ramer, “An iterative procedure for the polygonal approximation of plane curves,” J. Comput. Graphics and Image Processing, vol. 1, pp. 244–256, 1972.
9. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973, pp. 328–339.
10. D. E. McClure, “Nonlinear segmented function approximation and analysis of line patterns,” Div. Appl. Math., Brown Univ., Providence, R. I., Tech. Rep., 1973.
11. G. Birkhoff and C. R. DeBoor, “Piecewise polynomial interpolation and approximation,” in Approximation of Functions, H. L. Garabedian, Ed. Amsterdam, The Netherlands: Elsevier, 1965, pp. 164–190.
12. J. R. Rice, The Approximation of Functions, vol. I, vol. II. Reading, Mass.: Addison-Wesley, 1964, 1969.
13. C. E. DeBoor and J. R. Rice, “Least square cubic spline approximation: Variable knots,” Dep. Comput. Sci., Purdue Univ., Lafayette, Ind., Tech. Rep. 81.
14. R. E. Esch and W. L. Eastman, “Computational methods for best spline approximation,” J. Approx. Theory, vol. 2, pp. 85–96, 1969.
15. D. D. Braess, “Chebyshev approximation by spline functions with free knots,” Numer. Math., vol. 17, pp. 357–366, 1971.
16. T. Pavlidis, “Optimal piecewise polynomial L2 approximation of functions of one and two variables,” Comput. Sci. Lab., Dep. Electr. Eng., Princeton Univ., Princeton, N. J., Tech. Rep. 143, Oct. 1973.
17. G. M. Phillips, “Algorithms for piecewise straight line approximations,” Comput. J., vol. II, pp. 211–212, 1968.
18. M. G. Cox, “An algorithm for approximating convex functions by means of first degree splines,” Comput. J., vol. 14, pp. 272–275, 1971.
19. A. Cantoni, “Optimal curve fitting with piecewise linear functions,” IEEE Trans. Comput., vol. C-20, pp. 59–67, Jan. 1971.
20. T. Pavlidis, “Waveform segmentation through functional approximation,” IEEE Trans. Comput., vol. C-22, pp. 689–697, July 1973.
21. H. Vogt, Element de Mathematiques Superieures, 17th ed., Vuibert, 1947, p. 140.
22. R. E. Esch and W. L. Eastman, “Computational methods for best approximation,” Sperry Rand Res. Cen., Sudbury, Mass., Tech. Rep. SEG-TR-67-30, Dec. 1967.
23. P. Rabinowitz, “Application of linear programming to numerical analysis,” SIAM Rev., vol. 10, pp. 121–159, Apr. 1968.
24. D. C. Handscomb, Ed., Methods of Numerical Approximation. Elmsford, N. Y.: Pergamon, 1966.
25. E. Isaacson and H. B. Keller, Analysis of Numerical Methods. New York: Wiley, 1966.
26. J. R. Rice, “Running orthogonalization,” J. Approx. Theory, vol. 4, pp. 332–338, 1971.
27. C. M. Kortman, “Redundancy reduction—A practical method of data compression,” Proc. IEEE, vol. 55, pp. 253–263, Mar. 1967.
28. T. Pavlidis and A. P. Maika, “Uniform piecewise polynomial approximation with variable joints,” J. Approx. Theory, to be published.
29. T. Pavlidis and S. L. Horowitz, “Piecewise approximation of plane curves,” in Proc. 1st Int. Joint Conf. Pattern Recognition, Washington, D. C, Oct. 30–Nov. 1, 1973, pp. 396–405.
30. H. Y. Feng and T. Pavlidis, “The generation of polygonal outlines of objects from gray level pictures,” Comput. Sci. Lab., Dep. Elec. Eng., Princeton Univ., Princeton, N. J., Tech. Rep. 150, Apr. 1974.