Segmentation of Plane Curves
- 1 August 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (8), 860-870
- https://doi.org/10.1109/t-c.1974.224041
Abstract
Piecewise approximation is described as a way of feature extraction, data compaction, and noise filtering of boundaries of regions of pictures and waveforms. A new fast algorithm is proposed which allows for a variable number of segments. After an arbitrary initial choice, segments are split or merged in order to drive the error norm under a prespecified bound. Results of computer experiments with cell outlines and electrocardiograms are reported.Keywords
This publication has 16 references indexed in Scilit:
- Uniform piecewise polynomial approximation with variable jointsJournal of Approximation Theory, 1974
- Straight-Line Approximation for the Boundary of the Left Ventricular Chamber from a Cardiac CineangiogramIEEE Transactions on Biomedical Engineering, 1973
- Chebyshev approximation by spline functions with free knotsNumerische Mathematik, 1971
- An algorithm for approximating convex functions by means by first degree splinesThe Computer Journal, 1971
- Optimal Curve Fitting With Piecewise Linear FunctionsIEEE Transactions on Computers, 1971
- Recognition of convex blobsPattern Recognition, 1970
- A note on minimal length polygonal approximation to a digitized contourCommunications of the ACM, 1970
- Computational methods for best spline function approximationJournal of Approximation Theory, 1969
- Algorithms for Piecewise Straight Line ApproximationsThe Computer Journal, 1968
- Redundancy reduction—A practical method of data compressionProceedings of the IEEE, 1967