期刊文献+
共找到258篇文章
< 1 2 13 >
每页显示 20 50 100
Topological optimization of ballistic protective structures through genetic algorithms in a vulnerability-driven environment
1
作者 Salvatore Annunziata Luca Lomazzi +1 位作者 Marco Giglio Andrea Manes 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第10期125-137,共13页
Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulne... Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulnerability is to introduce protective structures to intercept and possibly stop threats.However,this type of solution can lead to a significant increase in weight,affecting the performance of the aircraft.For this reason,it is crucial to study possible solutions that allow reducing the vulnerability of the aircraft while containing the increase in structural weight.One possible strategy is to optimize the topology of protective solutions to find the optimal balance between vulnerability and the weight of the added structures.Among the many optimization techniques available in the literature for this purpose,multiobjective genetic algorithms stand out as promising tools.In this context,this work proposes the use of a in-house software for vulnerability calculation to guide the process of topology optimization through multi-objective genetic algorithms,aiming to simultaneously minimize the weight of protective structures and vulnerability.In addition to the use of the in-house software,which itself represents a novelty in the field of topology optimization of structures,the method incorporates a custom mutation function within the genetic algorithm,specifically developed using a graph-based approach to ensure the continuity of the generated structures.The tool developed for this work is capable of generating protections with optimized layouts considering two different types of impacting objects,namely bullets and fragments from detonating objects.The software outputs a set of non-dominated solutions describing different topologies that the user can choose from. 展开更多
关键词 Topological optimization Protective structure genetic algorithm SURVIVABILITY VULNERABILITY
在线阅读 下载PDF
Combining the genetic algorithms with artificial neural networks for optimization of board allocating 被引量:2
2
作者 曹军 张怡卓 岳琪 《Journal of Forestry Research》 SCIE CAS CSCD 2003年第1期87-88,共2页
This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in boa... This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in board allocating of furniture production. In the experiment, the rectangular flake board of 3650 mm 1850 mm was used as raw material to allocate 100 sets of Table Bucked. The utilizing rate of the board reached 94.14 % and the calculating time was only 35 s. The experiment result proofed that the method by using the GA for optimizing the weights of the ANN can raise the utilizing rate of the board and can shorten the time of the design. At the same time, this method can simultaneously searched in many directions, thus greatly in-creasing the probability of finding a global optimum. 展开更多
关键词 Artificial neural network genetic algorithms Back propagation model (BP model) OPTIMIZATION
在线阅读 下载PDF
Multisensor Fuzzy Stochastic Fusion Based on Genetic Algorithms 被引量:3
3
作者 胡昌振 谭惠民 《Journal of Beijing Institute of Technology》 EI CAS 2000年第1期49-54,共6页
To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the ... To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the fusion parameter coding, initial population and fitness function establishing, and fuzzy logic controller designing for genetic operations and probability choosing were completed. The discussion on the highly dimensional fusion was given. For a moving target with the division of 1 64 (velocity) and 1 75 (acceleration), the precision of fusion is 0 94 and 0 98 respectively. The fusion approach can improve the reliability and decision precision effectively. 展开更多
关键词 MULTISENSOR data fusion fuzzy random genetic algorithm
在线阅读 下载PDF
APPROXIMATION TECHNIQUES FOR APPLICATION OF GENETIC ALGORITHMS TO STRUCTURAL OPTIMIZATION 被引量:1
4
作者 金海波 丁运亮 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2003年第2期147-154,共8页
Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex str... Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model. 展开更多
关键词 approximation techniques segment approximation model genetic algorithms structural optimization sensitivity analysis
在线阅读 下载PDF
DENSE DISPARITY MAP ESTIMATION USING GENETIC ALGORITHMS 被引量:1
5
作者 王彪 沈春林 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2003年第2期184-191,共8页
An approach to addressing the stereo correspondence problem is presented using genetic algorithms (GAs) to obtain a dense disparity map. Different from previous methods, this approach casts the stereo matching as a mu... An approach to addressing the stereo correspondence problem is presented using genetic algorithms (GAs) to obtain a dense disparity map. Different from previous methods, this approach casts the stereo matching as a multi-extrema optimization problem such that finding the fittest solution from a set of potential disparity maps. Among a wide variety of optimization techniques, GAs are proven to be potentially effective methods for the global optimization problems with large search space. With this idea, each disparity map is viewed as an individual and the disparity values are encoded as chromosomes, so each individual has lots of chromosomes in the approach. Then, several matching constraints are formulated into an objective function, and GAs are used to search the global optimal solution for the problem. Furthermore, the coarse-to-fine strategy has been embedded in the approach so as to reduce the matching ambiguity and the time consumption. Finally, experimental results on synthetic and real images show the performance of the work. 展开更多
关键词 stereo correspondence disparity map genetic algorithms coarse-to-fine strategy
在线阅读 下载PDF
Optimization of Linear Antenna Arrays Based on Genetic Algorithms
6
作者 王宏建 高本庆 刘瑞祥 《Journal of Beijing Institute of Technology》 EI CAS 2002年第2期180-183,共4页
The methods of moment and genetic algorithm (GA) are combined to optimize the Yagi Uda antenna array and Log periodic dipole antenna (LPDA) array. The element lengths and spacing are optimized for the Yagi Uda arra... The methods of moment and genetic algorithm (GA) are combined to optimize the Yagi Uda antenna array and Log periodic dipole antenna (LPDA) array. The element lengths and spacing are optimized for the Yagi Uda array; while the ratio factor of spacing to length as well as the ratio of length to diameter of the elements are optimized for LPDA array. The results show that the main parameters, such as gain and pattern, have been improved apparently; and the high back lobe level of LPDA can be reduced greatly, therefore, GA is a very competent method for optimizing the linear array as well as in other fields. 展开更多
关键词 GAIN front to back ratio genetic algorithm OPTIMIZATION Yagi Uda antenna Log periodic dipole antenna
在线阅读 下载PDF
Genetic algorithm assisted meta-atom design for high-performance metasurface optics 被引量:1
7
作者 Zhenjie Yu Moxin Li +9 位作者 Zhenyu Xing Hao Gao Zeyang Liu Shiliang Pu Hui Mao Hong Cai Qiang Ma Wenqi Ren Jiang Zhu Cheng Zhang 《Opto-Electronic Science》 2024年第9期15-28,共14页
Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves... Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves selecting suitable meta-atoms to achieve target functionalities such as phase retardation,amplitude modulation,and polarization conversion.Conventional design processes often involve extensive parameter sweeping,a laborious and computationally intensive task heavily reliant on designer expertise and judgement.Here,we present an efficient genetic algorithm assisted meta-atom optimization method for high-performance metasurface optics,which is compatible to both single-and multiobjective device design tasks.We first employ the method for a single-objective design task and implement a high-efficiency Pancharatnam-Berry phase based metalens with an average focusing efficiency exceeding 80%in the visible spectrum.We then employ the method for a dual-objective metasurface design task and construct an efficient spin-multiplexed structural beam generator.The device is capable of generating zeroth-order and first-order Bessel beams respectively under right-handed and left-handed circular polarized illumination,with associated generation efficiencies surpassing 88%.Finally,we implement a wavelength and spin co-multiplexed four-channel metahologram capable of projecting two spin-multiplexed holographic images under each operational wavelength,with efficiencies over 50%.Our work offers a streamlined and easy-to-implement approach to meta-atom design and optimization,empowering designers to create diverse high-performance and multifunctional metasurface optics. 展开更多
关键词 metasurface metalens Bessel beam metahologram genetic algorithm
在线阅读 下载PDF
Optimized parameters of downhole all-metal PDM based on genetic algorithm
8
作者 Jia-Xing Lu Ling-Rong Kong +2 位作者 Yu Wang Chao Feng Yu-Lin Gao 《Petroleum Science》 SCIE EI CAS CSCD 2024年第4期2663-2676,共14页
Currently,deep drilling operates under extreme conditions of high temperature and high pressure,demanding more from subterranean power motors.The all-metal positive displacement motor,known for its robust performance,... Currently,deep drilling operates under extreme conditions of high temperature and high pressure,demanding more from subterranean power motors.The all-metal positive displacement motor,known for its robust performance,is a critical choice for such drilling.The dimensions of the PDM are crucial for its performance output.To enhance this,optimization of the motor's profile using a genetic algorithm has been undertaken.The design process begins with the computation of the initial stator and rotor curves based on the equations for a screw cycloid.These curves are then refined using the least squares method for a precise fit.Following this,the PDM's mathematical model is optimized,and motor friction is assessed.The genetic algorithm process involves encoding variations and managing crossovers to optimize objective functions,including the isometric radius coefficient,eccentricity distance parameter,overflow area,and maximum slip speed.This optimization yields the ideal profile parameters that enhance the motor's output.Comparative analyses of the initial and optimized output characteristics were conducted,focusing on the effects of the isometric radius coefficient and overflow area on the motor's performance.Results indicate that the optimized motor's overflow area increased by 6.9%,while its rotational speed reduced by 6.58%.The torque,as tested by Infocus,saw substantial improvements of38.8%.This optimization provides a theoretical foundation for improving the output characteristics of allmetal PDMs and supports the ongoing development and research of PDM technology. 展开更多
关键词 Positive displacement motor genetic algorithm Profile optimization Matlab programming Overflow area
在线阅读 下载PDF
Optimization of magnetic field design for Hall thrusters based on a genetic algorithm
9
作者 谭睿 杭观荣 王平阳 《Plasma Science and Technology》 SCIE EI CAS CSCD 2024年第7期82-92,共11页
Magnetic field design is essential for the operation of Hall thrusters.This study focuses on utilizing a genetic algorithm to optimize the magnetic field configuration of SPT70.A 2D hybrid PIC-DSMC and channel-wall er... Magnetic field design is essential for the operation of Hall thrusters.This study focuses on utilizing a genetic algorithm to optimize the magnetic field configuration of SPT70.A 2D hybrid PIC-DSMC and channel-wall erosion model are employed to analyze the plume divergence angle and wall erosion rate,while a Farady probe measurement and laser profilometry system are set up to verify the simulation results.The results demonstrate that the genetic algorithm contributes to reducing the divergence angle of the thruster plumes and alleviating the impact of high-energy particles on the discharge channel wall,reducing the erosion by 5.5%and 2.7%,respectively.Further analysis indicates that the change from a divergent magnetic field to a convergent magnetic field,combined with the upstream shift of the ionization region,contributes to the improving the operation of the Hall thruster. 展开更多
关键词 magnetic field design genetic algorithm divergence angle erosion of discharge channel convergent magnetic field
在线阅读 下载PDF
Optimization of perforation distribution for horizontal wells based on genetic algorithms 被引量:4
10
作者 Wang Zhiming Wei Jianguang +2 位作者 Zhang Jian Gong Bin Yan Haiyun 《Petroleum Science》 SCIE CAS CSCD 2010年第2期232-238,共7页
Early water breakthrough and a rapid increase in water cut are always observed in high- permeability completion intervals when perforations are uniformly distributed in the wellbore in heterogeneous reservoirs. Optimi... Early water breakthrough and a rapid increase in water cut are always observed in high- permeability completion intervals when perforations are uniformly distributed in the wellbore in heterogeneous reservoirs. Optimization of perforating parameters in partitioned sections in horizontal intervals helps homogenize the inflow from the reservoir and thus is critically important for enhanced oil recovery. This paper derives a coupled reservoir-wellbore flow model based on inflow controlling theory. Genetic algorithms are applied to solving the model as they excel in obtaining the global optimum of discrete functions. The optimized perforating strategy applies a low perforation density in high- permeability intervals and a high perforation density in low-permeability intervals. As a result, the inflow profile is homogenized and idealized. 展开更多
关键词 Well completion perforation optimization genetic algorithms PARTITION horizontal well
在线阅读 下载PDF
Tuning PID Parameters Based on a Combination of the Expert System and the Improved Genetic Algorithms 被引量:3
11
作者 Zuo Xin Zhang Junfeng Luo Xionglin 《Petroleum Science》 SCIE CAS CSCD 2005年第4期71-76,共6页
a new strategy combining an expert system and improved genetic algorithms is presented for tuning proportional-integral-derivative (PID) parameters for petrochemical processes. This retains the advantages of genetic... a new strategy combining an expert system and improved genetic algorithms is presented for tuning proportional-integral-derivative (PID) parameters for petrochemical processes. This retains the advantages of genetic algorithms, namely rapid convergence and attainment of the global optimum. Utilization of an orthogonal experiment method solves the determination of the genetic factors. Combination with an expert system can make best use of the actual experience of the plant operators. Simulation results of typical process systems examples show a good control performance and robustness. 展开更多
关键词 PID parameters tuning orthogonal experiment method genetic algorithm expert system
在线阅读 下载PDF
Comparative study of kinetic modeling for the oxidative coupling of methane by genetic and marquardt algorithms 被引量:2
12
作者 Shahrnaz Mokhtari Ali Vatani Nastaran Razmi Farooji 《Journal of Natural Gas Chemistry》 EI CAS CSCD 2010年第3期293-299,共7页
Overall kinetic studies on the oxidative coupling of methane,OCM,have been conducted in a tubular fixed bed reactor,using perovskite titanate as the reaction catalyst.The appropriate operating conditions were found to... Overall kinetic studies on the oxidative coupling of methane,OCM,have been conducted in a tubular fixed bed reactor,using perovskite titanate as the reaction catalyst.The appropriate operating conditions were found to be:temperature 750-775 ℃,total feed flow rate of 160 ml/min,CH4 /O2 ratio of 2 and GHSV of 100·min-1 .Under these conditions,C 2 yield of 28% was achieved.Correlations of the kinetic data have been performed with lumped rate equations for C2 and COx formation as functions of temperature,O2 and CH4 partial pressures.Six models have been selected among the common lumped kinetic models.The selected models have been regressed with the experimental data which were obtained from the Catatest system by genetic algorithm in order to obtain optimized parameters.The kinetic coefficients in the overall reactions were optimized by different numerical optimization methods such as:the Levenberg-Marquardt and genetic algorithms and the results were compared with one another.It has been found that the Santamaria model is in good agreement with the experimental data.The Arrhenius parameters of this model have been obtained by linear regression.It should be noted that the Marquardt algorithm is sensitive to the first guesses and there is possibility to trap in the relative minimum. 展开更多
关键词 oxidative coupling of methane KINETICS PEROVSKITE genetic algorithm marquardt algorithm
在线阅读 下载PDF
Interactive Genetic Algorithms with Fitness Adjustment 被引量:3
13
作者 GUO Guang-song GONG Dun-wei HAO Guo-sheng ZHANG Yong 《Journal of China University of Mining and Technology》 EI 2006年第4期480-484,共5页
Noises widely exist in interactive genetic algorithms. However, there is no effective method to solve this problem up to now. There are two kinds of noises, one is the noise existing in visual systems and the other is... Noises widely exist in interactive genetic algorithms. However, there is no effective method to solve this problem up to now. There are two kinds of noises, one is the noise existing in visual systems and the other is resulted from user’s preference mechanisms. Characteristics of the two noises are presented aiming at the application of interac- tive genetic algorithms in dealing with images. The evolutionary phases of interactive genetic algorithms are determined according to differences in the same individual’s fitness among different generations. Models for noises in different phases are established and the corresponding strategies for reducing noises are given. The algorithm proposed in this paper has been applied to fashion design, which is a typical example of image processing. The results show that the strategies can reduce noises in interactive genetic algorithms and improve the algorithm’s performance effectively. However, a further study is needed to solve the problem of determining the evolution phase by using suitable objective methods so as to find out an effective method to decrease noises. 展开更多
关键词 genetic algorithms interactive genetic algorithms NOISES strategies for reducing noises
在线阅读 下载PDF
The Markov Chain Analysis of Premature Convergence of Genetic Algorithms 被引量:2
14
作者 赵小艳 聂赞坎 《Chinese Quarterly Journal of Mathematics》 CSCD 2003年第4期364-368,共5页
This paper discussed CGA population Markov chain with mutation probability. For premature convergence of this algorithm, one concerned, we give its analysis of Markov chain.
关键词 genetic algorithm premature convergence uniform population
在线阅读 下载PDF
Multi-objective Collaborative Optimization for Scheduling Aircraft Landing on Closely Spaced Parallel Runways Based on Genetic Algorithms 被引量:1
15
作者 Zhang Shuqin Jiang Yu Xia Hongshan 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2016年第4期502-509,共8页
A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controlle... A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controller and the maximum fairness of airlines′scheduling.The time interval between two runways and changes of aircraft landing order were taken as the constraints.Genetic algorithm was used to solve the model,and the model constrained unit delay cost of the aircraft with multiple flight tasks to reduce its delay influence range.Each objective function value or the fitness of particle unsatisfied the constrain condition would be punished.Finally,one domestic airport hub was introduced to verify the algorithm and the model.The results showed that the genetic algorithm presented strong convergence and timeliness for solving constraint multi-objective aircraft landing problem on closely spaced parallel runways,and the optimization results were better than that of actual scheduling. 展开更多
关键词 air transportation runway scheduling closely spaced parallel runways genetic algorithm multi-objections
在线阅读 下载PDF
Research on the fully fuzzy time-cost trade-off based on genetic algorithms 被引量:1
16
作者 JIN Chao-guang JI Zhuo-shang +2 位作者 LIN Yan ZHAO Yuan-min HUANG Zhen-dong 《Journal of Marine Science and Application》 2005年第3期18-23,共6页
It is very difficult to estimate exact values of time and cost of an activity in project scheduling process because many uncertain factors, such as weather, productivity level, human factors etc. , dynamically affect ... It is very difficult to estimate exact values of time and cost of an activity in project scheduling process because many uncertain factors, such as weather, productivity level, human factors etc. , dynamically affect them during project implementation process. A GAs-based fully fuzzy optimal time-cost trade-off model is presented based on fuzzy sets and genetic algorithms (GAs). In tihs model all parameters and variables are characteristics by fuzzy numbers. And then GAs is adopted to search for the optimal solution to this model. The method solves the time-cost trade-off problems under an uncertain environment and is proved practicable through a giving example in ship building scheduling. 展开更多
关键词 fuzzy sets ranking fuzzy number genetic algorithms time-cost trade-off
在线阅读 下载PDF
Optimizing neural networks by genetic algorithms for predicting particulate matter concentration in summer in Beijing 被引量:1
17
作者 王芳 《Journal of Chongqing University》 CAS 2010年第3期117-123,共7页
We developed and tested an improved neural network to predict the average concentration of PM10(particulate matter with diameter smaller than 10 ?m) several hours in advance in summer in Beijing.A genetic algorithm op... We developed and tested an improved neural network to predict the average concentration of PM10(particulate matter with diameter smaller than 10 ?m) several hours in advance in summer in Beijing.A genetic algorithm optimization procedure for optimizing initial weights and thresholds of the neural network was also evaluated.This research was based upon the PM10 data from seven monitoring sites in Beijing urban region and meteorological observation data,which were recorded every 3 h during summer of 2002.Two neural network models were developed.Model I was built for predicting PM10 concentrations 3 h in advance while Model II for one day in advance.The predictions of both models were found to be consistent with observations.Percent errors in forecasting the numerical value were about 20.This brings us to the conclusion that short-term fluctuations of PM10 concentrations in Beijing urban region in summer are to a large extent driven by meteorological conditions.Moreover,the predicted results of Model II were compared with the ones provided by the Models-3 Community Multiscale Air Quality(CMAQ) modeling system.The mean relative errors of both models were 0.21 and 0.26,respectively.The performance of the neural network model was similar to numerical models,when applied to short-time prediction of PM10 concentration. 展开更多
关键词 PM10 concentration neural network genetic algorithm prediction
在线阅读 下载PDF
Research on Modified Shifting Balance Genetic Algorithms 被引量:1
18
作者 MA Hong-mei GONG Dun-wei 《Journal of China University of Mining and Technology》 EI 2007年第2期188-192,共5页
The increasing overlap of core and colony populations during the anaphase of evolution may limit the performance of shifting balance genetic algorithms. To decrease such overlapping,so as to increase the local search ... The increasing overlap of core and colony populations during the anaphase of evolution may limit the performance of shifting balance genetic algorithms. To decrease such overlapping,so as to increase the local search capability of the core population,the sub-space method was used to generate uniformly distributed initial colony populations over the decision variable space. The core population was also dynamically divided,making simultaneous searching in several local spaces possible. The algorithm proposed in this paper was compared to the original one by searching for the optimum of a complicated multi-modal function. The results indicate that the solutions obtained by the modified algorithm are better than those of the original algorithm. 展开更多
关键词 genetic algorithms shifting balance genetic algorithms small spaces dynamic partition multi-modal function
在线阅读 下载PDF
Neural network fault diagnosis method optimization with rough set and genetic algorithms
19
作者 孙红岩 《Journal of Chongqing University》 CAS 2006年第2期94-97,共4页
Aiming at the disadvantages of BP model in artificial neural networks applied to intelligent fault diagnosis, neural network fault diagnosis optimization method with rough sets and genetic algorithms are presented. Th... Aiming at the disadvantages of BP model in artificial neural networks applied to intelligent fault diagnosis, neural network fault diagnosis optimization method with rough sets and genetic algorithms are presented. The neural network nodes of the input layer can be calculated and simplified through rough sets theory; The neural network nodes of the middle layer are designed through genetic algorithms training; the neural network bottom-up weights and bias are obtained finally through the combination of genetic algorithms and BP algorithms. The analysis in this paper illustrates that the optimization method can improve the performance of the neural network fault diagnosis method greatly. 展开更多
关键词 rough sets genetic algorithm BP algorithms artificial neural network encoding rule
在线阅读 下载PDF
Fragile Watermarking of 3D Models Using Genetic Algorithms
20
作者 Mukesh Motwani Rakhi Motwani Frederick Harris 《Journal of Electronic Science and Technology》 CAS 2010年第3期244-250,共7页
This paper describes a novel algorithm for fragile watermarking of 3D models. Fragile watermarking requires detection of even minute intentional changes to the 3D model along with the location of the change. This pose... This paper describes a novel algorithm for fragile watermarking of 3D models. Fragile watermarking requires detection of even minute intentional changes to the 3D model along with the location of the change. This poses a challenge since inserting random amount of watermark in all the vertices of the model would generally introduce perceptible distortion. The proposed algorithm overcomes this challenge by using genetic algorithm to modify every vertex location in the model so that there is no perceptible distortion. Various experimental results are used to justify the choice of the genetic algorithm design parameters. Experimental results also indicate that the proposed algorithm can accurately detect location of any mesh modification. 展开更多
关键词 3D mesh models fragile water- marking genetic algorithms SNR.
在线阅读 下载PDF
上一页 1 2 13 下一页 到第
使用帮助 返回顶部