DocumentCode :
3040813
Title :
Shape Extraction Method Using Search for Convex Hull by Genetic Algorithm
Author :
Matayoshi, Mitsukuni
Author_Institution :
Dept. of Ind. & Inf. Sci., Okinawa Int. Univ., Ginowan, Japan
fYear :
2013
fDate :
13-16 Oct. 2013
Firstpage :
1677
Lastpage :
1683
Abstract :
A search technique for convex hull and a shape extraction method using only genetic algorithm are proposed in this paper. The shape extraction method gets shape in wrapping from convex hull or approximate solution of convex hull. Small original problems are provided as the test problems, and it is shown that those convex hulls are obtained by proposed genetic algorithm method. After obtaining convex hull or approximate convex hull, crossover, a local search method, and a modified fitness function are started to get the shape in the wrapping. Consequently, the proposed GA succeeds in extracting the shape from the point sets in the plane. The experimental results show success in acquisition of the convex hull and the shape, and the mean time to obtain each problem´s convex hull is within half of one second.
Keywords :
convex programming; feature extraction; genetic algorithms; shape recognition; approximate solution; convex hull; genetic algorithm; local search method; modified fitness function; search technique; shape extraction method; Biological cells; Computational complexity; Genetic algorithms; Genetics; Search methods; Shape; Wrapping; computational geometry; convex hull; genetic algorithm; output-sensitive; shape extraction; shrink-wrapping;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man, and Cybernetics (SMC), 2013 IEEE International Conference on
Conference_Location :
Manchester
Type :
conf
DOI :
10.1109/SMC.2013.289
Filename :
6722042
Link To Document :
بازگشت