Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1122.68550
Masood, Asif
Optimized polygonal approximation by dominant point deletion. (English)
[J] Pattern Recognition 41, No. 1, 227-239 (2008). ISSN 0031-3203

Summary: An algorithm for polygonal approximation based on dominant point (DP) deletion is presented in this paper. The algorithm selects an initial set of DPs and starts eliminating them one by one depending upon the error associated with each DP. The associated error value is based on global measure. A local optimization of few neighboring points is performed after each deletion. Although the algorithm does not guarantee an optimal solution, the combination of local and global optimization is expected to produce optimal results. The algorithm is extensively tested on various shapes with varying number of DPs and error threshold. In general, optimal results were observed for about 96\% of the times. A good comparative study is also presented in this paper

MSC 2000:: *68T10 Pattern recognition
68U10 Image processing

Keywords: Dominant points; polygonal approximation; DP table; associated error value; optimal algorithm

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]