CN108815726A - A kind of phased array mode supersonic detection method - Google Patents
A kind of phased array mode supersonic detection method Download PDFInfo
- Publication number
- CN108815726A CN108815726A CN201810678547.5A CN201810678547A CN108815726A CN 108815726 A CN108815726 A CN 108815726A CN 201810678547 A CN201810678547 A CN 201810678547A CN 108815726 A CN108815726 A CN 108815726A
- Authority
- CN
- China
- Prior art keywords
- individual
- power
- sound wave
- population
- frequency
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000001514 detection method Methods 0.000 title claims abstract description 14
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 26
- 239000002245 particle Substances 0.000 claims abstract description 19
- 238000005457 optimization Methods 0.000 claims abstract description 14
- 230000002068 genetic effect Effects 0.000 claims abstract description 9
- 230000006870 function Effects 0.000 claims description 29
- 210000000349 chromosome Anatomy 0.000 claims description 23
- 230000035772 mutation Effects 0.000 claims description 22
- 238000000034 method Methods 0.000 claims description 15
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000010276 construction Methods 0.000 claims description 3
- 230000009326 social learning Effects 0.000 claims description 3
- 238000004088 simulation Methods 0.000 claims description 2
- 230000006978 adaptation Effects 0.000 claims 1
- 230000002759 chromosomal effect Effects 0.000 claims 1
- 230000002860 competitive effect Effects 0.000 claims 1
- 230000004044 response Effects 0.000 claims 1
- 230000013016 learning Effects 0.000 abstract description 4
- 238000002604 ultrasonography Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000002560 therapeutic procedure Methods 0.000 description 2
- 230000019771 cognition Effects 0.000 description 1
- 230000001149 cognitive effect Effects 0.000 description 1
- 239000000523 sample Substances 0.000 description 1
Classifications
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61N—ELECTROTHERAPY; MAGNETOTHERAPY; RADIATION THERAPY; ULTRASOUND THERAPY
- A61N7/00—Ultrasound therapy
- A61N7/02—Localised ultrasound hyperthermia
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B8/00—Diagnosis using ultrasonic, sonic or infrasonic waves
- A61B8/44—Constructional features of the ultrasonic, sonic or infrasonic diagnostic device
- A61B8/4411—Device being modular
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B8/00—Diagnosis using ultrasonic, sonic or infrasonic waves
- A61B8/44—Constructional features of the ultrasonic, sonic or infrasonic diagnostic device
- A61B8/4483—Constructional features of the ultrasonic, sonic or infrasonic diagnostic device characterised by features of the ultrasound transducer
- A61B8/4488—Constructional features of the ultrasonic, sonic or infrasonic diagnostic device characterised by features of the ultrasound transducer the transducer being a phased array
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61N—ELECTROTHERAPY; MAGNETOTHERAPY; RADIATION THERAPY; ULTRASOUND THERAPY
- A61N7/00—Ultrasound therapy
- A61N2007/0004—Applications of ultrasound therapy
Landscapes
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Veterinary Medicine (AREA)
- Public Health (AREA)
- Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
- General Health & Medical Sciences (AREA)
- Radiology & Medical Imaging (AREA)
- Engineering & Computer Science (AREA)
- Biomedical Technology (AREA)
- Biophysics (AREA)
- Medical Informatics (AREA)
- Molecular Biology (AREA)
- Surgery (AREA)
- Heart & Thoracic Surgery (AREA)
- Pathology (AREA)
- Physics & Mathematics (AREA)
- Gynecology & Obstetrics (AREA)
- Investigating Or Analyzing Materials By The Use Of Ultrasonic Waves (AREA)
Abstract
本发明涉及一种相控阵方式超声检测方法,属于超声检测领域,包括S1:获得体态信息,包括年龄与脂肪厚度;S2:根据体态设计输入模式,利用粒子群多目标优化算法调节每块晶片发射超声波频率、功率和声波指向;S3:输出相应的超声波频率、功率和声波指向,形成相应的焦域大小;S4:采集发射区域、时间、人体感受和焦域温度形成数据池,反馈调整、完善S2中算法;S5:根据数据库,形成学习机制,采用基于Pareto的多目标遗传算法对数据进行优化,从而保留最优的超声波频率、功率和声波指向。本发明通过调节每块晶片发射超声波频率、功率和声波指向,从而调节焦域大小,对人体进行检测,实现治疗的目的。
The invention relates to a phased array ultrasonic detection method, belonging to the field of ultrasonic detection, including S1: obtaining body posture information, including age and fat thickness; S2: designing an input mode according to the body posture, and using a particle swarm multi-objective optimization algorithm to adjust each chip Transmit ultrasonic frequency, power and sound wave direction; S3: output the corresponding ultrasonic frequency, power and sound wave direction to form the corresponding focal area size; S4: collect emission area, time, human body feeling and focal area temperature to form a data pool, feedback adjustment, Improve the algorithm in S2; S5: According to the database, form a learning mechanism, and use Pareto-based multi-objective genetic algorithm to optimize the data, so as to retain the optimal ultrasonic frequency, power and sound wave direction. The invention adjusts the frequency, power and direction of the ultrasonic waves emitted by each chip, thereby adjusting the size of the focal area, detecting the human body, and realizing the purpose of treatment.
Description
技术领域technical field
本发明属于超声检测技术领域,涉及一种相控阵方式超声检测方法。The invention belongs to the technical field of ultrasonic detection, and relates to a phased array ultrasonic detection method.
背景技术Background technique
相控阵超声是超声探头晶片的组合,由多个压电晶片按一定的规律分布排列,然后逐次按预先规定的延迟时间激发各个晶片,所有晶片发射的超声波形成一个整体波阵面,能有效地控制发射超声束(波阵面)的形状和方向,能实现超声波的波束扫描、偏转和聚焦。目前市场上的相控阵超声治疗仪器焦域大小不可以调节,因此研究一种可以调节相控阵超声焦域大小方法是非常必要的。Phased array ultrasound is a combination of ultrasonic probe chips. It consists of multiple piezoelectric chips arranged according to certain rules, and then excites each chip one by one according to a predetermined delay time. The ultrasonic waves emitted by all the chips form a whole wave front, which can effectively The shape and direction of the emitted ultrasonic beam (wave front) can be accurately controlled, and the beam scanning, deflection and focusing of the ultrasonic wave can be realized. At present, the size of the focal area of the phased-array ultrasonic therapy equipment on the market cannot be adjusted, so it is very necessary to study a method that can adjust the size of the focal area of the phased-array ultrasonic therapy.
发明内容Contents of the invention
有鉴于此,本发明的目的在于提供一种相控阵方式超声检测方法。该方法采用相控阵超声中每块晶片发射的超声波波长、功率和声波指向控制技术,对相控阵超声焦域大小进行调节,从而实现治疗的目的。为达到上述目的,本发明提供如下技术方案:In view of this, the object of the present invention is to provide a phased array ultrasonic detection method. The method adopts the ultrasonic wavelength, power and sound wave pointing control technology emitted by each chip in the phased array ultrasound to adjust the size of the focal area of the phased array ultrasound, so as to achieve the purpose of treatment. To achieve the above object, the present invention provides the following technical solutions:
一种相控阵方式超声检测方法,包括以下步骤:A phased array ultrasonic detection method, comprising the following steps:
S1:获得体态信息,包括年龄与脂肪厚度;S1: Obtain body information, including age and fat thickness;
S2:根据体态设计输入模式,利用粒子群多目标优化算法调节每块晶片发射超声波频率、功率和声波指向;S2: Design the input mode according to the posture, and use the particle swarm multi-objective optimization algorithm to adjust the ultrasonic frequency, power and sound wave direction emitted by each chip;
S3:输出相应的超声波频率、功率和声波指向,形成相应的焦域大小;S3: Output the corresponding ultrasonic frequency, power and sound wave direction to form the corresponding focal area size;
S4:采集发射区域、时间、人体感受和焦域温度形成数据池,反馈调整、完善S2中算法;S4: Collect the emission area, time, human body feeling and temperature in the focal area to form a data pool, feedback adjustment, and improve the algorithm in S2;
S5:根据数据库,形成学习机制,采用基于Pareto的多目标遗传算法对数据进行优化,从而保留最优的超声波频率、功率和声波指向。S5: According to the database, a learning mechanism is formed, and the Pareto-based multi-objective genetic algorithm is used to optimize the data, so as to retain the optimal ultrasonic frequency, power and sound wave direction.
进一步,在步骤S2中,粒子群多目标优化算法包括以下步骤:Further, in step S2, the particle swarm multi-objective optimization algorithm includes the following steps:
S21:随机产生初始粒子位置和初始速度;S21: Randomly generate the initial particle position and initial velocity;
S22:验证粒子位置和速度是否满足上、下限约束;S22: Verify whether the particle position and velocity meet the upper and lower limit constraints;
S23:将各粒子位置代入优化适应度函数f1(x)和f2(x);S23: Substituting the position of each particle into the optimization fitness function f 1 (x) and f 2 (x);
S24:更新两个目标函数优化时各自的个体极值点和 S24: Updating the respective individual extremum points when optimizing the two objective functions and
S25:更新各自全局极值点g1k和g2k;S25: update respective global extremum points g1 k and g2 k ;
当时,不变化;否则,这里,XOR表示异或运算,异或值越小说明两个目标函数的优化解越接近;when hour, unchanged; otherwise, Here, XOR represents an exclusive OR operation, and the smaller the XOR value, the closer the optimized solutions of the two objective functions are;
S26:更新粒子速度和位置:S26: Update particle velocity and position:
式中,个体极值点全局极值点gk=round((g1k+g2k)/2),round()是取整函数,完成四舍五入的功能,以满足阵元开关特性;w为速度惰性权重,取值为0.4~0.9;认知权重c1和社会学习权重c2,取值为2;In the formula, the individual extremum point The global extremum point g k = round((g1 k +g2 k )/2), round() is a rounding function, which completes the rounding function to meet the switch characteristics of the array element; w is the speed inertia weight, and the value is 0.4 ~0.9; cognition weight c 1 and social learning weight c 2 take a value of 2;
S27:判断是否满足迭代结束条件,如果不满足则返回步骤S21,若满足则结束迭代,全局极值点即作为最优解;S27: Judging whether the iteration end condition is satisfied, if not, return to step S21, if satisfied, end the iteration, and the global extremum point is taken as the optimal solution;
频率、功率和声波指向的选择:Selection of frequency, power and sonic direction:
①采用改进的粒子群算法仿真实现各级频率、功率和声波指向;①The improved particle swarm algorithm simulation is used to realize all levels of frequency, power and sound wave direction;
②满足一定检测概率的条件下,根据目标反射截面的大小、目标距离的远近,由式(1)确定需要发射的频率、功率和声波指向;② Under the condition of satisfying a certain detection probability, according to the size of the target reflection section and the distance of the target, the frequency, power and sound wave direction to be transmitted are determined by formula (1);
③判断频率、功率和声波指向所在的频率、功率、声波指向区间位置,对目标发射相应的的频率、功率、声波指向。③Judge the frequency, power, and sound wave pointing interval position where the frequency, power, and sound wave pointing are located, and launch the corresponding frequency, power, and sound wave pointing to the target.
进一步,在步骤S5中,所述基于Pareto的多目标遗传算法包括以下步骤:Further, in step S5, the multi-objective genetic algorithm based on Pareto comprises the following steps:
S51:群体的初始化:确定种群规模M、交叉概率Pc、变异概率pm染色体长度N及最大迭代次数K;随机初始化染色体,给出发射区域、时间、人体感受和焦域温度;S51: Initialization of the population: determine the population size M, crossover probability Pc, mutation probability pm, chromosome length N, and the maximum number of iterations K; randomly initialize the chromosomes, and give the emission area, time, human body feeling and focal temperature;
S52:适应度函数构造:超声波频率、功率和声波指向的目标函数和约束条件表示为:S52: Fitness function construction: the objective function and constraints of ultrasonic frequency, power and sound wave direction are expressed as:
目标函数:Objective function:
其中,S代表发射区域,T代表时间,C代表人体感受;R代表焦域温度;S、T、C和R前面的系数代表了它们在目标函数中所占比重;Among them, S represents the emission area, T represents time, C represents the human body feeling; R represents the temperature in the focal area; the coefficients in front of S, T, C and R represent their proportion in the objective function;
超声波频率、功率和声波指向的约束条件如下:The constraints of ultrasonic frequency, power and sound wave direction are as follows:
20KHz<频率<100KHz;20KHz<frequency<100KHz;
35W<功率<40W;35W<power<40W;
0°<声波指向<45°;0°<sonic direction<45°;
S53:非支配排序:首先找出种群中所有的非支配解集,视为同一层,将该层所有个体的非支配序值irank赋值1,记为第一非支配层F1;然后在种群内除该层剩余的所有个体中,找出剩余个体中的其他非支配解集,视为另一层,将该层所有个体的非支配序值irank赋值为2,记为第二非支配层F2;最后重复以上操作,使种群中的每个个体都被分层;S53: Non-dominated sorting: first find out all non-dominated solution sets in the population, and regard them as the same layer, assign 1 to the non-dominated rank value i rank of all individuals in this layer, and record it as the first non-dominated layer F1; then in the population In addition to all the remaining individuals in this layer, find out other non-dominated solution sets in the remaining individuals, and regard it as another layer, assign the non-dominated rank value i rank of all individuals in this layer to 2, and record it as the second non-dominated solution set Layer F2; finally repeat the above operation, so that each individual in the population is stratified;
S54:拥挤度计算:S54: Calculation of congestion degree:
A.对种群中个体初始化,使个体i的拥挤度为0,记作L[i]d=0;A. Initialize the individual in the population, so that the crowding degree of individual i is 0, denoted as L[i] d =0;
B.根据每个个体的适应度值进行非支配排序,设置两端个体的拥挤度值为一大数,记作L[0]d=L[I]D=∞,式中I为集合中个体数目;B. Carry out non-dominated sorting according to the fitness value of each individual, set the crowding degree value of individuals at both ends to a large number, denoted as L[0] d = L[I] D = ∞, where I is in the set number of individuals;
C.非支配排序处理后,处于中间的个体拥挤度计算公式为:C. After the non-dominated sorting process, the calculation formula of the individual crowding degree in the middle is:
D.针对多个不同的目标函数,重复步骤B和C,求出每个个体i的拥挤度L[i]d;D. For multiple different objective functions, repeat steps B and C to obtain the degree of congestion L[i] d of each individual i;
S55:精英选择:这里利用竞标赛法选择精英个体,将大小均为N的父代种群Pi和子代种群Qi合并成大小为2N的种群Ri;对种群Ri进行非支配排序分层,得到每个个体的irank,并计算出该个体在所属非支配层Fj的拥挤度;按种群Ri中每个个体的irank进行择优选择,当被选择的个体总数达到N时,组成新的父代种群Ri+1;S55: Elite selection: Here, the competition method is used to select elite individuals, and the parent population P i and the offspring population Q i , both of size N, are merged into a population R i of size 2N; the population R i is stratified by non-dominated sorting , to get the i rank of each individual, and calculate the crowding degree of the individual in the non-dominated layer F j ; according to the i rank of each individual in the population R i , the optimal selection is made, when the total number of selected individuals reaches N, Form a new parent population R i+1 ;
S56:交叉操作:判断染色体是否为活的染色体,若为活的染色体,则将染色体进行交叉,采用一点交叉方式,交叉概率为Pc,具体操作是在个体串中随机设定一个交叉点,实行交叉时,该点前或后的两个个体的部分结构进行互换,并生成两个新个体;S56: Crossover operation: judge whether the chromosome is a live chromosome, if it is a live chromosome, then cross the chromosome, adopt a one-point crossover method, and the crossover probability is Pc, the specific operation is to randomly set a crossover point in the individual string, and execute When crossing, the partial structures of the two individuals before or after the point are exchanged, and two new individuals are generated;
S57:变异操作:染色体变异采用位点变异的方式,把染色体的变异位1变为0,0变为1,其它位都保持不变;变异概率为Pm,变异的目的是使其变异后的适应度大于或等于其原适应度;先选择一个变异位进行变异,再计算它的适应度,看它是否大于或等于其原来的适应度,若不是的话就重新选择变异位进行变异;S57: Mutation operation: Chromosome mutation adopts the method of site mutation, changing the mutated bit 1 of the chromosome to 0, 0 to 1, and keeping the other bits unchanged; the mutation probability is Pm, and the purpose of the mutation is to make the mutated The fitness is greater than or equal to its original fitness; first select a mutant to mutate, and then calculate its fitness to see if it is greater than or equal to its original fitness, if not, re-select the mutant to mutate;
S58:对种群依次进行非支配排序、拥挤度计算、精英选择、交叉、变异操作后就得到的新个体,当达到最大迭代次数时算法结束得到结果,否则非支配排序、拥挤度计算、精英选择、交叉、变异操作,直到达到最大迭代次数为止。S58: Perform non-dominated sorting, crowding degree calculation, elite selection, crossover, and mutation operations on the population in sequence to obtain new individuals. When the maximum number of iterations is reached, the algorithm ends and the result is obtained; otherwise, non-dominated sorting, crowded degree calculation, elite selection , crossover, and mutation operations until the maximum number of iterations is reached.
本发明的有益效果在于:本发明所述方法采用相控阵超声中每块晶片发射的超声波波长、功率和声波指向控制技术,利用粒子群多目标优化算法调节每块晶片发射超声波频率、功率和声波指向,形成相应的焦域大小,对人体进行检测,从而实现治疗的目的;采用基于Pareto的多目标遗传算法对数据进行优化,从而保留最优的超声波频率、功率、声波指向。The beneficial effects of the present invention are: the method of the present invention adopts the ultrasonic wavelength, power and sound wave pointing control technology emitted by each chip in the phased array ultrasonic, and uses the particle swarm multi-objective optimization algorithm to adjust the ultrasonic frequency, power and sound wave emitted by each chip. The sound wave points to form the corresponding focal area size, and detects the human body to achieve the purpose of treatment; the Pareto-based multi-objective genetic algorithm is used to optimize the data, so as to retain the optimal ultrasonic frequency, power, and sound wave pointing.
附图说明Description of drawings
为了使本发明的目的、技术方案和有益效果更加清楚,本发明提供如下附图进行说明:In order to make the purpose, technical scheme and beneficial effect of the present invention clearer, the present invention provides the following drawings for illustration:
图1为本发明实施例所述的相控阵方式超声检测方法的整体流程图;Fig. 1 is the overall flowchart of the phased array mode ultrasonic detection method described in the embodiment of the present invention;
图2为本发明实施例所述的粒子群多目标优化算法流程图;Fig. 2 is the flowchart of particle swarm multi-objective optimization algorithm described in the embodiment of the present invention;
图3为本发明实施例所述的基于Pareto的多目标遗传算法流程图。Fig. 3 is a flow chart of the Pareto-based multi-objective genetic algorithm described in the embodiment of the present invention.
具体实施方式Detailed ways
下面将结合附图,对本发明的优选实施例进行详细的描述。The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
如图1所示,一种相控阵方式超声检测方法,在该方法中首先获得病人体态信息(年龄、脂肪厚度等);再根据病人体态设计输入模式,然后输出相应的超声波频率、功率、声波指向,形成相应的焦域大小,进行治疗,然后采集发射区域、时间、病人感受、焦域温度形成数据池,反馈调整、完善S2中算法;根据数据库,形成学习机制,采用基于Pareto的多目标遗传算法对数据进行优化,从而保留最优的超声波频率、功率、声波指向。As shown in Figure 1, a phased array ultrasonic detection method, in this method firstly obtains the patient's posture information (age, fat thickness, etc.); then designs the input mode according to the patient's posture, and then outputs the corresponding ultrasonic frequency, power, The sound wave points to form the corresponding focal area size, and then performs treatment, and then collects the emission area, time, patient feeling, and focal area temperature to form a data pool, and feedbacks to adjust and improve the algorithm in S2; according to the database, a learning mechanism is formed, and Pareto-based multi- The objective genetic algorithm optimizes the data so as to retain the optimal ultrasonic frequency, power, and sound wave direction.
具体来说,本方法包括以下步骤:S1:获得病人体态信息(年龄、脂肪厚度等);Specifically, the method includes the following steps: S1: Obtain the patient's body information (age, fat thickness, etc.);
S2:根据病人体态设计输入模式:利用粒子群多目标优化算法调节每块晶片发射超声波频率、功率、声波指向;S3:输出相应的超声波频率、功率、声波指向,形成相应的焦域大小;S4:采集发射区域、时间、病人感受、焦域温度形成数据池,反馈调整、完善S2中算法;S5:根据数据库,形成学习机制,采用基于Pareto的多目标遗传算法对数据进行优化,从而保留最优的超声波频率、功率、声波指向。S2: Design the input mode according to the patient's posture: use the particle swarm multi-objective optimization algorithm to adjust the ultrasonic frequency, power, and sound wave direction emitted by each chip; S3: output the corresponding ultrasonic frequency, power, and sound wave direction to form the corresponding focal area size; S4 : Collect emission area, time, patient experience, and focal temperature to form a data pool, feedback adjustment, and improve the algorithm in S2; S5: According to the database, form a learning mechanism, and use Pareto-based multi-objective genetic algorithm to optimize the data, so as to retain the most Excellent ultrasonic frequency, power, and sound wave direction.
如图2所示,在本实施例中具体步骤如下:As shown in Figure 2, the specific steps in this embodiment are as follows:
步骤1:随机产生初始粒子位置和初始速度。Step 1: Randomly generate the initial particle position and initial velocity.
步骤2:验证粒子位置、速度是否满足上、下限约束。Step 2: Verify whether the particle position and velocity meet the upper and lower limit constraints.
步骤3:将各粒子位置代入优化适应度函数f1(x)和f2(x)。Step 3: Substitute the position of each particle into the optimization fitness function f 1 (x) and f 2 (x).
步骤4:更新两个目标函数优化时各自的个体极值点和 Step 4: Update the individual extreme points of the two objective function optimizations and
步骤5:更新各自全局极值点g1k和g2k。Step 5: Update respective global extremum points g1 k and g2 k .
当时,不变化;否则,这里,XOR表示异或运算,异或值越小说明两个目标函数的优化解越接近。when hour, unchanged; otherwise, Here, XOR represents an exclusive OR operation, and the smaller the XOR value, the closer the optimized solutions of the two objective functions are.
步骤6:更新粒子速度和位置Step 6: Update Particle Velocity and Position
式中,个体极值点全局极值点gk=round((g1k+g2k)/2),这里round()是取整函数,完成四舍五入的功能,以满足阵元开关特性。w为速度惰性权重,通常取0.4~O.9;认知权重c1和社会学习权重c2。通常取2。In the formula, the individual extremum point The global extremum point g k =round((g1 k +g2 k )/2), where round() is a rounding function, which completes the rounding function to satisfy the switch characteristics of the array element. w is the weight of speed inertia, usually 0.4~0.9; cognitive weight c 1 and social learning weight c 2 . Usually take 2.
步骤7:判断是否满足迭代结束条件。如果不满足则返回步骤2,若满足则结束迭代。全局极值点即作为最优解。Step 7: Determine whether the iteration end condition is satisfied. If it is not satisfied, return to step 2, and if it is satisfied, end the iteration. The global extremum point is regarded as the optimal solution.
如图3所示,在本实施例中具体步骤如下:As shown in Figure 3, the specific steps in this embodiment are as follows:
S51:群体的初始化:确定种群规模M、交叉概率Pc、变异概率pm染色体长度N及最大迭代次数K;随机初始化染色体,给出发射区域、时间、病人感受、焦域温度;S51: Initialization of the population: determine the population size M, crossover probability Pc, mutation probability pm chromosome length N and the maximum number of iterations K; randomly initialize the chromosomes, and give the emission area, time, patient experience, and focal temperature;
S52:适应度函数构造:超声波频率、功率、声波指向的目标函数和约束条件可表示为:S52: Fitness function construction: the objective function and constraints of ultrasonic frequency, power, and sound wave direction can be expressed as:
目标函数:Objective function:
其中,S代表发射区域,T代表时间,C代表病人感受;R代表焦域温度;S、T、C和R前面的系数代表了它们在目标函数中所占比重;Among them, S represents the emission area, T represents time, C represents the patient's feeling; R represents the temperature in the focal region; the coefficients in front of S, T, C and R represent their proportion in the objective function;
超声波频率、功率、声波指向的约束条件如下:The constraints of ultrasonic frequency, power, and sound wave direction are as follows:
20KHz<频率<100KHz;20KHz<frequency<100KHz;
35W<功率<40W;35W<power<40W;
0°<声波指向<45°;0°<sonic direction<45°;
S53:非支配排序:首先找出种群中所有的非支配解集,视为同一层,将该层所有个体的非支配序值irank赋值1,记为第一非支配层F1;然后在种群内除该层剩余的所有个体中,找出剩余个体中的其他非支配解集,视为另一层,将该层所有个体的非支配序值irank赋值为2,记为第二非支配层F2;最后重复以上操作,使种群中的每个个体都被分层。S53: Non-dominated sorting: first find out all non-dominated solution sets in the population, and regard them as the same layer, assign 1 to the non-dominated rank value i rank of all individuals in this layer, and record it as the first non-dominated layer F1; then in the population In addition to all the remaining individuals in this layer, find out other non-dominated solution sets in the remaining individuals, and regard it as another layer, assign the non-dominated rank value i rank of all individuals in this layer to 2, and record it as the second non-dominated solution set Layer F2; finally repeat the above operation, so that each individual in the population is stratified.
S54:拥挤度计算:S54: Calculation of congestion degree:
A.对种群中个体初始化,使个体i的拥挤度为0,记作L[i]d=0。A. Initialize the individual in the population, make the crowding degree of individual i be 0, denoted as L[i] d =0.
B.根据每个个体的适应度值进行非支配排序,设置两端个体的拥挤度值为一大数,记作L[0]d=L[I]D=∞,式中I为集合中个体数目。B. Carry out non-dominated sorting according to the fitness value of each individual, set the crowding degree value of individuals at both ends to a large number, denoted as L[0] d = L[I] D = ∞, where I is in the set number of individuals.
C.非支配排序处理后,处于中间的个体拥挤度计算公式为C. After the non-dominated sorting process, the formula for calculating the crowding degree of the individual in the middle is
D.针对多个不同的目标函数,重复步骤B和C,求出每个个体i的拥挤度L[i]d。D. For multiple different objective functions, repeat steps B and C to obtain the crowding degree L[i] d of each individual i.
S55:精英选择:这里利用竞标赛法选择精英个体,将大小均为N的父代种群Pi和子代种群Qi合并成大小为2N的种群Ri;对种群Ri进行非支配排序分层,得到每个个体的irank,并计算出该个体在所属非支配层Fj的拥挤度;按种群Ri中每个个体的irank进行择优选择,当被选择的个体总数达到N时,组成新的父代种群Ri+1。S55: Elite selection: Here, the competition method is used to select elite individuals, and the parent population P i and the offspring population Q i , both of size N, are merged into a population R i of size 2N; the population R i is stratified by non-dominated sorting , to get the i rank of each individual, and calculate the crowding degree of the individual in the non-dominated layer F j ; according to the i rank of each individual in the population R i , the optimal selection is made, when the total number of selected individuals reaches N, Form a new parent population R i+1 .
S56:交叉操作:判断染色体是否为活的染色体,若为活的染色体,则将染色体进行交叉,采用一点交叉方式,交叉概率为Pc,具体操作是在个体串中随机设定一个交叉点,实行交叉时,该点前或后的两个个体的部分结构进行互换,并生成两个新个体。S56: Crossover operation: judge whether the chromosome is a live chromosome, if it is a live chromosome, then cross the chromosome, adopt a one-point crossover method, and the crossover probability is Pc, the specific operation is to randomly set a crossover point in the individual string, and execute When crossing, the partial structures of the two individuals before or after the point are exchanged, and two new individuals are generated.
S57:变异操作:染色体变异采用位点变异的方式,把染色体的变异位1变为0,0变为1,其它位都保持不变;变异概率为Pm,变异的目的是使其变异后的适应度大于或等于其原适应度;先选择一个变异位进行变异,再计算它的适应度,看它是否大于或等于其原来的适应度,若不是的话就重新选择变异位进行变异;S57: Mutation operation: Chromosome mutation adopts the method of site mutation, changing the mutated bit 1 of the chromosome to 0, 0 to 1, and keeping the other bits unchanged; the mutation probability is Pm, and the purpose of the mutation is to make the mutated The fitness is greater than or equal to its original fitness; first select a mutated bit to mutate, and then calculate its fitness to see if it is greater than or equal to its original fitness, if not, re-select the mutated bit to mutate;
S58:对种群依次进行非支配排序、拥挤度计算、精英选择、交叉、变异操作后就得到的新个体,当达到最大迭代次数时算法结束得到结果,否则非支配排序、拥挤度计算、精英选择、交叉、变异操作,直到达到最大迭代次数为止。S58: Perform non-dominated sorting, crowding degree calculation, elite selection, crossover, and mutation operations on the population in sequence to obtain new individuals. When the maximum number of iterations is reached, the algorithm ends and the result is obtained; otherwise, non-dominated sorting, crowded degree calculation, elite selection , crossover, and mutation operations until the maximum number of iterations is reached.
最后说明的是,以上优选实施例仅用以说明本发明的技术方案而非限制,尽管通过上述优选实施例已经对本发明进行了详细的描述,但本领域技术人员应当理解,可以在形式上和细节上对其作出各种各样的改变,而不偏离本发明权利要求书所限定的范围。Finally, it should be noted that the above preferred embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail through the above preferred embodiments, those skilled in the art should understand that it can be described in terms of form and Various changes may be made in the details without departing from the scope of the invention defined by the claims.
Claims (3)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810678547.5A CN108815726A (en) | 2018-06-27 | 2018-06-27 | A kind of phased array mode supersonic detection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810678547.5A CN108815726A (en) | 2018-06-27 | 2018-06-27 | A kind of phased array mode supersonic detection method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108815726A true CN108815726A (en) | 2018-11-16 |
Family
ID=64139114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810678547.5A Pending CN108815726A (en) | 2018-06-27 | 2018-06-27 | A kind of phased array mode supersonic detection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108815726A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114836615A (en) * | 2022-03-17 | 2022-08-02 | 大连交通大学 | Multi-frequency ultrasonic residual stress removal time distribution optimization method |
| CN114863343A (en) * | 2022-05-20 | 2022-08-05 | 湖南揽月医疗科技有限公司 | Ultrasonic therapy device control method and related equipment |
| CN119292042A (en) * | 2024-12-11 | 2025-01-10 | 山东美果来食品有限公司 | A parameter optimization method and system based on pomegranate functional factor extraction |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1820804A (en) * | 2006-01-26 | 2006-08-23 | 上海交通大学 | Large focal region formation method of phased array focused ultrasound |
| US20080119735A1 (en) * | 2006-11-20 | 2008-05-22 | Sonowise, Inc. | Ultrasound imaging system and method with offset alternate-mode line |
| US20150201910A1 (en) * | 2014-01-17 | 2015-07-23 | Centre For Imaging Technology Commercialization (Cimtec) | 2d-3d rigid registration method to compensate for organ motion during an interventional procedure |
| CN105251142A (en) * | 2015-11-13 | 2016-01-20 | 浙江大学 | Preventive maintenance method of high intensity focused ultrasound (HIFU) equipment |
-
2018
- 2018-06-27 CN CN201810678547.5A patent/CN108815726A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1820804A (en) * | 2006-01-26 | 2006-08-23 | 上海交通大学 | Large focal region formation method of phased array focused ultrasound |
| US20080119735A1 (en) * | 2006-11-20 | 2008-05-22 | Sonowise, Inc. | Ultrasound imaging system and method with offset alternate-mode line |
| US20150201910A1 (en) * | 2014-01-17 | 2015-07-23 | Centre For Imaging Technology Commercialization (Cimtec) | 2d-3d rigid registration method to compensate for organ motion during an interventional procedure |
| CN105251142A (en) * | 2015-11-13 | 2016-01-20 | 浙江大学 | Preventive maintenance method of high intensity focused ultrasound (HIFU) equipment |
Non-Patent Citations (1)
| Title |
|---|
| 岳帅: "鼓形超声换能器的设计与仿真分析", 《电子制作》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114836615A (en) * | 2022-03-17 | 2022-08-02 | 大连交通大学 | Multi-frequency ultrasonic residual stress removal time distribution optimization method |
| CN114863343A (en) * | 2022-05-20 | 2022-08-05 | 湖南揽月医疗科技有限公司 | Ultrasonic therapy device control method and related equipment |
| CN119292042A (en) * | 2024-12-11 | 2025-01-10 | 山东美果来食品有限公司 | A parameter optimization method and system based on pomegranate functional factor extraction |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109932903A (en) | The air-blower control Multipurpose Optimal Method of more parent optimization networks and genetic algorithm | |
| CN108815726A (en) | A kind of phased array mode supersonic detection method | |
| CN112686429A (en) | Mobile robot and path planning method thereof based on adaptive genetic algorithm | |
| Wang et al. | Diffail: Diffusion adversarial imitation learning | |
| CN107275801A (en) | An Array Element Arrangement Method Based on Acquired Inheritance for L-shaped Array Antenna | |
| CN105527965A (en) | Route planning method and system based on genetic ant colony algorithm | |
| CN103440361A (en) | Method for modeling etching yield in plasma body etching process | |
| CN105572658A (en) | Three-dimensional imaging sonar reception plane array element sparse optimization method based on modified Genetic algorithm | |
| CN114004153B (en) | A method for predicting penetration depth based on multi-source data fusion | |
| CN118780575B (en) | A reservoir group optimization scheduling method and system based on improved whale algorithm | |
| CN116432749A (en) | An Improved Fast Non-Dominated Sorting Genetic Algorithm | |
| CN107253194A (en) | A kind of carrying machine human arm manipulation multiple spot mapping intelligent control method and system | |
| CN115826612A (en) | Trajectory optimization method combining improved direct targeting method and adaptive genetic algorithm | |
| CN110147590B (en) | A Design Method of Helical Antenna Based on Adaptive Evolutionary Optimization Algorithm | |
| CN104376363B (en) | A kind of multiphase orthogonal code generating method based on improved immune genetic algorithm | |
| TWI762015B (en) | Method for selecting task network, system and method for determining actions based on sensing data | |
| CN110033118A (en) | Elastomeric network modeling and the blower multiobjective optimization control method based on genetic algorithm | |
| CN105069192B (en) | A kind of improved method that power of fan parameter of curve model is solved based on genetic algorithm | |
| CN111412795B (en) | Test point setting scheme generation method and device | |
| CN117850411B (en) | Path planning method for inspection robot based on improved ant lion algorithm | |
| Maryam et al. | Artificial neural network weights optimization based on imperialist competitive algorithm | |
| CN114297788B (en) | Sparse array optimization method based on improved differential evolution algorithm | |
| Singh et al. | Mutation effects on bbo evolution in optimizing yagi-uda antenna design | |
| CN115936113A (en) | A Multi-objective Optimization Algorithm for Dominant Subpopulation | |
| Singh et al. | Multi-objective gain-impedance optimization of yagi-uda antenna using nsbbo and nspso |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181116 |