Techniques for assessing polygonal approximations of curves

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 19, Issue 6, 1997, Pages 659-666

  Rosin, Paul L ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Assessment; Dynamic programming; Optimal breakpoints; Polygonal approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING;

INTEGRAL SQUARE ERROR (ISE);

COMPUTER VISION;

EID: 0031162930     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.601253     Document Type: Article

References (42)

1. K. Abe, R. Morii, K. Nishida, and T. KadonagaComparison of Methods for Detecting Corner Points From Digital Curves-A Preliminary ReportInt'l Conf. Document Analysis and Recognition, pp. 954-857, 1993,
2. I.M. Anderson and J.C. BezdekCurvature and Tangential Deflection of Discrete ArcsTrans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 27-40,1984,
3. N. Ansari and K.W. HuangNon-Parametric Dominant Point DetectionPattern Recognition, vol. 24, pp. 849-862,1991.
4. H. Aoyama and M. KawagoeA Piecewise Linear Approximation Method Preserving Visual Feature Points of Original FiguresCVGIP: Graphical Models and Image Processing, vol. 53, pp. 435-446,1991.
5. C. Arcelli and G. RamellaFinding Contour-Based Abstractions of Planar PatternsPattern Recognition, vol. 26, pp. 1,563-1,577, 1993.
6. S. Banerjee, W. Niblack, and M. FlicknerA Minimum Description Length Polygonal Approximation Method Technical Report no. RJ 10007, IBM Research Division, 1996.
7. P.C. Chung, C.T. Tsai, and Y.N. SunPolygonal Approximation Using a Competitive Hopfield Neural NetworkPattern Recognition, vol. 27, pp. 1,505-1,512,1994.
8. A. DeguchiRegularized Polygonal Approximation for Analysis and Interpretation of Planar Contour FiguresInt'l Conf. Pattern Recognition, vol. 1, pp. 865-869,1990.
9. D.H. Douglas and T.K. PeuckerAlgorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its CaricatureThe Canadian Cartographer, vol. 10, pp. Ill-Ill, 1973.
10. J.G. DunhamOptimum Uniform Piecewise Linear Approximation of Planar CurvesTrans. Pattern Analysis and Machine Intelligence, vol. 8, pp. 67-75,1986.
11. M.A. Fischler and H.C. WolfLocating Perceptually Salient Points on Planar CurvesTrans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 113-129,1994.
12. H. Freeman and L.S. DavisA Corner-Finding Algorithm for Chain-Coded Curves JEEE Trans. Computers, vol. 26, pp. 297303,1977.
13. F. Gritzali and G. PapakonstantinouA Fast Piecewise Linear Approximation AlgorithmSignal Processing, vol. 5, pp. 221-227, 1983.
14. R.M. HaralickPerformance Characterization in Image Analysis: Thinning, a Case in PointPattern Recognition Letters, vol. 13, pp. 5-12,1992.
15. A. Held, K. Abe, and C. ArcelliTowards a Hierarchical Contour Description via Dominant Point Detection JEEE Trans. Sys., Man, and Cybernetics, vol. 24, pp. 942-949,1994.
16. T. Kadonaga and K. AbeComparison of Methods for Detecting Corner Points From Digital CurvesInt'l Workshop on Graphics Recognition, pp. 3-12,1995.
17. T. Kanungo, M.Y. Jaisimha, J. Palmer, and R.M. HaralickA Methodology for Quantitative Performance Evaluation of Detection Algorithms JEEE Trans. Image Processing, vol. 4, pp. 1,6671,673,1995.
18. J. Koplowitz and S. PlanteCorner Detection for Chain Coded CurvesPattern Recognition, vol. 28, pp. 843-852,1995.
19. D.G. LoweThree-Dimensional Object Recognition From Single Two-Dimensional ImagesArtificial Intelligence, vol. 31, pp. 355395,1987.
20. T. Melen and T. OzanianA Fast Algorithm for Dominant Point Detection on Chain-Coded ContoursProc. Fifth Int'l Conf. Computer Analysis of Images and Patterns, 1993.
21. U. MontanariA Note on Minimal Length Polygonal Approximation to a Digitized CurveComm. ACM, vol. 13, pp. 41-47, 1970.
22. H. OgawaCorner Detection on Digital Curves Based on Local Symmetry of the ShapePattern Recognition, vol. 22, pp. 351-357, 1989.
23. J.C. Perez and F. VidaiOptimum Polygonal Approximation of Digitized CurvesPattern Recognition Letters, vol. 15, pp. 743-750, 1994.
24. T.Y. Phillips and A. RosenfeldA Method of Curve Partitioning Using Arc-Chord DistancePattern Recognition Letters, vol. 5, pp. 285-288,1987.
25. U. RamerAn Iterative Procedure for the Polygonal Approximation of Plane CurvesComputer, Graphics and Image Processing, vol. 1, pp. 244-256,1972.
26. A. Rattarangsi and R.T. ChinScale-Based Detection of Corners of Planar CurvesTrans. Pattern Analysis and Machine Intelligence, vol. 14, pp. 430-449,1992.
27. B.K. Ray and K.S. RayAn Algorithm for Detection of Dominant Points and Polygonal Approximation of Digitized CurvesPattern Recognition Letters, vol. 12, pp. 849-856,1992.
28. B.K. Ray and K.S. RayDetection of Significant Points and Polygonal Approximation of Digitized CurvesPattern Recognition Letters, vol. 12, pp. 443-452,1992.
29. A. Rosenfeld and E. JohnstonAngle Detection on Digital Curves JEEE Trans. Computers, vol. 22, pp. 875-878,1973.
30. A. Rosenfeld and J.S. WeszkaAn Improved Method of Angle Detection on Digital Curves JEEE Trans. Computers, vol. 24, pp. 940-941,1975.
31. P.L. RosinTechniques for Assessing Polygonal Approximations of Curves Technical Report no. CSTR-96-3, Brunei University, 1996.
32. P.L. RosinRepresenting Curves at Their Natural ScalesPattern Recognition, vol. 25, pp. 1,315-1,325,1992.
33. P.L. Rosin and G.A.W. WestNon-Parametric Segmentation of Curves Into Various RepresentationsTrans. Pattern Analysis and Machine Intelligence, vol. 17, pp. 1,140-1,153,1995.
34. P.V. Sankar and C.V. SharmaA Parallel Procedure for the Detection of Dominant Points on a Digital CurveComputer, Graphics and Image Processing, vol. 7, pp. 403-412,1978.
35. D. SarkarA Simple Algorithm for Detection of Significant Vertices for Polygonal Approximation of Chain-Coded CurvesPattern Recognition Letters, vol. 14, pp. 959-964,1993.
36. Y. SatoPiecewise Linear Approximation of Plane Curves by Perimeter OptimizationPattern Recognition, vol. 25, pp. 1,5351,543,1992.
37. C.H. Teh and R.T. ChinOn the Detection of Dominant Points in Digital CurvesTrans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 859-872,1989.
38. 0.D. Trier and A.K. JainGoal-Directed Evaluation of Binarization Methods Trans. Pattern Analysis and Machine Intelligence, vol. 17, pp. 1,191-1,201,1995.
39. J.A. Ventura and J.M. ChenSegmentation of Two-Dimensional Curve ContoursPattern Recognition, vol. 25, pp. 1,129-1,140, 1992.
40. K. Wall and P.E. DanielssonA Fast Sequential Method for Polygonal Approximation of Digitized CurvesComputer Vision, Graphics and Image Processing, vol. 28, pp. 220-227,1984.
41. C.M. WilliamsAn Efficient Algorithm for the Piecewise Linear Approximation of Planar CurvesComputer, Graphics and Image Processing, vol. 8, pp. 286-293,1978.
42. X. Zhang, R.M. Haralick, and V. RameshCorner Detection Using the MAP TechniqueProc. 12th Int'l Conf. Pattern Recognition, pp. 549-551,1994.