For object analysis and recognition, an original shape often needs to be described by using a small number of vertices. Polygonal approximation is one of the useful methods for the description. In this paper, we propose the curvature-based polygonal approximation (CBPA) method that is an application of the weighted polygonal approximation problem which minimizes the number of vertices of an approximate curve for a given error tolerance (the weighted minimum number problem). The CBPA method considers the curvature information of each vertex of an input curve as the weight of the vertex, and it can be executed in O(n2) time where n is the number of vertices of the input curve. Experimental results show that this method is effective even in the case when relatively few vertices are given as an original shape of a planar object, such as handwritten letters, figures (freehand curves) and wave-form data.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kento MIYAOKU, Koichi HARADA, "Effective Data Reduction by the Curvature-Based Polygonal Approximation" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 2, pp. 250-258, February 1997, doi: .
Abstract: For object analysis and recognition, an original shape often needs to be described by using a small number of vertices. Polygonal approximation is one of the useful methods for the description. In this paper, we propose the curvature-based polygonal approximation (CBPA) method that is an application of the weighted polygonal approximation problem which minimizes the number of vertices of an approximate curve for a given error tolerance (the weighted minimum number problem). The CBPA method considers the curvature information of each vertex of an input curve as the weight of the vertex, and it can be executed in O(n2) time where n is the number of vertices of the input curve. Experimental results show that this method is effective even in the case when relatively few vertices are given as an original shape of a planar object, such as handwritten letters, figures (freehand curves) and wave-form data.
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_2_250/_p
Copy
@ARTICLE{e80-d_2_250,
author={Kento MIYAOKU, Koichi HARADA, },
journal={IEICE TRANSACTIONS on Information},
title={Effective Data Reduction by the Curvature-Based Polygonal Approximation},
year={1997},
volume={E80-D},
number={2},
pages={250-258},
abstract={For object analysis and recognition, an original shape often needs to be described by using a small number of vertices. Polygonal approximation is one of the useful methods for the description. In this paper, we propose the curvature-based polygonal approximation (CBPA) method that is an application of the weighted polygonal approximation problem which minimizes the number of vertices of an approximate curve for a given error tolerance (the weighted minimum number problem). The CBPA method considers the curvature information of each vertex of an input curve as the weight of the vertex, and it can be executed in O(n2) time where n is the number of vertices of the input curve. Experimental results show that this method is effective even in the case when relatively few vertices are given as an original shape of a planar object, such as handwritten letters, figures (freehand curves) and wave-form data.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Effective Data Reduction by the Curvature-Based Polygonal Approximation
T2 - IEICE TRANSACTIONS on Information
SP - 250
EP - 258
AU - Kento MIYAOKU
AU - Koichi HARADA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1997
AB - For object analysis and recognition, an original shape often needs to be described by using a small number of vertices. Polygonal approximation is one of the useful methods for the description. In this paper, we propose the curvature-based polygonal approximation (CBPA) method that is an application of the weighted polygonal approximation problem which minimizes the number of vertices of an approximate curve for a given error tolerance (the weighted minimum number problem). The CBPA method considers the curvature information of each vertex of an input curve as the weight of the vertex, and it can be executed in O(n2) time where n is the number of vertices of the input curve. Experimental results show that this method is effective even in the case when relatively few vertices are given as an original shape of a planar object, such as handwritten letters, figures (freehand curves) and wave-form data.
ER -