IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6668929.html
   My bibliography  Save this article

Illustration Design Model with Clustering Optimization Genetic Algorithm

Author

Listed:
  • Jing Liu
  • Qixing Chen
  • Xiaoying Tian
  • Wei Wang

Abstract

For the application of the standard genetic algorithm in illustration art design, there are still problems such as low search efficiency and high complexity. This paper proposes an illustration art design model based on operator and clustering optimization genetic algorithm. First, during the operation of the genetic algorithm, the values of the crossover probability and the mutation probability are dynamically adjusted according to the characteristics of the population to improve the search efficiency of the algorithm, then the k-medoids algorithm is introduced to optimize the clustering of the genetic algorithm, and a cost function is used to carry out and evaluate the quality of clustering to optimize the complexity of the original algorithm. In addition, a multiobjective optimization genetic algorithm with complex constraints based on group classification is proposed. This algorithm focuses on the problem of group diversity and uses k-means cluster analysis operation to solve the problem of group diversity. The algorithm divides the entire group into four subgroups and assigns appropriate fitness values to reflect the optimal preservation strategy. A large number of computer simulation calculations show that the algorithm can obtain a widely distributed and uniform Pareto optimal solution, the evolution speed is fast, usually only a few iterations can achieve a good optimization effect, and finally the improved genetic algorithm is used to design the random illustration art. The example simulation shows that the improved algorithm proposed in this paper can achieve higher artistic and innovative illustration art design.

Suggested Citation

  • Jing Liu & Qixing Chen & Xiaoying Tian & Wei Wang, 2021. "Illustration Design Model with Clustering Optimization Genetic Algorithm," Complexity, Hindawi, vol. 2021, pages 1-10, January.
  • Handle: RePEc:hin:complx:6668929
    DOI: 10.1155/2021/6668929
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6668929.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6668929.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6668929?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6668929. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.