Algorithms for straight line fitting using k -means

Pattern Recognition Letters

Volumn 19, Issue 1, 1998, Pages 31-41

  Yin, Peng Yeng ^a  

^a MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Clustering; k means; Line fitting; Polygonal approximation; Principal axis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY;

STRAIGHT LINE FITTING;

OBJECT RECOGNITION;

EID: 0031648175     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(97)00154-2     Document Type: Article

References (18)

1. Anderberg, M.R., 1973. Cluster Analysis for Applications. Academic Press, New York, Chapter 7.
2. Ansari N., Delp E.J. On detection dominant points. Pattern Recognition. 24:1991;441-450.
3. Kankanhalli M.S. An adaptive dominant point detection algorithm for digital curves. Pattern Recognition Letters. 14:1993;385-390.
4. Kurozumi Y., Davis W.A. Polygonal approximation by the minimax method. Comput. Graphics Image Process. 19:1982;248-264.
5. Leu J.-G., Chen L. Polygonal approximation of 2-D shapes through boundary merging. Pattern Recognition Letters. 7:1988;231-238.
6. Pavlidis T. Polygonal approximations by Newton's method. IEEE Trans. Comput. 26:1977;800-807.
7. Pavlidis T., Horowitz S.L. Segmentation of plane curves. IEEE Trans. Comput. 23:1974;860-870.
8. Phillips T.Y., Rosenfeld A. An ISODATA algorithm for straight line fitting. Pattern Recognition Letters. 7:1988;291-297.
9. Ray B.K., Ray K.S. A new split-and-merge technique for polygonal approximation of chain coded curves. Pattern Recognition Letters. 16:1995;161-169.
10. Rosenfeld A., Johnston E. Angle detection on digital curves. IEEE Trans. Comput. 22:1973;875-878.
11. Selim S.Z., Alsultan K. A simulated annealing algorithm for the clustering problem. Pattern Recognition. 24:1991;1003-1008.
12. Sklansky J., Chazin R.L., Hansen B.J. Minimum perimeter polygons of digitized silhouettes. IEEE Trans. Comput. 23:1972;445-448.
13. Sklansky J., Gonzalez V. Fast polygonal approximation of digitized curves. Pattern Recognition. 12:1980;327-331.
14. Teh C.H., Chin R.T. On the detection of dominant points on digital curves. IEEE Trans. Pattern Anal. Machine Intell. 11:1989;859-872.
15. Wall K., Danielsson P.E. A fast sequential method for polygonal approximation of digitized curves. Comput. Vision Graphics Image Process. 28:1984;220-227.
16. Wu J.S., Leou J.J. New polygonal approximation schemes for object shape representation. Pattern Recognition. 26:1993;471-484.
17. Wu W.Y., Wang M.J. Detecting the dominant points by the curvature-based polygonal approximation. CVGIP: Graphical Models Image Process. 55:1993;79-88.
18. Zhang Q., Wang Q.R., Boyle R. A clustering algorithm for data-sets with a large number of classes. Pattern Recognition. 24:1991;331-340.