원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.9 No.10
2016.10
pp.269-280
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
With the continuous improvement of the economic level, people pay more and more attention to the appreciation of art. Art of flower arranging is an art following certain laws of creation and it has a long history. At present, the flower shape depends mainly on the arrangements’ experience and personal preferences. This paper attempts to use genetic algorithm optimized by the K-medoids algorithm for its research, through the replacement of the genetic algorithm to get more design solutions, so as to broaden the designer's ideas, to achieve the innovation of art design. Experiments show that the beauty of floral works produced by the optimized genetic algorithm is better than that produced by traditional genetic algorithm.
목차
Abstract
1. Introduction
2. Flower Clustering Method Based on K-medoids Algorithm and Genetic Algorithm
2.1. Feature Extraction and Evaluation of Flowers
2.2. Flower Clustering Method of Genetic Algorithm Based on K-medoids Algorithm Optimization
3. Study on Floral Art Design Based on Genetic Algorithm Optimized byK-medoidsAlgorithm
3.1. Coding
3.2. Generation of the Initial Population
3.3. Determination of Fitness Function
3.4. Implementation of the Selection Operator
3.5. Implementation of the Crossover Operator
3.6. Implementation of Mutation Operator
3.7.Algorithm Process inThis Paper
4. Case Analysis
5. Conclusions
References
1. Introduction
2. Flower Clustering Method Based on K-medoids Algorithm and Genetic Algorithm
2.1. Feature Extraction and Evaluation of Flowers
2.2. Flower Clustering Method of Genetic Algorithm Based on K-medoids Algorithm Optimization
3. Study on Floral Art Design Based on Genetic Algorithm Optimized byK-medoidsAlgorithm
3.1. Coding
3.2. Generation of the Initial Population
3.3. Determination of Fitness Function
3.4. Implementation of the Selection Operator
3.5. Implementation of the Crossover Operator
3.6. Implementation of Mutation Operator
3.7.Algorithm Process inThis Paper
4. Case Analysis
5. Conclusions
References
저자정보
참고문헌
자료제공 : 네이버학술정보