Style transfer is adopted to synthesize appealing stylized images that preserve the structure of a content image but carry the pattern of a style image. Many recently proposed style transfer methods use only western oil paintings as style images to achieve image stylization. As a result, unnatural messy artistic effects are produced in stylized images when using these methods to directly transfer the patterns of traditional Chinese paintings, which are composed of plain colors and abstract objects. Moreover, most of them work only at the original image scale and thus ignore multiscale image information during training. In this paper, we present a novel effective multiscale style transfer method based on Laplacian pyramid decomposition and reconstruction, which can transfer unique patterns of Chinese paintings by learning different image features at different scales. In the first stage, the holistic patterns are transferred at low resolution by adopting a Style Transfer Base Network. Then, the details of the content and style are gradually enhanced at higher resolutions by a Detail Enhancement Network with an edge information selection (EIS) module in the second stage. The effectiveness of our method is demonstrated through the generation of appealing high-quality stylization results and a comparison with some state-of-the-art style transfer methods. Datasets and codes are available at https://github.com/toby-katakuri/LP_StyleTransferNet.
Citation: Kunxiao Liu, Guowu Yuan, Hongyu Liu, Hao Wu. Multiscale style transfer based on a Laplacian pyramid for traditional Chinese painting[J]. Electronic Research Archive, 2023, 31(4): 1897-1921. doi: 10.3934/era.2023098
[1] | Dorel Feldman . Poly(vinyl alcohol) nanocomposites: Recent contributions to engineering and medicine. AIMS Materials Science, 2021, 8(1): 119-129. doi: 10.3934/matersci.2021008 |
[2] | Rusul A. Ghazi, Khalidah H. Al-Mayalee, Ehssan Al-Bermany, Fouad Sh. Hashim, Abdul Kareem J. Albermany . Impact of polymer molecular weights and graphene nanosheets on fabricated PVA-PEG/GO nanocomposites: Morphology, sorption behavior and shielding application. AIMS Materials Science, 2022, 9(4): 584-603. doi: 10.3934/matersci.2022035 |
[3] | Zhenguo Yu, Dong Wang, Zhentan Lu . Nanocomposite hydrogel fibers in the field of diagnosis and treatment. AIMS Materials Science, 2023, 10(6): 1004-1033. doi: 10.3934/matersci.2023054 |
[4] | Madhuri Sharon, Farha Modi, Maheshwar Sharon . Titania based nanocomposites as a photocatalyst: A review. AIMS Materials Science, 2016, 3(3): 1236-1254. doi: 10.3934/matersci.2016.3.1236 |
[5] | Omar Hassan Mahmood, Mustafa Sh. Aljanabi, Farouk M. Mahdi . Effect of Cu nanoparticles on microhardness and physical properties of aluminum matrix composite prepared by PM. AIMS Materials Science, 2025, 12(2): 245-257. doi: 10.3934/matersci.2025013 |
[6] | Mohamed Jaffer Sadiq Mohamed, Denthaje Krishna Bhat . Novel ZnWO4/RGO nanocomposite as high performance photocatalyst. AIMS Materials Science, 2017, 4(1): 158-171. doi: 10.3934/matersci.2017.1.158 |
[7] | Mercy Ogbonnaya, Abimbola P.I Popoola . Potential of mucilage-based hydrogel for passive cooling technology: Mucilage extraction techniques and elucidation of thermal, mechanical and physiochemical properties of mucilage-based hydrogel. AIMS Materials Science, 2023, 10(6): 1045-1076. doi: 10.3934/matersci.2023056 |
[8] | Carlos A. Sánchez, Yamile Cardona-Maya, Andrés D. Morales, Juan S. Rudas, Cesar A. Isaza . Development and evaluation of polyvinyl alcohol films reinforced with carbon nanotubes and alumina for manufacturing hybrid metal matrix composites by the sandwich technique. AIMS Materials Science, 2021, 8(2): 149-165. doi: 10.3934/matersci.2021011 |
[9] | Chaitra Srikanth, Gattumane Motappa Madhu, Hemanth Bhamidipati, Siddarth Srinivas . The effect of CdO–ZnO nanoparticles addition on structural, electrical and mechanical properties of PVA films. AIMS Materials Science, 2019, 6(6): 1107-1123. doi: 10.3934/matersci.2019.6.1107 |
[10] | Yong X. Chen, Brian Cain, Pranav Soman . Gelatin methacrylate-alginate hydrogel with tunable viscoelastic properties. AIMS Materials Science, 2017, 4(2): 363-369. doi: 10.3934/matersci.2017.2.363 |
Style transfer is adopted to synthesize appealing stylized images that preserve the structure of a content image but carry the pattern of a style image. Many recently proposed style transfer methods use only western oil paintings as style images to achieve image stylization. As a result, unnatural messy artistic effects are produced in stylized images when using these methods to directly transfer the patterns of traditional Chinese paintings, which are composed of plain colors and abstract objects. Moreover, most of them work only at the original image scale and thus ignore multiscale image information during training. In this paper, we present a novel effective multiscale style transfer method based on Laplacian pyramid decomposition and reconstruction, which can transfer unique patterns of Chinese paintings by learning different image features at different scales. In the first stage, the holistic patterns are transferred at low resolution by adopting a Style Transfer Base Network. Then, the details of the content and style are gradually enhanced at higher resolutions by a Detail Enhancement Network with an edge information selection (EIS) module in the second stage. The effectiveness of our method is demonstrated through the generation of appealing high-quality stylization results and a comparison with some state-of-the-art style transfer methods. Datasets and codes are available at https://github.com/toby-katakuri/LP_StyleTransferNet.
The development of environmental friendly vehicles with low to no fuel consumption is increasingly important in the automotive industry. In particular, hybrid electric vehicles (HEVs) have received the most attentions. Having good fuel economy, HEVs also produce few carbon emissions, and for this reason, they are widely accepted by environmentalists. It is expected that HEVs will become the model of future vehicles due to global energy crises and global warming.
In a typical HEV, there are two energy converters—internal combustion engine (ICE) and electric motor (EM), which complicate energy flows as the conventional vehicles have only ICE. Due to this, an appropriately designed HEV control strategy that incorporates both the ICE and EM is essential. Thus far, several control strategies have been proposed and they have all been proven to improve fuel consumptions and lower engine emissions [1,2,3,4,5,6].
At the same time, the evolutionary computation methods have received considerable interest as well and they have been applied in various fields, which include, biomedical primer design [7,8,9,10,11,12], feature selections [13], non-dominated sorting [14], image processing [15], unmanned aerial vehicles (UAVs) path planning [16], wireless sensor networks [17], constructal-design work [18,19], and most importantly, HEV control strategy. Within the field of HEV control strategy and evolutionary computation, Montazeri and Poursamad have presented a genetic algorithm (GA) to minimize fuel consumption (FC) and engine emissions [20]. In it, the vehicle dynamic performance requirements as stipulated in the Partnership for a New Generation of Vehicles (PNGV) [21] was considered. In 2008, the particle swarm optimization (PSO) was proposed by Wu et al. as the search algorithm for determining optimal parameters and control strategies of powertrains for reducing FC, engine emissions and the manufacturing costs of HEVs [22]. In 2012, the Bee Algorithm (BA) was applied by Long and Nhan to minimize FC and engine emissions [23]. They also considered the PNGV constraints when determining the vehicle performance. In 2017, the Memetic Algorithm (MA) was proposed by Cheng and Lai for solving highly non-linear problems and discontinuous powertrain systems that contain several local optima. The MA is also useful for obtaining better control parameters in parallel HEVs [24]. All the aforementioned studies demonstrate that appropriate control strategies and parameters are able to reduce both the fuel consumptions and engine emissions of HEVs without sacrificing the driving performance of the vehicles. For this reason, the search for feasible control parameters is a continuous effort in the designing of HEVs.
Notwithstanding the efforts of the cited studies above, one major drawback of evolutionary algorithms is that their algorithmic parameters are difficult to be determined. This is important as inappropriate parameters can cause premature convergence of the algorithms, consequently leading to inaccurate results and time wastage as unnecessary computations are performed. In order to overcome this drawback, we propose a genetic algorithm (GA) with small population size when searching for feasible parameters in parallel HEVs control strategy. In this paper, the GAs with different five small population sizes have been implemented. The implemented GAs aim to minimize engine fuel consumptions and emissions, while maintaining the required parallel HEVs road performance. The fundamental control mechanisms of our proposed parallel HEVs are based on the electric assist control strategy (EACS) [25]. As for the dynamic performance requirements of the parallel HEVs, the criteria stipulated in the PNGV is used. The known ADvanced VehIcle SimulatOR (ADVISOR) was used to simulate the parallel HEV with the urban dynamometer driving schedule (UDDS) for estimating the performance of the proposed GA with small population size.
Figure 1 shows the structure and dynamic model of a parallel HEV. The figure shows that the parallel HEV is powered by the fuel converter/ICE and the electric motor. The battery can be charged by absorbing the excess power of the fuel converter or by the regenerative brake action of the electric motor. The power of the fuel converter through clutch is transmitted to the torque coupler by a switch. On the other hand, the power of the electric motor is directly transmitted to the torque coupler. Finally, the gearbox converts the high-speed and low-torque mechanical power, generated by either the fuel converter or electric motor, into a more efficient low-speed and high-torque power to drive the HEV.
The electric assist control strategy (EACS) is a commonly used strategy for the control of HEVs [20]. Therefore, eight independent parameters of EACS are used as the fundamental control strategy of parallel HEVs [24]. These parameters are considered by the proposed GA in order to reduce engine fuel consumption and emissions, while maintaining the required performance of parallel HEVs. The employed parameters of EACS in this paper is given in Table 1.
Parameter | Description |
SOCL | The lowest state of charge allowed. |
SOCH | The highest state of charge allowed. |
Tch | An alternator-like torque loading on the engine to recharge the battery pack. |
Tmin | Minimum torque threshold on SOC < SOCL. During low torque, the engine will be manipulated at the threshold torque (minimum torque threshold = Tmin × Tmax). Additionally, if SOC < SOCL, the electric motor serves as a generator. |
Toff | Minimum torque threshold on SOC > SOCL. During low torque and if SOC > SOCL, the engine will be shut down (minimum torque threshold = Toff × Tmax). |
ELSL | The lowest vehicle speed threshold. |
ELSH | The highest vehicle speed threshold. |
Dch | To use charge deplete strategy or charge sustaining strategy. |
In the EACS, the electric motor is employed based on the following six conditions:
(1) SOC of the battery is more than its SOCL and the required speed is less than ELS. The engine is switched off. (Figure 2, Case 1).
(2) The required torque is less than the minimum torque threshold (Toff × Tmax). The engine is switched off (Figure 2, Case 2).
(3) The engine is switched off (Figure 2, Case 1 and Case 2, and Figure 3, Case 1). The motor provides the total required torque.
(4) SOC of the battery is less than its SOCL. An alternator-like torque (Tch) is derived from the engine to charge the battery (Figure 3, Case 2).
(5) The engine charging torque is applied when the engine is started (Figure 3, Case 2).
(6) The engine torque is maintained at the minimum torque threshold (Tmin × Tmax) (Figure 3, Case 3) in order to avoid the engine from operating in low torque condition.
The Partnership for a New Generation of Vehicles (PNGV) [21] is a collaborative research program between the US government and major car companies, with the aim of commercializing highly fuel-efficient vehicles (up to 80 mpg) by 2003 [26]. The criteria of fuel-efficient vehicles as listed in the PNGV report is used as the dynamic performance requirements to maintain the road performance of the proposed HEV. The seven identified PNGV criteria are listed in Table 2.
Parameter | Description |
Acceleration time 1 | 0–60 mph in 12 s |
Acceleration time 2 | 40–60 mph in 5.3 s |
Acceleration time 3 | 0–85 mph in 23.4 s |
Maximum speed | ≥90 ft/s |
Maximum acceleration | ≥17 ft/s2 |
Distance in 5 s | ≥140 ft |
Gradeability | 6.5% gradeability at 55 mph with 272 kg additional weight for 20 min |
The flowchart of the proposed GA with small population size for searching feasible parameters of control strategy for parallel HEVs is shown in Figure 4. The flowchart can be categorized into five processes: (1) chromosome encoding, (2) small population size initialization, (3) population fitness evaluation, (4) termination judgment, and (5) evolutionary operations of the GA. They are described below.
(1) Chromosome encoding
The chromosome encoding process used in the proposed GA is based on the eight independent EACS parameters as given in Table 1. Therefore, each x chromosome is represented with eight genes as shown in (1).
x=(SOCL,SOCH,Tch,Tmin,Toff,ELSL,ELSH,Dch) | (1) |
(2) Small population size initialization
Considering the performance efficiency of the ADVISOR program, the proposed GA is conducted in small population size. The initial population of the chromosomes based on (1) is randomly generated and it is limited by a predetermined small population size.
(3) Population fitness evaluation
The fitness, also known as the objective function, of the population, is defined through a simple aggregation function as given by (2). The objective function accumulates and minimizes the fuel consumptions and engine emissions, which are made up of HC, CO and NOx.
Objective(x)=FC+HC+CO+NOx | (2) |
where x is a chromosome; FC is fuel consumption; HC is hydrocarbons, CO is carbon monoxide, and NOx is nitrogen oxides.
In addition, the penalty functions are also considered in order to maintain vehicle performance requirements. The penalty functions are based on the above seven the dynamic performance constraints of PNGV as shown in Table 2. When the vehicle performance satisfied the dynamic performance constraints of the PNGV, the penalty value is 0. However, when the vehicle performance is worse than the dynamic performance constraints of the PNGV, the absolute value of the difference between the value of the vehicle performance and the value of the dynamic performance constraints of the PNGV will be assigned as the penalty value.
Finally, the fitness function is determined by (3). It is adapted to evaluate chromosomes' fitness based on the known ADvanced VehIcle SimulatOR (ADVISOR).
fitness(x)=1/[Objective(x)+∑7i=1yi×pi(x)] | (3) |
where Yi is a penalty factor, which is determined by the considered performance in the dynamic performance constraints of PNGV. In this study, the penalty factors are set as 1.2, 1.5, 1.2, 1.2, 1.2, 1.2, and 2.0 for the seven dynamic performance constraints of the PNGV [23]; pi(x) is a penalty function.
(4) Termination judgment
In this paper, the proposed GA is terminated when the predetermined number of generations has been reached. In general, the GAs with larger number of generations has better performance results than the GAs with lesser number of generations. However, the GAs with the smaller number of generations can be performed more efficiently.
(5) Evolutionary operations
Evolutionary operations such as selection, crossover, mutation, and replacement are implemented in the proposed GA. First of all, the selection operation randomly selects two chromosomes from the population and this is followed by the crossover operation. If the generated random number is larger than the probability for crossover, the selected two chromosomes randomly exchange their genes to produce two new offspring. Then, mutation is considered. If the generated random number is larger than the probability for mutation, one of the two new offspring is selected and it undergoes random alteration of its genes in order to produce a new offspring. Finally, the replacement operation is carried out. During the operation, the least fit chromosomes will be replaced by the new chromosomes. The evolutionary operations are repeated until the termination criteria is achieved.
The user-defined parameters of the proposed GA are population size, the number of generations, the probability of crossover, and the probability of mutation. In this paper, we only consider five small population sizes of 5, 10, 15, 20, and 25. The number of generations is set to 500. The probability of crossover is set to 1.0 in order for avoid invalid generation. The probability of mutation is set to 0.1 in order to achieve 10% probability of escaping local optimum.
The urban dynamometer driving schedule (UDDS) is used for estimating the benefit of the selected parameters of control strategy. In this study, the known ADvanced VehIcle SimulatOR (ADVISOR) is used to simulate the fuel consumptions and engine emissions of parallel HEVs in UDDS and to provide the results for fitness evaluation.
The search results for feasible parameters of control strategy based on five small population sizes are shown in Table 3. From Table 3, we can observe that when the population size is 25, the proposed GA produce the highest fitness value. Furthermore, the average evolutionary fitness for the population sizes of 5, 10, 15, 20, and 25 are shown in Figure 5–Figure 9, respectively.
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
SOCL | 0.43 | 0.34 | 0.05 | 0.20 | 0.38 |
SOCH | 0.86 | 0.85 | 0.95 | 0.98 | 0.95 |
Tch | 60.20 | 12.00 | 4.40 | 3.60 | 1.00 |
Tmin | 0.74 | 0.28 | 0.27 | 0.93 | 0.12 |
Toff | 0.66 | 0.69 | 0.98 | 0.09 | 0.77 |
ELSL | 3.00 | 4.00 | 12.00 | 10.00 | 13.00 |
ELSH | 16.00 | 23.00 | 10.00 | 13.00 | 28.00 |
Dch | 1 | 1 | 1 | 1 | 1 |
Fitness value | 0.258 | 0.246 | 0.239 | 0.245 | 0.264 |
Figure 5 shows the result of the proposed GA with a population size of 5. It is observed that the fitness value increases dramatically from about 0.14 at 0 number of generations to about 0.26 at 124 number of generations. In between 126 and 250 number of generations, the observed improvement in the fitness value is insignificant. The same can observed as well between 251 and 500 number of generations. Notice that when the number of generations were increased from 124 to 125, the average fitness value decreases and it continues to drop despite the number of generations was further increased to 126. This similar trend can also be observed when the number of generations was increased from 250 to 251. The reason for the degrading of fitness values is due to the mutation operation and this shows that the average fitness is easily influenced by the mutation operation when the population size is too small, as in this case.
In Figure 6, the population size is set to 10. The result shows that the average fitness value gradually improves as the number of generations increases, except when the number of generations increases from 249 to 251. Analysis of the result also demonstrates that the influence of the mutation operation has been reduced as the population size increases.
In Figure 7, the population size is set to 15. Similarly to Figure 6, the result in this figure shows that the average fitness value improves gradually. The influence of the mutation operation has also been eliminated.
In Figure 8, the population size is set to 20. Up to until before 134 number of generations, the average fitness value improves gradually. After that, the average fitness value can no longer be improved and this signifies that the proposed GA has fallen into a local optima search.
In Figure 9, the number of population size is set to 25. It is observed that the average fitness value continues to improve up to until the maximum number of generations 500. This is widely due to the diversity of the fitness values that can be observed in the initial generations, which contributed to better solutions in the later generations.
The results for FC and emissions using the above feasible parameters of control strategy are shown in Table 4. From Table 4, we can conclude that when the population size is set to 25, the FC is the most economical at 0.0296 gal/mi. Furthermore, the emissions of HC, CO, and NOx have the lowest values at 0.577, 2.886, and 0.460 g/mi, respectively. On the other hand, when the population size is set to 5, the FC is the second most economical at 0.0312 gal/mi. However, the emissions of HC and CO are the second highest at 0.614 and 5.373 g/mi, respectively, and the emission of NOx is the highest at 0.539 g/mi. When the population size is set to 10 and 15, the values of FC and the emissions of HC, CO, and NOx are in between the results obtained by the population size of 5 and 25. When the population size is set to 20, the FC is the most uneconomical at 0.0356 gal/mi. Furthermore, the emissions of HC and CO are the highest at 0.651 and 10.809 g/mi, respectively. Therefore, the population size of 25 is the best among the five small population sizes that have been investigated for searching feasible parameters of the control strategy for reducing the FC and engine emissions.
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
FC (gal/mi) | 0.0312 | 0.0320 | 0.0319 | 0.0356 | 0.0296 |
HC (g/mi) | 0.614 | 0.609 | 0.598 | 0.651 | 0.577 |
CO (g/mi) | 5.373 | 4.314 | 3.059 | 10.809 | 2.886 |
NOx (g/mi) | 0.539 | 0.547 | 0.491 | 0.536 | 0.460 |
The results for dynamic performance based on five small population sizes are shown in Table 5. From the table, we can observe that all the obtained results satisfy to the seven dynamic performance constraints of PNGV as shown in Table 2 except the maximum acceleration parameter. The case with 25 number of population outperforms all other population sizes in six out of the seven compared parameters. The remaining parameter—maximum acceleration, registers similar performance across all population sizes.
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
0–60 mph (s) | 9.089 | 9.344 | 10.112 | 9.387 | 9.011 |
40–60 mph (s) | 4.537 | 4.719 | 5.234 | 4.746 | 4.490 |
0–85 mph (s) | 18.442 | 19.237 | 21.454 | 19.348 | 18.234 |
Maximum speed (ft/s) | 118.644 | 116.425 | 111.930 | 116.204 | 119.511 |
Maximum acceleration (ft/s2) | 16.243 | 16.243 | 16.243 | 16.243 | 16.243 |
Distance in 5 seconds (ft) | 179.567 | 178.515 | 174.876 | 178.213 | 180.195 |
Gradeability (%) | 6.5 | 6.5 | 6.5 | 6.5 | 6.5 |
The execution time of the investigated five population sizes are compared and it is shown in Figure 10. The population size that is set to 20 has the fastest execution time and it was completed in 17.55 hours. Contrary, the population size that is set to 15 is the slowest with an execution time of 19.75 hours. Despite the setting with the population size of 20 performed the fastest, its fitness value is not among the best. The reason is due it being trapped in the local optima search that no longer improves fitness value and, thus, prematurely ending the simulation, as can be observed in Figure 8. When the population size is 25, the execution time is faster than the population sizes of 5 and 15, but worse than the population size of 10. Nonetheless, the population size of 25 has the highest fitness value. This shows that the execution time is not the essential evaluation criteria for determining the feasible parameters of control strategy for parallel HEVs. Hence, the population size of 25 is still considered as the best algorithmic parameter among the five small population sizes that have been considered.
A GA with small population size is proposed in this study for providing feasible parameters of the control strategy for reducing the engine fuel consumption and emissions, while maintaining vehicle performance requirements in parallel HEVs. The EACS is used as the fundamental control strategy of parallel HEVs and the PNGV is used as the dynamic performance requirements to maintain the vehicle performance. Furthermore, the ADVISOR is used to simulate the parallel HEV based on UDDS. Five small population sizes of 5, 10, 15, 20, and 25 have been evaluated to compare their search ability for feasible parameters of the control strategy. Results show that the small population size of 25 has the best results with the highest fitness value at 0.264. Its FC, engine emissions and the dynamic performance are all better than other small population sizes. The feasible parameters of SOCL, SOCH, Tch, Tmin, Toff, ELSL, ELSH, and Dch of the control strategy was obtained at 0.38, 0.95, 1.00, 0.12, 0.77, 13.00, 28.00, and 1, respectively. The main contributions of this paper is the proposal of a small population size of GA for searching feasible control parameters to improve fuel saving and minimize engine emissions while maintaining the performance of the parallel HEVs. In the future, other advanced evolutionary methods will be compared with the proposed method in this paper. Furthermore, the conventional GA with large population size will also be compared with the proposed GA with small population size. Finally, other driving cycles will also be studied.
The authors would like to thank the funding support given by the USM short term grant: PELECT/304/60313051, the Ministry of Science and Technology (MOST) in Taiwan under grant MOST106-2218-E-027-010, and the Chaoyang University of Technology in Taiwan under grant CYUT-106-7778.
All authors declare no conflicts of interest in this paper.
[1] |
V. Kwatra, A. Schodl, I. Essa, G. Turk, A. Bobick, Graphicut textures: Image and video synthesis using graph cuts, ACM Trans. Graphics, 22 (2003), 277–286. https://doi.org/10.1145/882262.882264 doi: 10.1145/882262.882264
![]() |
[2] | A. A. Efros, W. T. Freeman, Image quilting for texture synthesis and transfer, in SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, (2001), 341–346. https://doi.org/10.1145/383259.383296 |
[3] | L. Y. Wei, M. Levoy, Fast texture synthesis using tree-structured vector quantization, in SIGGRAPH '00: Proceedings of the 27th annual conference on Computer graphics and interactive techniques, (2000), 479–488. https://doi.org/10.1145/344779.345009 |
[4] | L. A. Gatys, A. S. Ecker, M. Bethge, Image style transfer using convolutional neural networks, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2016), 2414–2423. https://doi.org/10.1109/CVPR.2016.265 |
[5] | K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image recognition, preprint, arXiv: 1409.1556. https://doi.org/10.48550/arXiv.1409.1556 |
[6] | J. Johnson, A. Alahi, F. Li, Perceptual losses for real-time style transfer and super-resolution, in Computer Vision-ECCV 2016, Springer, Cham, (2016), 694–711. https://doi.org/10.1007/978-3-319-46475-6_43 |
[7] | D. Ulyanov, V. Lebedev, A. Vedaldi, V. Lempitsky, Texture networks: feed-forward synthesis of textures and stylized images, preprint, arXiv: 1603.03417. https://doi.org/10.48550/arXiv.1603.03417 |
[8] | X. Huang, S. Belongie, Arbitrary style transfer in real-time with adaptive instance normalization, in 2017 IEEE International Conference on Computer Vision (ICCV), IEEE, Italy, (2017), 1510–1519. https://doi.org/10.1109/ICCV.2017.167 |
[9] | Y. J. Li, C. Fang, J. M. Yang, Z. Wang, X. Lu, M. Yang, Universal style transfer via feature transforms, in 31st Conference on Neural Information Processing Systems, Long Beach, CA, USA, 30 (2017). |
[10] | D. Y. Park, K. H. Lee, Arbitrary style transfer with style-attentional networks, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA, IEEE, (2019), 5873–5881. https://doi.org/10.1109/CVPR.2019.00603 |
[11] | M. Sailsbury, Drawing for Illustration, Thames & Hudson, 2022. |
[12] | J. Liang, H. Zeng, L. Zhang, High-resolution photorealistic image translation in real-time: A Laplacian Pyramid Translation Network, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, (2021), 9387–9395. https://doi.org/10.1109/CVPR46437.2021.00927 |
[13] | X. D. Mao, Q. Li, H. R. Xie, R. Y. K. Lau, Z. Wang, S. P. Smolley, Least squares generative adversarial networks, in 2017 IEEE International Conference on Computer Vision (ICCV), IEEE, Italy, (2017), 2813–2821. https://doi.org/10.1109/ICCV.2017.304 |
[14] | T. C. Wang, M. Y. Liu, J. Y. Zhu, A. Tao, J. Kautz, B. Catanzaro, High-resolution image synthesis and semantic manipulation with conditional GANs, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, Salt Lake City, USA, (2018), 8798–8807. https://doi.org/10.1109/CVPR.2018.00917 |
[15] | N. Kolkin, J. Salavon, G. Shakhnarovich, Style transfer by relaxed optimal transport and self-similarity, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Long Beach, CA, USA, (2019), 10043–10052. https://doi.org/10.1109/CVPR.2019.01029 |
[16] | C. Li, M. Wand, Precomputed real-time texture synthesis with Markovian generative adversarial networks, in Computer Vision-ECCV 2016, Springer, Cham, (2016), 702–716. https://doi.org/10.1007/978-3-319-46487-9_43 |
[17] | X. T. Li, S. F. Liu, J. Kautz, M. H. Yang, Learning linear transformations for fast image and video style transfer, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Long Beach, CA, USA, (2019), 3804–3812. https://doi.org/10.1109/CVPR.2019.00393 |
[18] | C. Li, M. Wand, Combining Markov random fields and convolutional neural networks for image synthesis, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Seattle, WA, USA, (2016), 2479–2486. https://doi.org/10.1109/CVPR.2016.272 |
[19] | X. Wang, G. Oxholm, D. Zhang, Y. Wang, Multimodal transfer: A hierarchical deep convolutional neural network for fast artistic style transfer, in 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Honolulu, USA, (2017), 7178–7186. https://doi.org/10.1109/CVPR.2017.759 |
[20] | D. Ulyanov, A. Vedaldi, V. Lempitsky, Improved texture networks: Maximizing Quality and diversity in feed-forward stylization and texture synthesis, in 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Honolulu, USA, (2017), 4105–4113. https://doi.org/10.1109/CVPR.2017.437 |
[21] | A. Sanakoyeu, D. Kotovenko, S. Lang, B. Ommer, A style-aware content loss for real-time HD style transfer, in Computer Vision-ECCV 2018, Lecture Notes in Computer Science, Springer, Cham, 11212 (2018), 715–731. https://doi.org/10.1007/978-3-030-01237-3_43 |
[22] | Y. Y. Deng, F. Tang, W. M. Dong, C. Ma, X. Pan, L. Wang, et al. StyTr2: Image style transfer with transformers, in 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, New Orleans, LA, USA, (2022), 11316–11326. https://doi.org/10.1109/cvpr52688.2022.01104 |
[23] | S. Yang, L. M. Jiang, Z. W. Liu, C. C. Loy, Pastiche master: Exemplar-based high-resolution portrait style transfer, in 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, New Orleans, LA, USA, (2022), 7683–7692. https://doi.org/10.1109/cvpr52688.2022.00754 |
[24] | V. Dumoulin, J. Shlens, M. Kudlur, A learned representation for artistic style, preprint, arXiv: 1610.07629. https://doi.org/10.48550/arXiv.1610.07629 |
[25] | Z. X. Zou, T. Y. Shi, S. Qiu, Y. Yuan, Z. Shi, Stylized neural painting, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Nashville, TN, USA, (2021), 15684–15693. https://doi.org/10.1109/cvpr46437.2021.01543 |
[26] |
W. J. Ye, C. J. Liu, Y. H. Chen, Y. Liu, C. Liu, H. Zhou, Multi-style transfer and fusion of image's regions based on attention mechanism and instance segmentation, Signal Process. Image Commun., 110 (2023). https://doi.org/10.1016/j.image.2022.116871 doi: 10.1016/j.image.2022.116871
![]() |
[27] | Z. Wang, L. Zhao, H. Chen, L. Qiu, Q. Mo, S. Lin, et al. Diversified arbitrary style transfer via deep feature perturbation, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2020), 7789–7798. |
[28] |
D. Y. Lin, Y. Wang, G. L. Xu, J. Li, K. Fu, Transform a simple sketch to a Chinese painting by a multiscale deep neural network, Algorithms, 11 (2018), 18. https://doi.org/10.3390/a11010004 doi: 10.3390/a11020018
![]() |
[29] | B. Li, C. M. Xiong, T. F. Wu, Y. Zhou, L. Zhang, R. Chu, Neural abstract style transfer for Chinese traditional painting, in Computer Vision-ACCV 2018, Lecture Notes in Computer Science, Springer, Cham, (2018), 212–227. https://doi.org/10.1007/978-3-030-20890-5_14 |
[30] | T. R. Shaham, T. Dekel, T. Michaeli, SinGAN: Learning a generative model from a single natural image, in 2019 IEEE/CVF International Conference on Computer Vision (ICCV), IEEE, (2019), 4569–4579. https://doi.org/10.1109/ICCV.2019.00467 |
[31] | L. Sheng, Z. Y. Lin, J. Shao, X. Wang, Avatar-Net: Multi-scale zero-shot style transfer by feature decoration, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, Salt Lake City, UT, USA, (2018), 8242–8250. https://doi.org/10.1109/CVPR.2018.00860 |
[32] | T. W. Lin, Z. Q. Ma, F. Li, D. L. He, X. Li, E. Ding, et al., Drafting and revision: Laplacian Pyramid network for fast high-quality artistic style transfer, in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Nashville, TN, USA, (2021), 5137–5146. https://doi.org/10.1109/CVPR46437.2021.00510 |
[33] | J. Fu, J. Liu, H. J. Tian, Y. Li, Y. Bao, Z. Fang, et al., Dual attention network for scene segmentation, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Long Beach, CA, USA, (2019), 3141–3149. https://doi.org/10.1109/CVPR.2019.00326 |
[34] | T. Y. Lin, M. Maire, S. Belongie, J. Hays, P. Perona, D. Ramanan, et al., Microsoft COCO: Common objects in context, in Computer Vision-ECCV 2014, Lecture Notes in Computer Science, Springer, Cham, (2014), 740–755. https://doi.org/10.1007/978-3-319-10602-1_48 |
[35] | D. P. Kingma, J. Ba, Adam: A method for stochastic optimization, preprint, arXiv: 1412.6980. https://doi.org/10.48550/arXiv.1412.6980 |
[36] | R. Zhang, P. Isola, A. A. Efros, E. Shechtman, O. Wang, The unreasonable effectiveness of deep features as a perceptual metric, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, Salt Lake City, UT, USA, (2018), 586–595. https://doi.org/10.1109/CVPR.2018.00068 |
[37] |
Z. Wang, A. C. Bovik, H. R. Sheikh, E. P. Simoncelli, Image quality assessment: From error visibility to structural similarity, IEEE Trans. Image Process., 13 (2004), 600–612. https://doi.org/10.1109/TIP.2003.819861 doi: 10.1109/TIP.2003.819861
![]() |
1. | Mehdi Entezam, Ashkan Ehghaghiyan, Negar Naghdi Sedeh, Seyed Hassan Jafari, Hossein Ali Khonakdar, Physicomechanical and antimicrobial characteristics of hydrogel based on poly(vinyl alcohol): Performance improvement via inclusion of chitosan-modified nanoclay, 2019, 00218995, 47444, 10.1002/app.47444 | |
2. | P A Putro, A S Sulaeman, , Synthesis and characterization of swelling properties superabsorbent Hydrogel Carboxymethylcellulose-g-Poly (Acrylic Acid)/Natrium Alginate cross-linked by gamma-ray irradiation technique, 2019, 1171, 1742-6588, 012011, 10.1088/1742-6596/1171/1/012011 | |
3. | Eugen A. Preoteasa, Elena S. Preoteasa, Ioana Suciu, Ruxandra N. Bartok, Atomic and nuclear surface analysis methods for dental materials: A review, 2018, 5, 2372-0484, 781, 10.3934/matersci.2018.4.781 | |
4. | Aliakbar Tofangchi Kalle Basti, Mehdi Jonoobi, Sima Sepahvand, Alireza Ashori, Valentina Siracusa, Davood Rabie, Tizazu H. Mekonnen, Fatemeh Naeijian, Employing Cellulose Nanofiber-Based Hydrogels for Burn Dressing, 2022, 14, 2073-4360, 1207, 10.3390/polym14061207 | |
5. | Hassan Ouachtak, Anouar El Guerdaoui, Redouane Haounati, Siham Akhouairi, Rachid El Haouti, Naima Hafid, Abdelaziz Ait Addi, Biljana Šljukić, Diogo M.F. Santos, Mohamed Labd Taha, Highly efficient and fast batch adsorption of orange G dye from polluted water using superb organo-montmorillonite: Experimental study and molecular dynamics investigation, 2021, 335, 01677322, 116560, 10.1016/j.molliq.2021.116560 | |
6. | Malsawmdawngkima Hnamte, Ajmal Koya Pulikkal, Clay-polymer nanocomposites for water and wastewater treatment: A comprehensive review, 2022, 307, 00456535, 135869, 10.1016/j.chemosphere.2022.135869 | |
7. | Reem Mohammed, Mohamed Eid M. Ali, E. Gomaa, M. Mohsen, Promising MoS2 – ZnO hybrid nanocomposite photocatalyst for antibiotics, and dyes remediation in wastewater applications, 2023, 19, 22151532, 100772, 10.1016/j.enmm.2022.100772 | |
8. | Md. Arif Roman Azady, Sony Ahmed, Md. Shafiul Islam, A review on polymer nanocomposite hydrogel preparation, characterization, and applications, 2021, 12, 2153-2257, 329, 10.5155/eurjchem.12.3.329-339.2100 | |
9. | Vaneet Kumar, Diksha Bhatt, Hamed A. El-Serehy, Sadanand Pandey, Gum katira-silver nanoparticle-based bionanocomposite for the removal of methyl red dye, 2023, 10, 2296-2646, 10.3389/fchem.2022.959104 | |
10. | Reem. Mohammed, Mohamed E.M. Ali, Decorated ZnO nanorods with Bi2S3 nanosheets for enhanced photocatalytic removal of antibiotics and analgesics: Degradation mechanism and pathway, 2023, 20, 22151532, 100885, 10.1016/j.enmm.2023.100885 | |
11. | Gharieb M. Meselhy, Mostafa Y. Nassar, Ibrahim M. Nassar, Sabry H. Seda, Auto-combustion synthesis of lanthanum-doped TiO 2 nanostructures for efficient photocatalytic degradation of crystal violet dye , 2024, 1432-8917, 1, 10.1080/14328917.2024.2304927 | |
12. | Ahmed Mubarak M., Reem Mohammed, Osama Abuzalat, Sameh Ahmed Rizk, Atef Samir Darwish, Mohammed Eid M. Ali, Effective 2,4,5-T Removal from Wastewater Using M53F Adsorbent: Synthesis, Characterization, Kinetics, and Isotherm Investigations, 2025, 10, 2366-3340, 10.1007/s41101-025-00386-9 |
Parameter | Description |
SOCL | The lowest state of charge allowed. |
SOCH | The highest state of charge allowed. |
Tch | An alternator-like torque loading on the engine to recharge the battery pack. |
Tmin | Minimum torque threshold on SOC < SOCL. During low torque, the engine will be manipulated at the threshold torque (minimum torque threshold = Tmin × Tmax). Additionally, if SOC < SOCL, the electric motor serves as a generator. |
Toff | Minimum torque threshold on SOC > SOCL. During low torque and if SOC > SOCL, the engine will be shut down (minimum torque threshold = Toff × Tmax). |
ELSL | The lowest vehicle speed threshold. |
ELSH | The highest vehicle speed threshold. |
Dch | To use charge deplete strategy or charge sustaining strategy. |
Parameter | Description |
Acceleration time 1 | 0–60 mph in 12 s |
Acceleration time 2 | 40–60 mph in 5.3 s |
Acceleration time 3 | 0–85 mph in 23.4 s |
Maximum speed | ≥90 ft/s |
Maximum acceleration | ≥17 ft/s2 |
Distance in 5 s | ≥140 ft |
Gradeability | 6.5% gradeability at 55 mph with 272 kg additional weight for 20 min |
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
SOCL | 0.43 | 0.34 | 0.05 | 0.20 | 0.38 |
SOCH | 0.86 | 0.85 | 0.95 | 0.98 | 0.95 |
Tch | 60.20 | 12.00 | 4.40 | 3.60 | 1.00 |
Tmin | 0.74 | 0.28 | 0.27 | 0.93 | 0.12 |
Toff | 0.66 | 0.69 | 0.98 | 0.09 | 0.77 |
ELSL | 3.00 | 4.00 | 12.00 | 10.00 | 13.00 |
ELSH | 16.00 | 23.00 | 10.00 | 13.00 | 28.00 |
Dch | 1 | 1 | 1 | 1 | 1 |
Fitness value | 0.258 | 0.246 | 0.239 | 0.245 | 0.264 |
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
FC (gal/mi) | 0.0312 | 0.0320 | 0.0319 | 0.0356 | 0.0296 |
HC (g/mi) | 0.614 | 0.609 | 0.598 | 0.651 | 0.577 |
CO (g/mi) | 5.373 | 4.314 | 3.059 | 10.809 | 2.886 |
NOx (g/mi) | 0.539 | 0.547 | 0.491 | 0.536 | 0.460 |
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
0–60 mph (s) | 9.089 | 9.344 | 10.112 | 9.387 | 9.011 |
40–60 mph (s) | 4.537 | 4.719 | 5.234 | 4.746 | 4.490 |
0–85 mph (s) | 18.442 | 19.237 | 21.454 | 19.348 | 18.234 |
Maximum speed (ft/s) | 118.644 | 116.425 | 111.930 | 116.204 | 119.511 |
Maximum acceleration (ft/s2) | 16.243 | 16.243 | 16.243 | 16.243 | 16.243 |
Distance in 5 seconds (ft) | 179.567 | 178.515 | 174.876 | 178.213 | 180.195 |
Gradeability (%) | 6.5 | 6.5 | 6.5 | 6.5 | 6.5 |
Parameter | Description |
SOCL | The lowest state of charge allowed. |
SOCH | The highest state of charge allowed. |
Tch | An alternator-like torque loading on the engine to recharge the battery pack. |
Tmin | Minimum torque threshold on SOC < SOCL. During low torque, the engine will be manipulated at the threshold torque (minimum torque threshold = Tmin × Tmax). Additionally, if SOC < SOCL, the electric motor serves as a generator. |
Toff | Minimum torque threshold on SOC > SOCL. During low torque and if SOC > SOCL, the engine will be shut down (minimum torque threshold = Toff × Tmax). |
ELSL | The lowest vehicle speed threshold. |
ELSH | The highest vehicle speed threshold. |
Dch | To use charge deplete strategy or charge sustaining strategy. |
Parameter | Description |
Acceleration time 1 | 0–60 mph in 12 s |
Acceleration time 2 | 40–60 mph in 5.3 s |
Acceleration time 3 | 0–85 mph in 23.4 s |
Maximum speed | ≥90 ft/s |
Maximum acceleration | ≥17 ft/s2 |
Distance in 5 s | ≥140 ft |
Gradeability | 6.5% gradeability at 55 mph with 272 kg additional weight for 20 min |
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
SOCL | 0.43 | 0.34 | 0.05 | 0.20 | 0.38 |
SOCH | 0.86 | 0.85 | 0.95 | 0.98 | 0.95 |
Tch | 60.20 | 12.00 | 4.40 | 3.60 | 1.00 |
Tmin | 0.74 | 0.28 | 0.27 | 0.93 | 0.12 |
Toff | 0.66 | 0.69 | 0.98 | 0.09 | 0.77 |
ELSL | 3.00 | 4.00 | 12.00 | 10.00 | 13.00 |
ELSH | 16.00 | 23.00 | 10.00 | 13.00 | 28.00 |
Dch | 1 | 1 | 1 | 1 | 1 |
Fitness value | 0.258 | 0.246 | 0.239 | 0.245 | 0.264 |
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
FC (gal/mi) | 0.0312 | 0.0320 | 0.0319 | 0.0356 | 0.0296 |
HC (g/mi) | 0.614 | 0.609 | 0.598 | 0.651 | 0.577 |
CO (g/mi) | 5.373 | 4.314 | 3.059 | 10.809 | 2.886 |
NOx (g/mi) | 0.539 | 0.547 | 0.491 | 0.536 | 0.460 |
Parameter | Population size | ||||
5 | 10 | 15 | 20 | 25 | |
0–60 mph (s) | 9.089 | 9.344 | 10.112 | 9.387 | 9.011 |
40–60 mph (s) | 4.537 | 4.719 | 5.234 | 4.746 | 4.490 |
0–85 mph (s) | 18.442 | 19.237 | 21.454 | 19.348 | 18.234 |
Maximum speed (ft/s) | 118.644 | 116.425 | 111.930 | 116.204 | 119.511 |
Maximum acceleration (ft/s2) | 16.243 | 16.243 | 16.243 | 16.243 | 16.243 |
Distance in 5 seconds (ft) | 179.567 | 178.515 | 174.876 | 178.213 | 180.195 |
Gradeability (%) | 6.5 | 6.5 | 6.5 | 6.5 | 6.5 |