Instrumental shade sorting of coloured fabrics using genetic algorithm and particle swarm optimisation
Source abstract
Abstract
Abstract In the present research by combination of Clemson Colour Clustering (CCC) instrumental shade sorting method and two metaheuristic algorithms, a genetic algorithm (GA) and a particle swarm optimisation (PSO), two new shade sorting methods, called CCCGA and CCCPSO were proposed. Then these proposed methods were applied on 16 well‐prepered colour sets made of coloured fabrics and their results were compared using some important performance evaluation factors. The results of the methods were also compared with conventional CCC shade sorting method and a method based on CCC combined with k‐means technique (CCCk). The results obtained from various shade sorting methods showed that the CCCGA and CCCPSO methods successfully sorted the coloured fabrics with high efficiency, and their results slightly outperformed the results of the CCC method.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Color perception and design · Textile materials and evaluations · Sensory Analysis and Statistical Methods
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Textile Engineering Department University of Guilan Rasht Iran
Center of Excellence for Color Science and Technology Tehran Iran
Textile Engineering Department Isfahan University of Technology Isfahan Iran
References (31)
Show source-provided references
1. 10.1002/1520-6378(200010)25:5<368::AID-COL8>3.0.CO;2-F10.1002/1520-6378(200010)25:5<368::AID-COL8>3.0.CO;2-F ↗
2. 10.1111/j.1478-4408.1998.tb01984.x10.1111/j.1478-4408.1998.tb01984.x ↗
3. 10.1533/9780857090195.1.16710.1533/9780857090195.1.167 ↗
4. 10.1177/00405175010710040210.1177/004051750107100402 ↗
5. 10.1002/col.2211610.1002/col.22116 ↗
6. 10.1177/004051751985993310.1177/0040517519859933 ↗
7. 10.1002/col.2258110.1002/col.22581 ↗
8. 10.1002/col.2260210.1002/col.22602 ↗
9. 10.5604/01.3001.0014.779410.5604/01.3001.0014.7794 ↗
10. 10.5604/01.3001.0014.779310.5604/01.3001.0014.7793 ↗
11. 10.1080/00405000.2020.186867210.1080/00405000.2020.1868672 ↗
12. 10.1016/B978-0-12-813314-9.00010-410.1016/B978-0-12-813314-9.00010-4 ↗
13. 10.1007/s10462-017-9605-z10.1007/s10462-017-9605-z ↗
14. 10.7551/mitpress/3927.001.000110.7551/mitpress/3927.001.0001 ↗
15. 10.1016/j.eswa.2017.09.00510.1016/j.eswa.2017.09.005 ↗
16. 10.12928/telkomnika.v17i3.1007210.12928/telkomnika.v17i3.10072 ↗
17. 10.1007/s11042-020-10139-610.1007/s11042-020-10139-6 ↗
18. 10.1016/S0031-3203(99)00137-510.1016/S0031-3203(99)00137-5 ↗
19. 10.1007/978-3-540-73190-0_210.1007/978-3-540-73190-0_2 ↗
20. Shams‐Nateri A · 2018 · 353
21. KennedyJ EberhartR.Particle swarm optimization.Paper Presented at Proceedings of IEEE‐International Conference on Neural Network Perth Australia 1995;4:1942–1948.
22. 10.5539/cis.v3n1p18010.5539/cis.v3n1p180 ↗
23. A comprehensive survey on particle swarm optimization algorithm and its applications
24. 10.1155/2008/10897210.1155/2008/108972 ↗
25. 10.1007/s10115-013-0624-z10.1007/s10115-013-0624-z ↗
26. 10.1007/s00500-016-2474-610.1007/s00500-016-2474-6 ↗
27. 10.1016/j.eswa.2020.11323310.1016/j.eswa.2020.113233 ↗
28. Clustering approaches for high‐dimensional databases: a review
29. AATCC · 1999
30. 10.1111/j.1478-4408.1999.tb00303.x10.1111/j.1478-4408.1999.tb00303.x ↗
31. 10.1111/j.1478-4408.1999.tb00346.x10.1111/j.1478-4408.1999.tb00346.x ↗