CN107656248A - A kind of Intelligent radar sea clutter forecast system and method based on shuffled frog leaping algorithm - Google Patents
A kind of Intelligent radar sea clutter forecast system and method based on shuffled frog leaping algorithm Download PDFInfo
- Publication number
- CN107656248A CN107656248A CN201711115286.8A CN201711115286A CN107656248A CN 107656248 A CN107656248 A CN 107656248A CN 201711115286 A CN201711115286 A CN 201711115286A CN 107656248 A CN107656248 A CN 107656248A
- Authority
- CN
- China
- Prior art keywords
- frog
- sea clutter
- radar
- module
- group
- 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
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S7/00—Details of systems according to groups G01S13/00, G01S15/00, G01S17/00
- G01S7/02—Details of systems according to groups G01S13/00, G01S15/00, G01S17/00 of systems according to group G01S13/00
- G01S7/36—Means for anti-jamming, e.g. ECCM, i.e. electronic counter-counter measures
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S13/00—Systems using the reflection or reradiation of radio waves, e.g. radar systems; Analogous systems using reflection or reradiation of waves whose nature or wavelength is irrelevant or unspecified
- G01S13/88—Radar or analogous systems specially adapted for specific applications
Abstract
The invention discloses a kind of Intelligent radar sea clutter forecast system and method based on shuffled frog leaping algorithm, system is sequentially connected by radar, database and host computer and formed, radar is irradiated to detected marine site, and radar sea clutter data storage to described database, described host computer are included into data preprocessing module, robust forecasting model modeling module, intelligent optimizing module, sea clutter forecast module, discrimination model update module and result display module.The present invention is directed to the chaotic characteristic of radar sea clutter, radar sea clutter data are reconstructed, and nonlinear fitting is carried out to the data after reconstruct, introduce shuffled frog leaping algorithm method, so as to establish the intelligent prediction model of radar sea clutter, so as to on-line prediction radar sea clutter.Modeling method used in the present invention only needs less sample；And reduce the influence of human factor, and intelligent height, strong robustness.
Description
Technical Field
The invention relates to the field of radar data processing, in particular to an intelligent radar sea clutter prediction system and method based on a mixed frog-leaping algorithm.
Background
Sea clutter, i.e. backscattered echoes from a piece of the sea surface illuminated by the radar transmitted signal. The sea clutter has a serious restriction on the detectability of radar echoes of targets such as 'point' targets from the sea surface or targets close to the sea surface, such as navigation buoys and ice blocks floating on the sea, so that the research on the sea clutter has very important influence on the detection performance of ships and other targets in the ocean background, thereby having important theoretical significance and practical value.
Traditionally, the Shanghai clutter is considered to be a single random process, such as lognormal distribution, K distribution, and the like. However, these models have their specific limitations in practical applications, and one of the important reasons is that the sea clutter appears to be a random waveform and does not actually have random distribution characteristics.
Disclosure of Invention
In order to overcome the defects that the traditional radar data processing is easily influenced by human factors and is insufficient in intelligence, the invention provides the intelligent radar sea clutter forecasting system and method based on the mixed frog-leaping algorithm, which are high in intelligence and capable of avoiding the influence of the human factors.
The technical scheme adopted by the invention for solving the technical problem is as follows: the utility model provides an intelligence radar sea clutter forecast system based on mixed frog-leaping algorithm, includes radar, database and host computer, and radar, database and host computer link to each other in proper order, the radar shines the sea area that detects to reach radar sea clutter data storage the database, the host computer include:
the data preprocessing module is used for preprocessing the radar sea clutter data and is completed by adopting the following processes:
(1) The radar irradiates the detected sea area and stores the radar sea clutter data into the database;
(2) Collecting N radars from a databaseSea clutter echo signal amplitude x i As training samples, i =1, · N;
(3) Carrying out normalization processing on the training sample to obtain a normalized amplitude value
Wherein minx represents the minimum value in the training samples, and maxx represents the maximum value in the training samples;
(4) Reconstructing the normalized training sample to respectively obtain an input matrix X and a corresponding output matrix Y:
wherein D represents reconstruction dimension, D is a natural number and is less than N, and the value range of D is 50-70;
the robust forecasting model modeling module is used for establishing a forecasting model and is completed by adopting the following processes:
substituting X and Y obtained by the data preprocessing module into the following linear equation:
wherein
Weighting factor v i Calculated from the following formula:
whereinIs an error variable xi i Estimation of the standard deviation, c 1 ,c 2 Is a constant;
solving to obtain a function f (x) to be estimated:
where M is the number of support vectors, 1 v ＝[1,...,1] T ,The superscript T represents the transpose of the matrix,is a Lagrange multiplier, b * Is the offset, K = exp (— | | x) i -x j ||/θ 2 ) Wherein i =1, \8230;, M, j =1, \8230;, M,and exp (- | | x-x) i ||/θ 2 ) Kernel functions, x, all of which are support vector machines j The amplitude of a jth radar sea clutter echo signal is shown, theta is a nuclear parameter, x represents an input variable, and gamma is a penalty coefficient;
the intelligent optimizing module optimizes the kernel parameter theta and the penalty coefficient gamma of the robust forecasting model by adopting a mixed frog-leaping algorithm and finishes the following processes:
step 1: initializing frog group parameters, setting the frog group number as P, the maximum iteration number Maxgen, and the iteration number M of local search max Maximum update length D max The number of groups m and the number of frogs n per group n, the position p being the model for which two parameters need to be optimized i Is 2-dimensional and is randomInto the position p of each frog i ＝(p i1 ,p i2 ) Setting the initial iteration times k =0;
step 2: calculating the fitness values of all frogs, sequencing, grouping and selecting the frog p with the optimal population g ；
And step 3: updating the worst frogs in the subgroups according to the formula, reordering the worst frogs in the subgroups, and updating the worst frogs in the subgroups; the local search process M is repeated max Secondly;
D＝rand×(p b -p w )
p′ w ＝p w +D,-D max ≤D≤D max
wherein p is w Is the worst frog in subgroup p b Frog being optimal for subgroup D max Is the maximum variation scale, p' w Is a renewed frog. Firstly, updating by using the optimal frog of the sub-group, and replacing the newly obtained frog if the new frog is superior to the worst frog of the original sub-group; otherwise, replacing the optimal frog of the sub-group with the optimal frog of the population for updating, and replacing the newly obtained frog with the worst frog of the original sub-group if the newly obtained frog is better than the worst frog of the original sub-group; otherwise, a frog is randomly generated to replace the worst frog in the original subgroup.
And 4, step 4: when the local search of all subgroups is finished, all frogs are mixed, ordered and grouped, and a frog p with the best population is selected g ；
And 5: k = k +1, if k&If yes, turning to the step 3; otherwise, outputting the frog x with the optimal population g The algorithm is terminated for the optimal parameters of the robust prediction model;
the initial population size is 200, the number of groups is 10, the number of subgroups in each group is 20, the maximum iteration number of the population is 100, the maximum iteration number of the subgroups is 10, and the maximum update length is 5.
The sea clutter prediction module is used for predicting sea clutter and comprises the following steps:
1) D sea clutter echo signal amplitudes are collected at the sampling time t to obtain TX = [ x = [) t-D+1 ,…,x t ]，x t-D+1 Represents t-Sea clutter echo signal amplitude, x at D +1 sampling time t Representing the amplitude of the sea clutter echo signal at the tth sampling moment;
2) Carrying out normalization processing;
3) And substituting the function f (x) to be estimated obtained by the robust prediction model modeling module to calculate and obtain the sea clutter prediction value at the sampling moment (t + 1).
And the judgment model updating module is used for acquiring data according to a set sampling time interval, comparing the obtained actual measurement data with a model forecast value, and if the relative error is more than 10%, adding new data into training sample data and updating the forecast model.
And the result display module is used for displaying the forecast value calculated by the sea clutter forecasting module on the upper computer.
A radar sea clutter forecasting method used by an intelligent radar sea clutter forecasting system based on a mixed frog leaping algorithm comprises the following steps:
(1) The radar irradiates the detected sea area and stores the radar sea clutter data into the database;
(2) Collecting N radar sea clutter echo signal amplitudes x from database i As training samples, i = 1.·, N;
(3) Carrying out normalization processing on the training sample to obtain a normalized amplitude value
Wherein minx represents the minimum value in the training samples, and maxx represents the maximum value in the training samples;
(4) Reconstructing the normalized training sample to respectively obtain an input matrix X and a corresponding output matrix Y:
wherein D represents a reconstruction dimension, D is a natural number and is less than N, and the value range of D is 50-70;
(5) And substituting the obtained X and Y into the following linear equation:
wherein
Weight factor v i Calculated from the following formula:
whereinIs an error variable xi i Estimation of the standard deviation, c 1 ,c 2 Is a constant;
solving to obtain a function f (x) to be estimated:
where M is the number of support vectors, 1 v ＝[1,...,1] T ,The superscript T represents the transpose of the matrix,is a Lagrange multiplier, b * Is the offset, K = exp (— | | x) i -x j ||/θ 2 ) Wherein i =1, \8230, M, j =1, \8230, M,and exp (- | x-x) i ||/θ 2 ) Kernel functions, x, both support vector machines j The amplitude of a jth radar sea clutter echo signal is shown, theta is a nuclear parameter, x represents an input variable, and gamma is a penalty coefficient;
(6) And (3) optimizing the nuclear parameter theta and the penalty coefficient gamma in the step (5) by using a mixed frog-leaping algorithm, and completing the following steps:
(6.1): initializing frog group parameters, setting the frog group number as P, the maximum iteration number Maxgen, and the iteration number M of local search max Maximum update length D max Number of groups m and number of frogs n per group, since the model has two parameters to be optimized, the position p i Is 2-dimensional, randomly generating the position p of each frog i ＝(p i1 ,p i2 ) Setting the initial iteration times k =0;
(6.2): calculating all frog fitness values, sequencing, grouping and selecting the frog p with the optimal population g ；
(6.3): updating the worst frogs in the subgroups according to the formula, reordering the frogs in the subgroups, and updating the worst frogs in the subgroups; repeat the local search process M max Secondly;
D＝rand×(p b -p w )
p′ w ＝p w +D,-D max ≤D≤D max
wherein p is w Is the worst frog in subgroup p b Frog being optimal for subgroup D max Is the maximum variation scale, p' w Is a renewed frog. First of allUpdating with the optimal frog of the sub-group, and replacing the newly obtained frog with the worst frog of the original sub-group; otherwise, replacing the optimal frog of the sub-group with the optimal frog of the population for updating, and replacing the newly obtained frog with the worst frog of the original sub-group if the newly obtained frog is better than the worst frog of the original sub-group; otherwise, a frog is randomly generated to replace the worst frog in the original subgroup.
(6.4): when the local search of all subgroups is finished, all frogs are mixed, ordered and grouped, and a frog p with the best population is selected g ；
(6.5): k = k +1, if k&If the key point is not in the key point, the step (5.3) is carried out; otherwise, outputting the frog x with the optimal population g The algorithm is terminated for the optimal parameters of the robust prediction model;
the initial population size is 200, the number of groups is 10, the number of subgroups in each group is 20, the maximum iteration number of the population is 100, the maximum iteration number of the subgroups is 10, and the maximum update length is 5.
(7) Acquiring D sea clutter echo signal amplitudes at a sampling time t to obtain TX = [ x = t-D+1 ,…,x t ]，x t-D+1 Representing the amplitude, x, of the sea clutter echo signal at the t-D +1 th sampling instant t Representing the amplitude of the sea clutter echo signal at the tth sampling moment;
(8) And (3) carrying out normalization treatment:
(9) Substituting the function f (x) to be estimated obtained in the step (5) to calculate and obtain a sea clutter prediction value at the sampling moment (t + 1), and displaying the calculated sea clutter prediction value on an upper computer;
(10) Collecting data according to a set sampling time interval, comparing the obtained measured data with a model forecast value, and if the relative error is more than 10%, adding new data into training sample data and updating the forecast model.
The technical conception of the invention is as follows: the method aims at the chaotic characteristic of the radar sea clutter, reconstructs radar sea clutter data, performs nonlinear fitting on the reconstructed data, and introduces a mixed frog-leaping algorithm method, so as to establish an intelligent forecasting model of the radar sea clutter.
The invention has the following beneficial effects: 1. a radar sea clutter prediction model is established, and radar sea clutter can be predicted on line; 2. the modeling method only needs fewer samples; 3. the influence of human factors is reduced, the intelligence is high, and the robustness is strong.
Drawings
FIG. 1 is a hardware block diagram of the system proposed by the present invention;
fig. 2 is a functional block diagram of the upper computer according to the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings. The present embodiments are to be considered as illustrative and not restrictive, and all changes and modifications that come within the spirit of the invention and the scope of the appended claims are intended to be embraced therein.
Example 1
Referring to fig. 1 and 2, an intelligence radar sea clutter forecast system based on mixed frog-leaping algorithm, includes database 2 and host computer 3 that radar 1 connects, and radar 1, database 2 and host computer 3 link to each other in proper order, radar 1 shines the sea area that detects to reach radar sea clutter data storage database 2, host computer 3 include:
the data preprocessing module 4 is used for preprocessing the radar sea clutter data and is completed by adopting the following processes:
(1) The radar irradiates the detected sea area and stores the radar sea clutter data into the database;
(2) Collecting N radar sea clutter echo signal amplitudes x from database i As training samples, i = 1.., N;
(3) Carrying out normalization processing on the training sample to obtain a normalized amplitude value
Wherein minx represents the minimum value in the training samples, and maxx represents the maximum value in the training samples;
(4) Reconstructing the normalized training sample to respectively obtain an input matrix X and a corresponding output matrix Y:
wherein D represents a reconstruction dimension, D is a natural number and is less than N, and the value range of D is 50-70;
the robust forecasting model modeling module 5 is used for building a forecasting model and is completed by adopting the following processes:
substituting X and Y obtained by the data preprocessing module into the following linear equation:
wherein
Weighting factor v i Calculated from the following formula:
whereinIs the error variable xi i Estimation of the standard deviation, c 1 ,c 2 Is a constant quantity
Solving to obtain a function f (x) to be estimated:
where M is the number of support vectors, 1 v ＝[1,...,1] T ,The superscript T represents the transpose of the matrix,is a Lagrange multiplier, b * Is the offset, K = exp (— | | x) i -x j ||/θ 2 ) Wherein i =1, \8230;, M, j =1, \8230;, M,and exp (- | x-x) i ||/θ 2 ) Kernel functions, x, both support vector machines j The amplitude of a jth radar sea clutter echo signal is shown, theta is a nuclear parameter, x represents an input variable, and gamma is a penalty coefficient;
the intelligent optimizing module 6 is used for optimizing a kernel parameter theta and a penalty coefficient gamma of the robust forecasting model by adopting a mixed frog leaping algorithm, and is completed by adopting the following processes:
step 1: initializing frog group parameters, setting the frog group number as P, the maximum iteration number Maxgen, and the iteration number M of local search max Maximum update length D max Number of groups m and number of frogs n per group, since the model has two parameters to be optimized, the position p i Is 2-dimensional, randomly generating the position p of each frog i ＝(p i1 ,p i2 ) Setting the initial iteration number k =0;
step 2: calculating all frog fitness values, sequencing, grouping and selecting the frog p with the optimal population g ；
And step 3: updating the worst frogs in the subgroups according to the formula, reordering the frogs in the subgroups, and updating the worst frogs in the subgroups; the local search process M is repeated max Secondly;
D＝rand×(p b -p w )
p′ w ＝p w +D,-D max ≤D≤D max
wherein p is w Is the worst frog in subgroup p b Frog being optimal for subgroup D max Is the maximum variation scale, p' w Is an updated frog. Firstly, updating by using the optimal frog of the sub-group, and replacing the new frog with the worst frog of the original sub-group if the new frog is superior to the worst frog of the original sub-group; otherwise, replacing the optimal frog of the sub-group with the optimal frog of the population for updating, and replacing the newly obtained frog with the worst frog of the original sub-group if the newly obtained frog is better than the worst frog of the original sub-group; otherwise, a frog is randomly generated to replace the worst frog in the original subgroup.
And 4, step 4: when the local search of all subgroups is completed, all frogs are mixed, ordered and grouped, and the frog p with the best group is selected g ；
And 5: k = k +1, if k&If yes, turning to the step 3; otherwise, outputting the frog x with the optimal population g The algorithm is terminated for the optimal parameters of the robust prediction model;
the initial population size is 200, the number of groups is 10, the number of subgroups in each group is 20, the maximum iteration number of the population is 100, the maximum iteration number of the subgroups is 10, and the maximum update length is 5.
The sea clutter prediction module 7 is used for predicting sea clutter and is completed by adopting the following processes:
1) D sea clutter echo signal amplitudes are collected at the sampling time t to obtain TX = [ x = [) t-D+1 ,…,x t ]，x t-D+1 Representing the amplitude, x, of the sea clutter echo signal at the t-D +1 th sampling instant t Representing the amplitude of the sea clutter echo signal at the tth sampling moment;
2) Carrying out normalization processing;
3) And substituting the function f (x) obtained by the robust forecasting model modeling module to obtain the sea clutter forecasting value at the sampling moment (t + 1).
And the discrimination model updating module 8 is used for acquiring data according to a set sampling time interval, comparing the obtained actual measurement data with a model forecast value, and if the relative error is more than 10%, adding new data into training sample data and updating the forecast model.
And the result display module 9 is used for displaying the forecast value calculated by the sea clutter forecasting module on the upper computer.
The hardware part of the upper computer 3 comprises: the I/O element is used for collecting data and transmitting information; the data memory is used for storing data samples, operation parameters and the like required by operation; a program memory storing a software program for realizing the function module; an arithmetic unit that executes a program to realize a designated function; and the display module displays the set parameters and the operation result.
Example 2
Referring to fig. 1 and 2, an intelligent radar sea clutter forecasting method based on a mixed frog leaping algorithm comprises the following steps:
(1) The radar irradiates the detected sea area and stores the radar sea clutter data into the database;
(2) Collecting N radar sea clutter echo signal amplitudes x from database i As training samples, i = 1.·, N;
(3) Carrying out normalization processing on the training sample to obtain a normalized amplitude value
Wherein minx represents the minimum value in the training samples, and maxx represents the maximum value in the training samples;
(4) Reconstructing the normalized training sample to respectively obtain an input matrix X and a corresponding output matrix Y:
wherein D represents a reconstruction dimension, D is a natural number and is less than N, and the value range of D is 50-70;
(5) And substituting the obtained X and Y into the following linear equation:
wherein
Weighting factor v i Calculated from the following formula:
whereinIs the error variable xi i Estimation of the standard deviation, c 1 ,c 2 Is a constant;
solving to obtain a function f (x) to be estimated:
where M is the number of support vectors, 1 v ＝[1,...,1] T ,The superscript T represents the transpose of the matrix,is a Lagrange multiplier, b * Is the offset, K = exp (— | | x) i -x j ||/θ 2 ) Wherein i =1, \8230;, M, j =1, \8230;, M,and exp (- | x-x) i ||/θ 2 ) Kernel functions, x, all of which are support vector machines j The amplitude of a jth radar sea clutter echo signal is shown, theta is a nuclear parameter, x represents an input variable, and gamma is a penalty coefficient;
(6) And (3) optimizing the nuclear parameter theta and the penalty coefficient gamma in the step (5) by using a mixed frog-leaping algorithm, and completing the following steps:
(6.1): initializing frog group parameters, setting the frog group number as P, the maximum iteration number Maxgen, and the iteration number M of local search max Maximum update Length D max The number of groups m and the number of frogs n per group n, the position p being the model for which two parameters need to be optimized i Is 2-dimensional, randomly generating the position p of each frog i ＝(p i1 ,p i2 ) Setting the initial iteration number k =0;
(6.2): calculating the fitness values of all frogs, sequencing, grouping and selecting the frog p with the optimal population g ；
(6.3): updating the worst frogs in the subgroups according to the formula, reordering the frogs in the subgroups, and updating the worst frogs in the subgroups; the local search process M is repeated max Secondly;
D＝rand×(p b -p w )
p′ w ＝p w +D,-D max ≤D≤D max
wherein p is w Is the worst frog in subgroup p b Frog being optimal for subgroup D max Is the maximum variation scale, p' w Is an updated frog. Firstly, updating by using the optimal frog of the sub-group, and replacing the newly obtained frog if the new frog is superior to the worst frog of the original sub-group; otherwise, replacing the frog with the optimal population for updating the frog with the optimal population, and replacing the frog with the optimal population if the newly obtained frog is superior to the original frog with the worst population; otherwise, a frog is randomly generated to replace the worst frog in the original subgroup.
(6.4): when the local search of all subgroups is completed, all frogs are mixed, ordered and grouped, and the frog p with the best group is selected g ；
(6.5): k = k +1, if k&If the key point is not in the key point, the step (5.3) is carried out; otherwise, outputting the frog x with the optimal population g The algorithm is terminated for the optimal parameters of the robust prediction model;
the initial population size is 200, the number of groups is 10, the number of subgroups in each group is 20, the maximum iteration number of the population is 100, the maximum iteration number of the subgroups is 10, and the maximum update length is 5.
(7) Acquiring D sea clutter echo signal amplitudes at a sampling time t to obtain TX = [ x = t-D+1 ,…,x t ]，x t-D+1 Representing the amplitude, x, of the sea clutter echo signal at the t-D +1 th sampling instant t Representing the amplitude of the sea clutter echo signal at the tth sampling moment;
(8) And (3) carrying out normalization treatment:
(9) Substituting the function f (x) to be estimated obtained in the step (5) to calculate a sea clutter prediction value at the sampling moment (t + 1), and displaying the calculated sea clutter prediction value on an upper computer;
(10) And acquiring data according to a set sampling time interval, comparing the obtained actual measurement data with a model forecast value, and if the relative error is more than 10%, adding new data into training sample data and updating the forecast model.
According to the embodiment, the radar sea clutter prediction model is established, and the radar sea clutter can be predicted on line; the used modeling method only needs fewer samples; in addition, the influence of human factors is reduced, and the method is high in intelligence and strong in robustness.
Claims (2)
1. The utility model provides an intelligence radar sea clutter prediction system based on mixed frog leaping algorithm, includes radar, database and host computer, and radar, database and host computer link to each other in proper order, its characterized in that: the radar irradiates the detected sea area and stores radar sea clutter data into the database, and the upper computer comprises a data preprocessing module, a robust forecasting model modeling module, an intelligent optimizing module, a sea clutter forecasting module, a discrimination model updating module and a result display module;
the data preprocessing module is used for preprocessing the radar sea clutter data and is completed by adopting the following processes:
(1) The radar irradiates the detected sea area and stores the radar sea clutter data into the database;
(2) Collecting N radar sea clutter echo signal amplitudes x from database i As training samples, i = 1.., N;
(3) Carrying out normalization processing on the training sample to obtain a normalized amplitude value
Wherein minx represents the minimum value in the training samples, and maxx represents the maximum value in the training samples;
(4) Reconstructing the normalized training sample to respectively obtain an input matrix X and a corresponding output matrix Y:
wherein D represents a reconstruction dimension, D is a natural number and is less than N, and the value range of D is 50-70;
the robust forecasting model modeling module is used for establishing a forecasting model and is completed by adopting the following processes:
substituting X and Y obtained by the data preprocessing module into the following linear equation:
wherein
Weighting factor v i Calculated from the following formula:
whereinIs the error variable xi i Estimation of the standard deviation, c 1 ,c 2 Is a constant;
solving to obtain a function f (x) to be estimated:
where M is the number of support vectors, 1 v ＝[1,...,1] T ,The superscript T represents the transpose of the matrix,is a Lagrange multiplier, b * Is the offset, K = exp (— | | x) i -x j ||/θ 2 ) Wherein i =1, \8230;, M, j =1, \8230;, M,and exp (- | x-x) i ||/θ 2 ) Kernel functions, x, both support vector machines j For the jth radar sea clutter echo signal amplitude, theta is a nuclear parameter, x represents an input variable, and gamma is a penalty coefficient;
the intelligent optimizing module is used for optimizing a kernel parameter theta and a penalty coefficient gamma of the robust forecasting model by adopting a mixed frog leaping algorithm, and is completed by adopting the following processes:
(A) The method comprises the following steps Initializing frog group parameters, setting the frog group number as P, the maximum iteration number Maxgen, and the iteration number M of local search max Maximum update length D max Number of groups m and number of frogs n per group, since the model has two parameters to be optimized, the position p i Is 2-dimensional, randomly generating the position p of each frog i ＝(p i1 ,p i2 ) Setting the initial iteration times k =0;
(B) The method comprises the following steps Calculating all frog fitness values, sequencing, grouping and selecting the frog p with the optimal population g ；
(C) The method comprises the following steps Updating the worst frogs in the subgroups according to the formula, reordering the frogs in the subgroups, and updating the worst frogs in the subgroups; repeat the local search process M max Secondly;
D＝rand×(p b -p w )
p′ w ＝p w +D,-D max ≤D≤D max
wherein p is w Is the worst frog in subgroup p b Frog being optimal for subgroup D max Is the maximum variation scale, p' w Is a renewed frog.
Firstly, updating by using the optimal frog of the sub-group, and replacing the newly obtained frog if the new frog is superior to the worst frog of the original sub-group; otherwise, replacing the optimal frog of the sub-group with the optimal frog of the population for updating, and replacing the newly obtained frog with the worst frog of the original sub-group if the newly obtained frog is better than the worst frog of the original sub-group; otherwise, a frog is randomly generated to replace the worst frog in the original subgroup.
(D) The method comprises the following steps When the local search of all subgroups is completed, all frogs are mixed, ordered and grouped, and the frog p with the best group is selected g ；
(E) The method comprises the following steps k = k +1, if k&If yes, then go to step (C); otherwise, outputting the frog x with the optimal population g The algorithm is terminated for the optimal parameters of the robust prediction model;
the initial population size is 200, the number of groups is 10, the number of subgroups in each group is 20, the maximum iteration number of the population is 100, the maximum iteration number of the subgroups is 10, and the maximum update length is 5.
The sea clutter prediction module is used for predicting sea clutter and comprises the following steps:
(a) D sea clutter echo signal amplitudes are acquired at a sampling time t to obtain TX = [ x ] t-D+1 ,…,x t ]，x t-D+1 Represents the amplitude, x, of the sea clutter echo signal at the t-D +1 th sampling time t Representing the amplitude of the sea clutter echo signal at the tth sampling moment, (b) carrying out normalization processing;
(c) And substituting the function f (x) to be estimated obtained by the robust prediction model modeling module, and calculating to obtain the sea clutter prediction value at the sampling moment (t + 1).
And the judgment model updating module is used for acquiring data according to a set sampling time interval, comparing the obtained actual measurement data with a model forecast value, and if the relative error is more than 10%, adding new data into training sample data and updating the forecast model.
And the result display module is used for displaying the forecast value calculated by the sea clutter forecasting module on the upper computer.
2. The radar sea clutter prediction method of the intelligent radar sea clutter prediction system based on the mixed frog-leaping algorithm as claimed in claim 1, wherein said method comprises the following steps:
(1) The radar irradiates the detected sea area and stores the radar sea clutter data into the database;
(2) Collecting N radar sea clutter echo signal amplitudes x from database i As training samples, i = 1.·, N;
(3) Carrying out normalization processing on the training sample to obtain a normalized amplitude value
Wherein minx represents the minimum value in the training samples, and maxx represents the maximum value in the training samples;
(4) Reconstructing the normalized training sample to respectively obtain an input matrix X and a corresponding output matrix Y:
wherein D represents a reconstruction dimension, D is a natural number and is less than N, and the value range of D is 50-70;
(5) And substituting the obtained X and Y into the following linear equation:
wherein
Weighting factor v i Calculated from the following formula:
whereinIs the error variable xi i Estimation of the standard deviation, c 1 ,c 2 Is a constant;
solving to obtain a function f (x) to be estimated:
where M is the number of support vectors, 1 v ＝[1,...,1] T ,The superscript T represents the transpose of the matrix,is a Lagrange multiplier, b * Is the offset, K = exp (— | | x) i -x j ||/θ 2 ) Wherein i =1, \8230, M, j =1, \8230, M,and exp (- | x-x) i ||/θ 2 ) All are kernel functions of support vector machineNumber, x j For the jth radar sea clutter echo signal amplitude, theta is a nuclear parameter, x represents an input variable, and gamma is a penalty coefficient;
(6) And (4) optimizing the kernel parameter theta and the penalty coefficient gamma in the step (5) by using a mixed frog-leaping algorithm, and completing the optimization by adopting the following processes:
(6.1): initializing frog group parameters, setting the frog group number as P, the maximum iteration number Maxgen, and the iteration number M of local search max Maximum update length D max The number of groups m and the number of frogs n per group n, the position p being the model for which two parameters need to be optimized i Is 2-dimensional, randomly generating the position p of each frog i ＝(p i1 ,p i2 ) Setting the initial iteration number k =0;
(6.2): calculating the fitness values of all frogs, sequencing, grouping and selecting the frog p with the optimal population g ；
(6.3): updating the worst frogs in the subgroups according to the formula, reordering the frogs in the subgroups, and updating the worst frogs in the subgroups; the local search process M is repeated max Secondly;
D＝rand×(p b -p w )
p′ w ＝p w +D,-D max ≤D≤D max
wherein p is w Is the worst frog of the subgroup, p b Frog being optimal for subgroup D max Is the maximum variation scale, p' w Is an updated frog. Firstly, updating by using the optimal frog of the sub-group, and replacing the newly obtained frog if the new frog is superior to the worst frog of the original sub-group; otherwise, replacing the frog with the optimal population for updating the frog with the optimal population, and replacing the frog with the optimal population if the newly obtained frog is superior to the original frog with the worst population; otherwise, a frog is randomly generated to replace the worst frog in the original subgroup.
(6.4): when the local search of all subgroups is completed, all frogs are mixed, ordered and grouped, and the frog p with the best group is selected g ；
(6.5): k = k +1, if k&If it is, maxgen, go to step (5.3); otherwiseOutputting the frog x with the best population g The algorithm is terminated for the optimal parameters of the robust prediction model;
the initial population size is 200, the number of groups is 10, the number of subgroups in each group is 20, the maximum iteration number of the population is 100, the maximum iteration number of the subgroups is 10, and the maximum update length is 5.
(7) D sea clutter echo signal amplitudes are collected at the sampling time t to obtain TX = [ x = [) t-D+1 ,…,x t ]，x t-D+1 Representing the amplitude, x, of the sea clutter echo signal at the t-D +1 th sampling instant t Representing the amplitude of the sea clutter echo signal at the tth sampling moment;
(8) And (3) carrying out normalization treatment:
(9) Substituting the function f (x) to be estimated obtained in the step (5) to calculate and obtain a sea clutter prediction value at the sampling moment (t + 1), and displaying the calculated sea clutter prediction value on an upper computer;
(10) And acquiring data according to a set sampling time interval, comparing the obtained actual measurement data with a model forecast value, and if the relative error is more than 10%, adding new data into training sample data and updating the forecast model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711115286.8A CN107656248A (en) | 2017-11-13 | 2017-11-13 | A kind of Intelligent radar sea clutter forecast system and method based on shuffled frog leaping algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711115286.8A CN107656248A (en) | 2017-11-13 | 2017-11-13 | A kind of Intelligent radar sea clutter forecast system and method based on shuffled frog leaping algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107656248A true CN107656248A (en) | 2018-02-02 |
Family
ID=61120322
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711115286.8A Pending CN107656248A (en) | 2017-11-13 | 2017-11-13 | A kind of Intelligent radar sea clutter forecast system and method based on shuffled frog leaping algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107656248A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109142996A (en) * | 2018-08-24 | 2019-01-04 | 西南交通大学 | A kind of test method of oil-immersed and high-voltage casing moisture point of entry |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7372393B2 (en) * | 2006-07-07 | 2008-05-13 | Mitsubishi Electric Research Laboratories, Inc. | Method and system for determining unwrapped phases from noisy two-dimensional wrapped-phase images |
| CN102147463A (en) * | 2011-03-03 | 2011-08-10 | 浙江大学 | System and method for forecasting Qunzhi radar sea clutters |
| CN102147465A (en) * | 2011-03-03 | 2011-08-10 | 浙江大学 | System and method for detecting sea target by chaos optimizing radar |
| CN102147464A (en) * | 2011-03-03 | 2011-08-10 | 浙江大学 | Intelligent system and method for forecasting robust radar sea clutter |
| CN102183749A (en) * | 2011-03-03 | 2011-09-14 | 浙江大学 | Sea target detecting system of adaptive radar and method thereof |
-
2017
- 2017-11-13 CN CN201711115286.8A patent/CN107656248A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7372393B2 (en) * | 2006-07-07 | 2008-05-13 | Mitsubishi Electric Research Laboratories, Inc. | Method and system for determining unwrapped phases from noisy two-dimensional wrapped-phase images |
| CN102147463A (en) * | 2011-03-03 | 2011-08-10 | 浙江大学 | System and method for forecasting Qunzhi radar sea clutters |
| CN102147465A (en) * | 2011-03-03 | 2011-08-10 | 浙江大学 | System and method for detecting sea target by chaos optimizing radar |
| CN102147464A (en) * | 2011-03-03 | 2011-08-10 | 浙江大学 | Intelligent system and method for forecasting robust radar sea clutter |
| CN102183749A (en) * | 2011-03-03 | 2011-09-14 | 浙江大学 | Sea target detecting system of adaptive radar and method thereof |
Non-Patent Citations (1)
| Title |
|---|
| 刘悦婷: "基于混合蛙跳的数据挖掘模糊聚类算法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109142996A (en) * | 2018-08-24 | 2019-01-04 | 西南交通大学 | A kind of test method of oil-immersed and high-voltage casing moisture point of entry |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ji et al. | Seabed sediment classification using multibeam backscatter data based on the selecting optimal random forest model | |
| Akbarifard et al. | Predicting sea wave height using Symbiotic Organisms Search (SOS) algorithm | |
| CN102147464B (en) | Intelligent system and method for forecasting robust radar sea clutter | |
| Birks | Numerical methods for the analysis of diatom assemblage data | |
| CN112001270B (en) | Ground radar automatic target classification and identification method based on one-dimensional convolutional neural network | |
| CN107480619B (en) | Noise-reduction method and system based on EEMD and the Ground Penetrating Radar B-scan image for arranging entropy | |
| CN102147463A (en) | System and method for forecasting Qunzhi radar sea clutters | |
| CN102147465A (en) | System and method for detecting sea target by chaos optimizing radar | |
| CN106680776B (en) | The low sidelobe waveform design method insensitive to doppler information | |
| CN104318593B (en) | Simulation method and system of radar sea clusters | |
| CN105699952A (en) | Double-quantile estimation method for sea clutter K distribution shape parameter | |
| CN110458129A (en) | Nonmetallic mine recognition methods based on depth convolutional neural networks | |
| CN107703493A (en) | Sea clutter optimal soft survey instrument and method based on adaptive drosophila optimized algorithm Optimized Least Square Support Vector | |
| CN108931776A (en) | A kind of high-precision Matched Field localization method | |
| CN107656248A (en) | A kind of Intelligent radar sea clutter forecast system and method based on shuffled frog leaping algorithm | |
| Güntürkün | Sequential reconstruction of driving-forces from nonlinear nonstationary dynamics | |
| CN102147466B (en) | Agile radar data processing system and method | |
| CN107703492A (en) | A kind of Intelligent radar sea clutter forecast system and method based on improvement shuffled frog leaping algorithm | |
| CN107966683A (en) | A kind of the Intelligent radar sea clutter forecast system and method for the algorithm that leapfroged based on ADAPTIVE MIXED | |
| CN107942299A (en) | A kind of Intelligent radar sea target detection system and method based on improvement shuffled frog leaping algorithm | |
| CN102183746A (en) | Radar marine target detection system and method | |
| CN107942303A (en) | A kind of Intelligent radar sea clutter forecast system and method based on improvement artificial bee colony algorithm | |
| CN115169136A (en) | Rapid UK-GMPHD multi-target tracking method in three-dimensional space | |
| CN107976652A (en) | A kind of Intelligent radar sea target detection system and method based on shuffled frog leaping algorithm | |
| CN107918117A (en) | A kind of Intelligent radar sea target detection system and method for the algorithm that leapfroged based on ADAPTIVE MIXED |
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: 20180202 |