DocumentCode
442484
Title
Optimal algorithm for convexity measure calculation
Author
Kolesnikov, Alexander ; Fränti, Pasi
Author_Institution
Dept. of Comput. Sci., Joensuu Univ., Finland
Volume
1
fYear
2005
fDate
11-14 Sept. 2005
Abstract
Recently a new convexity measure has been proposed based on approximation of input contour with a convex polygon. In this paper, an optimal algorithm is proposed for the construction of the convex polygon. The introduced algorithm provides exact value of the convexity measure and can therefore be used for evaluation of faster heuristic algorithms.
Keywords
image processing; convex polygon; convexity measure calculation; heuristic algorithms; optimal algorithm; Area measurement; Computer science; Dynamic programming; Genetic algorithms; Heuristic algorithms; Image analysis; Image processing; Q measurement; Shape measurement; Speech processing; convexity; dynamic programming; polygonal approximation;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 2005. ICIP 2005. IEEE International Conference on
Print_ISBN
0-7803-9134-9
Type
conf
DOI
10.1109/ICIP.2005.1529760
Filename
1529760
Link To Document