Research on Textile Dyeing Formulation Based on Young's Double-Slit Interference Experiment Optimization Algorithm
DOI:
https://doi.org/10.54097/mvsbxt27Keywords:
Textiles, color matching, K-M optical model, CIELAB uniform color space, Young's double-slit interference experiment optimizer.Abstract
With the development of intelligent algorithms, computer color matching has become an important method to improve product quality and save labor cost in printing and dyeing industry. In this paper, based on the K-M optical theory and the color difference theory of CIELAB uniform color space, and combined with the latest heuristic optimization algorithm "Young's Double-Slit Interference Experiment Optimizer (YDSE)" proposed in 2023, a feasible solution to generate textile dyeing formulas quickly is proposed. The model is tested with 12 textile target samples, and the experiments show that the proposed dyeing formulation model can converge quickly, and the color parameters of the generated scheme are closer to those of the real samples, with the maximum parameter error not exceeding 10-2 orders of magnitude, and the predicted color differences of the optimal scheme are all in the range of 10-6 orders of magnitude or less. Simultaneous testing of the sample formulations using three other common optimization algorithms, WOA, HHO, and IHHO, shows that their predicted color differences are greater than those of YDSE, proving the reliability of the model.
Downloads
References
Guan Xuemei, Yang Qusan, Wu Yan. Research on Wood Staining and Color Matching Algorithm Based on Improved Grey Wolf Optimizer-Based SVR[J]. China Forest Products Industry, 2023, 60(7).
Ding Man, YUAN Yunlei, ZHANG Xinxin, et al. Product color emotional design based on deep learning[J]. Computer Integrated Manufacturing Systems, 2023, 29(5): 1647.
Jianguo R ,Heng L ,Jiqing L . The color matching design based on polynomial regression[J]. Textile Research Journal,2022,92(7-8).
Sun Xianqiang, Xue Yuan, Liu Yuexing, et al. A neural network algorithm and its prediction model towards the full color phase mixing process of colored fibers[J]. Textile Research Journal, 2023, 93(1112):2449-2463.
Gao Jiale,Ma Lingkun,Sun Shuang. Fur color matching method based on chaotic sparrow algorithm[J]. Leather Science and Engineering,2023,33(05):22-26.
GUAN Xuemei,HUANG Jingyi,XU Baocheng et al. Research on full-spectrum wood color matching algorithm based on particle swarm optimization Stearns-Noechel model[J]. Forest Industry,2022,59(05):20-26.
H. Chen, "Research on Ink Color Matching based on Stearns Noechel and BBO Optimization Algorithm," 2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT), Haikou, China, 2021, pp. 336-339.
Zhang Ge. Research on ink color matching combining Stearns-Noechel and BBO optimization algorithm [D]. Xi'an University of Technology,2019.
Alcaraz de la Osa R, Iparragirre I, Ortiz D, et al. The extended Kubelka–Munk theory and its application to spectroscopy[J]. ChemTexts, 2020, 6: 1-14.
WANG Zhuo,YANG Ruihua,PAN Bo et al. Color matching model of color-spun yarn based on Kubelka-Munk double constant theory[J]. Cotton Textile Technology,2021,49(02):24-30.
Moussa A. Textile color formulation using linear programming based on Kubelka‐Munk and Duncan theories[J]. Color Research & Application, 2021, 46(5): 1046-1056.
Wang LJ. Research on blending color measurement based on CIELAB uniform color space and clustering algorithm [D]. Zhejiang University of Technology, 2011.
Şahin Cenk,Balcı Onur,Işık Melek, et al. Artificial neural networks approach for prediction of CIELab values for yarn after dyeing and finishing process[J]. The Journal of The Textile Institute,2023,114(9).
Mohamed A,Doaa E,Mohammed J, et al. Young’s double-slit experiment optimizer : A novel metaheuristic optimization algorithm for global and constraint optimization problems[J]. Computer Methods in Applied Mechanics and Engineering,2023,403(PA).
Downloads
Published
Conference Proceedings Volume
Section
License
Copyright (c) 2024 Highlights in Science, Engineering and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.