Effective Data Reduction by the Curvature-Based Polygonal Approximation
スポンサーリンク
概要
- 論文の詳細を見る
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(n^2) 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.
- 社団法人電子情報通信学会の論文
- 1997-02-25
著者
-
Harada K
Hiroshima Univ. Higashi‐hiroshima‐shi Jpn
-
Harada Koichi
Faculty of Integrated Arts and Sciences, Hiroshima University
-
MIYAOKU Kento
NTT Human Interface Laboratories
-
Harada Koichi
Faculty Of Integrated Arts And Sciences Hiroshima University
-
HARADA Koichi
Faculty of Integrated Arts & Sciences
関連論文
- Ferry Scheduling via SAA
- The Cone Intersection Method for Min-# Polygonal Approximation in R^2
- Effective Data Reduction by the Curvature-Based Polygonal Approximation
- Effects of Ekman Layer on Flows and Temperature of Viscoelastic Fluid in a Rotating Frame