L1Norm Genetic
L1Norm Genetic
a r t i c l e in fo abstract
Article history: In this paper, we consider the fundamental problem of frequency estimation of multiple sinusoidal
Received 30 December 2008 signals with stationary errors. We propose genetic algorithm and outlier-insensitive criterion function
Accepted 16 July 2009 based technique for the frequency estimation problem. In the simulation studies and real life data
analysis, it is observed that the proposed genetic algorithm based robust frequency estimators are able
Keywords: to resolve frequencies of the sinusoidal model with high degree of accuracy. Among the proposed
Genetic algorithms methods, the genetic algorithm based least squares estimator, in the no-outlier scenario, provides
L1-norm estimator efficient estimates, in the sense that their mean square errors attain the corresponding Crame r-Rao
Least median estimator lower bounds. In the presence of outliers, the proposed robust methods perform quite well and seem to
Least square estimator
have a fairly high breakdown point with respect to level of outlier contamination. The proposed
Least trimmed estimator
methods significantly do not depend on the initial guess values required for other iterative frequency
Multiple sinusoidal model
Outlier-insensitive criterion estimation methods.
& 2009 Elsevier Ltd. All rights reserved.
1. Introduction Furthermore, fri gPi¼ 1 are such that the sequence {e(t)} is
stationary. The particular case of ri = 0 for all i, corresponds to
Estimating the parameters of multiple sinusoidal signals the i.i.d. noise case. M, the number of sinusoidal components is
model embedded in additive noise is a fundamental problem in assumed to be known. Given a sample of size N, {y(1), y, y(N)},
signal processing and in time series analysis. In several applica- the problem is to estimate the unknown frequencies and the
tions in signal processing (Kay, 1988; Stoica, 1993; Quinn and corresponding amplitudes.
Hannan, 2001; Stoica and Moses, 2005) and time series analysis The sinusoidal model (1), is used to describe and model many
(Brillinger, 1987), the signals dealt with can be described by the real life applications where periodic phenomena is present. The
following multiple sinusoidal model: extraction of frequencies of the sinusoidal signals model from
time series data is a classical problem of ongoing interest in the
X
M
yðtÞ ¼ ðAk cosðok tÞ þ Bk sinðok tÞÞ þ eðtÞ: ð1Þ literature of statistical signal processing (Mackisack et al., 1994;
k¼1 Kundu and Mitra, 1996; Kundu, 1997; Mitra and Kundu, 1997;
Here y(t)s are observed at the equidistant time points, namely, Smyth and Hawkins, 2000; Nandi et al., 2002; Chan and So, 2004;
Trapero et al., 2007; Bonaventura et al., 2007; Coluccio et al.,
t =1,2, y, N. The unknown parameters of the model are the
frequencies (o1, y, oM) and the corresponding amplitudes (A1, 2008) and indeed has created interests among scientists, from
various diverse fields. There exists a vast amount of literature
y, AM) and (B1, y, BM). Aks and Bks are arbitrary real numbers and
oks are distinct real numbers lying between (0, p). The real valued addressing the computational aspect of the frequencies of the
sinusoidal model as well as focusing on theoretical behavior of the
additive white noise sequence {e(t)} is assumed to be stationary
with finite variance s2 and it has the following form: estimators. The most intuitive and natural approach is the least
squares approach. A closely related approach is the approximate
X
P
least squares estimators (ALSEs) approach, which is asymptoti-
eðtÞ ¼ ri eðt iÞ þ dðtÞ; ð2Þ
cally equivalent to the least squares estimators (LSEs). Asymptotic
i¼1
properties of the ALSE and LSE are studied in detail in Walker
{d(t)} being a sequence of independent and identically distributed (1971), Hannan (1971), Kundu (1993, 1997) and Kundu and Mitra
(i.i.d.) normal random variable with mean 0 and variance s2. (1996). It is well known that, although the LSEs are the most
desired estimators from theoretical point of point of view,
Corresponding author. Tel.: + 91 512 2596064; fax: +91 512 2597500. obtaining the LSEs is numerically a very difficult problem (Kahn
E-mail address: [email protected] (A. Mitra). et al., 1993). It is observed that the least squares surface has local
0952-1976/$ - see front matter & 2009 Elsevier Ltd. All rights reserved.
doi:10.1016/j.engappai.2009.07.001
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
2 A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]]
minima spaced O(N 1) apart, making the gradient based search we can write cð o ; A ; B Þ as
methods of general non-linear optimization ineffective without
cð o ; A ; B Þ ¼ ð Y Að o Þ a ÞT ð Y Að o Þ a Þ: ð7Þ
excellent starting values. Several methods are available in the
literature to obtain the LSEs efficiently, but unfortunately all the With distinct frequencies, if NZ2M the Vandermonde matrix
methods are quite sensitive to the initial value chosen. It is further Að o Þ is of rank 2M and ðAð o ÞT Að o ÞÞ1 exists. We thus observe that
observed in Rice and Rosenblatt (1988), that unless the frequen- the vectors o and a which minimize (3) are given by
cies are resolved at the first step with order O(N 1), the failure
to converge to global minima may give a very poor estimate of o^ ¼ arg max½ Y T Að o ÞðAð o ÞT Að o ÞÞ1 Að o ÞT Y ; ð8Þ
LSE o
the amplitudes. Thus, fitting these multiple sinusoidal models
dataset. It is well known that the least square estimators for this
In this paper, we develop genetic algorithm based frequency problem are optimal under various considerations on the noise
estimation methods optimizing outlier-insensitive criterion func- sequence. It is observed that, under the i.i.d. assumption on the
tions. The aim here is to find an algorithm, under the assumption noise sequence, the estimators are strongly consistent (Kundu and
of stationary additive noise random variable, whose performance Mitra, 1996), asymptotically normal with a covariance matrix that
significantly does not depend on initial guess values (or intervals), coincides with the Crame r-Rao bound under the normality
and also have a high breakdown point with respect to outliers assumption. It is further observed that the LSEs under the
present in the data. Recently, Smyth and Hawkins (2000) dependent error structure are also strongly consistent and
proposed an algorithm based on elemental sets for robust asymptotic normal (Kundu, 1993).
frequency estimation, under the assumption of independently As an alternate to the above LSE formulation of the problem,
and identically distributed (i.i.d.) normal random variables. we can use L1-norm formulation, which is often used in the
Contrary to the remarks made in Smyth and Hawkins (2000) that literature of robust regression. The L1-norm estimates of the
the genetic algorithms does not seem to be a suitable approach for parameters of the multiple sinusoidal model (1) are obtained by
this problem (under i.i.d. setup), especially with the presence of minimizing
outlier, we observe that the proposed genetic algorithm based
X N X
M
methods perform quite satisfactorily even in the dependent noise
fðo; A; BÞ ¼ yðtÞ ðAk cosðok tÞ þ Bk sinðok tÞÞ: ð10Þ
structure.
t¼1 k¼1
The rest of the paper is organized as follows. In Section 2, we
The non-linear optimization problem (10) is solved using
give the least squares and the L1-norm formulation of the
standard non-linear optimization routines in order to get the L1-
frequency estimation problem. In Section 3, we will give a brief
norm estimates. The L1-norm estimators, also called the least
review of the outlier-insensitive criterion functions. Section 4
absolute deviation (LAD) estimators, correspond to the maximum
presents the proposed genetic search based iterative algorithms
likelihood estimators under the assumption that noise are i.i.d.
for robust frequency estimation. The empirical studies, imple-
with double exponential distribution. In recent literatures of
menting the proposed algorithms, will be presented in Sections 5.
signal processing, use of modified simplex algorithm is proposed
Finally, the conclusions will be discussed in Section 6.
for obtaining the L1-norm estimates. The estimates are then
computed using the Barrodale–Roberts modified simplex algo-
2. Least squares and L1-norm estimators rithm (Barrodale and Roberts, 1973, 1974). For a more detailed
review of L1-norm techniques, readers are referred to Bloomfield
The least squares estimators of the parameters for the model and Steiger (1983).
(1) are the minimizers of the criterion function:
" #2
X
N X
M 3. Outlier-insensitive criterion functions
cð o ; A ; B Þ ¼ yðtÞ ðAk cosðok tÞ þ Bk sinðok tÞÞ ; ð3Þ
t¼1 k¼1
The conventional estimates that are found by the least squares
where o ¼ ðo1 ; . . . ; oM ÞT is the vector of frequencies and criterion, i.e. minimizing the sum of squares of all the N residuals,
A ¼ ðA1 ; . . . ; AM ÞT and B ¼ ðB1 ; . . . ; BM ÞT are the amplitude vectors. are motivated by the ideas of statistical efficiency. However, the
Here ‘T’, denotes transpose of a vector or of a matrix. The estimates are inappropriate if some of the observations are
sinusoidal model parameters estimated through minimization of contaminated. The L1-norm estimates are potentially better
(3) has the smallest least squares distance to the observed data. o , options in situations where the dataset contains outliers. Deviat-
A and B obtained by minimizing (3) are called the non-linear ing from the use of usual sum of square errors or sum of absolute
least squares (NLS) estimators. When the noise e(t) is white errors criterion functions, literature of robust regression provides
Gaussian, the NLS estimators are same as the maximum like- us with alternate criterion functions that are relatively insensitive
lihood estimators. to the presence of outliers in the data. The primary aim of these
For the sinusoidal model (1), the criterion function (3) can outlier-insensitive criteria is to protect the estimate from such
conveniently be concentrated with respect to the conditionally outlier contamination.
linear parameters A and B. Introducing the notations: Among the most widely used specialized outlier-sensitive
Y ¼ ½yð1Þ; yð2Þ; . . . ; yðNÞT ; ð4Þ criterion functions, are the least trimmed (LT) sum and the least
median (LM) criteria. We now formulate the criteria to be used in
2 3 the robust frequency estimation methods proposed in this paper.
cosðo1 Þ sinðo1 Þ cosðoM Þ sinðoM Þ
6 ^ ^ ^ 7
Að o Þ ¼ 4 5; ð5Þ
3.1. Least trimmed criterion
cosðo1 NÞ sinðo1 NÞ cosðoM NÞ sinðoM NÞ
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]] 3
for the model (1) are given by successive generations. The parameter space, Ofreq for the
X
M 2 frequency vector, o ¼ ðo1 ; . . . ; oM ÞT , for the sinusoidal model
eðtÞ2A ; B ; o ¼ yðtÞ ðAk cosðok tÞ þBk sinðok tÞÞ ; t ¼ 1; 2; . . . ; N: (1) is given by
k¼1
ð11Þ Ofreq ¼ ð0; 1Þ ð0; 1Þ ð0; 1Þ RM : ð15Þ
The least trimmed (sum of) squares (LTS) estimator, proposed We first obtain the binary chromosomal representation of the
in Rousseeuw (1984), is found by finding the parameters that parameter space. We form, for any possible solution belonging to
satisfy the original parameter space Ofreq, a binary string of length M p.
Where, p denotes the length of the binary bit representation of
X
h
any component of the parameter vector o, i.e. for each of the
Min e2ðtÞ : ð12Þ
o; A ; B
t¼1 unknown frequencies, we obtain a p-bit coded binary representa-
tion. It is however well known that ordinary binary coding can
It is well known (Rousseeuw, 1984) that the best robustness
result in search process being deceived, i.e. unable to efficiently
property is obtained when h =N/2, approximately. In this case a
locate the global minima, due to large hamming distances in the
breakdown point of 50% is attained. Higher efficiency of the
representational mapping between adjacent values (Hollstien,
estimates is obtained with lower trimming proportions. We
1971). A hamming distance, between two binary strings is defined
consider in the present paper, a 50% trimming.
as minimum number of bits that must be changed in order to
Alternatively, under L1-norm estimation setup, we can simi-
convert one bit string into another. In order to avoid the above-
larly define a least trimmed (sum of) absolute (LTA) deviation
mentioned problem, a Gray coding approach of the original binary
estimator. The LTA deviation estimator is found by finding the
strings is adopted. The literature of GA and its applications report
parameters that satisfy
that Gray coding exhibits accelerated convergence rate of the
X
h
objective function, and provides better accuracy than the binary
Min jeðtÞ j; ð13Þ
o;A;B coded GA (Caruana and Schaffer, 1988; Yokose et al., 2000).
t¼1
Superior performance of a Gray coded GA is mainly attributed to
where je(1)joje(2)jo, y, oje(N)j be N ordered absolute residuals, the fact that Gray codes do not bias the searching direction, as in
the unordered je(t)js for model (1) are given by the case of ordinary binary coding, having a large hamming
X
M distance between adjacent values. A Gray code represents each
jeðtÞj ¼ yðtÞ ðAk cosðok tÞ þ Bk sinðok tÞÞ; t ¼ 1; 2; . . . ; N: ð14Þ number in the sequence of integers {0,1, y, 2K 1} as a binary
k¼1 string of length K in an order such that adjacent integers have
Once again we consider a 50% trimming for the LTA based Gray code representations that differ in only one bit position. Use
estimators in the present paper. of Gray code thus allows, going through the integer sequence
requiring flipping just one bit at a time. This is called the
3.2. Least median criterion adjacency property of Gray codes. Gray code takes a binary
sequence and shuffles it to form some new sequence with the
The least median squares (LMS) estimator is obtained by adjacency property. We use here a Gray coding derived from the
finding the model parameters that minimizes the hth-ordered initial binary coding.
squared residual, i.e. e(h)2, where h is usually taken as h= [N/ To initialize the genetic search, we populate an initial
2]+ [(p +1)/2], p denotes the number of parameters in the model. population of a pre-determined size. Each member of this initial
This estimator was introduced in Rousseeuw (1984) (see also population is a randomly chosen parameter vector o 0 A Ofreq ;
Rousseeuw, 1988; Rousseeuw and Leroy, 1987). coded to get the chromosomal string representation of bit length
Similar to the LMS estimator, we can define the least median M p. The ranking based fitness of each of the members of this
absolute (LMA) estimator as the estimator that is obtained by initial population is evaluated according to the criterion (8). For a
finding the parameters that minimize the hth-ordered absolute detailed discussion on various selection procedures, see for
residual, i.e. je(h)j, with appropriate choice of h. example Goldberg (1989). Using a stochastic sampling with
replacement approach, we next populate fit parents pool, size of
the pool depending on the generation gap. From the selected
4. Proposed robust frequency estimation methods parent pool, we select pairs in order and apply a two-point
crossover (with a pre-assigned crossover probability), exchanging
In this section, we present the proposed genetic algorithm genetic material of parents to obtain new chromosomes. Cross-
based frequency estimation techniques for the multiple sinusoidal over produces new individuals that have some parts of both the
model. parent’s genetic material. An example of a multipoint crossover is
We propose six different estimators based on genetic algo- illustrated in Fig. 1.
rithm and different criterion functions. These estimators are: (i) Mutation is applied on the mated chromosome strings with a
genetic algorithm based least square estimator (GA-LS), (ii) low pre-assigned mutation probability. Mutation is considered to
genetic algorithm based least trimmed square estimator (GA- be the genetic operator that ensures that the probability of
LTS), (iii) genetic algorithm based least median square estimator searching any given string will never be zero and thus has the
(GA-LMS), (iv) genetic algorithm based L1-norm estimator (GA- effect of tending to inhibit the possibility of convergence of the GA
L1), (v) genetic algorithm based least trimmed absolute deviation to a local optimum. Mutation changes the genetic representation
estimator (GA-LTA), (vi) genetic algorithm based least median of the chromosomes according to a probabilistic rule. In the binary
absolute deviation estimator (GA-LMA). string representation, mutation will cause a single bit to change
We first present the algorithm for the GA-LS estimator. In the its state, i.e. 0 ) 1 or 1 ) 0.
genetic search formulation of the GA-LS estimator of the An elitist strategy is used to fill the generation gap. An elitist
parameters of the model (1), we take the objective function (8) strategy (De Jong, 1975; Thierens, 1997) is adopted while
as the fitness function in the genetic search setup and aim to find populating a new generation. Elitism encourages the inclusion of
the optimum member through repeated applications of the three highly fit chromosome strings, from earlier generations, in the
genetic operators of selection, crossover and mutation, over the subsequent generations. The fractional difference between the
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
4 A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]]
number of chromosomes in the old population and the number of Step 7: Use elitist strategy to fill the generation gap.
new chromosomes produced by selection and recombination is Step 8: Repeat the steps 2–7 till maximum number of
termed as the generation gap. Under the elitist approach, a generations is reached or no better solution is found after the
fraction (based on the value of the pre-determined generation pre-determined maximum number of generations is reached.
gap) of the most-fit individuals is deterministically allowed to Step 9: o^ is the most-fit decoded string found among all
GA-LSE
propagate through successive generations.
the generations.
Since GA is a stochastic optimization algorithm, the appli-
Step 10: Calculate the estimates of the conditionally linear
cation of conventional termination criteria becomes problematic
parameters a through (9).
in GA based optimization procedure. We follow here the most
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]] 5
where jeð1Þ j ojeð2Þ j o o jeð½N=2Þ j are [N/2] smallest absolute Number of chromosomes in one population 200
Bits of precision 80
deviations, the unordered je(t)js for model (1) are given by (14).
Coding Gray coding
Finally, for the GA-LMA estimator, the objective function for the Scaling Linear
GA procedure is given by Range of parameters for initial population oA[0, p]
Crossover probability 0.70
Min jeð½N=2 þ ½ðp þ 1Þ=2Þ j: ð21Þ Crossover method 2-point
o; A ; B
Mutation probability 0.01
Elitism Top 10%
Maximum number of generation 200
5. Simulation studies and real life data analysis
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
6 A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]]
Table 3
Simulation results for the two cosine signals model (23).
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]] 7
Table 4
Simulation results for one sinusoid dependent error model (24).
Table 5
Simulation results for the lower of the two sinusoids for model (26).
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
8 A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]]
Table 6
Simulation results for the higher of the two sinusoids for model (26).
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]] 9
recorded separately for the blue and red bands. Observation times
were irregularly spaced depending on the conditions of sky and
the observation schedule. We consider here the analysis of blue
band measurements. A number of observations were considered
to be unreliable due to observation conditions. The data have been
downloaded from http://www.statsci.org/data/oz/ceph2.html.
We fit a two-component sinusoid model of the form
yðtÞ ¼ K þA1 cosðo1 tÞ þ B1 sinðo1 tÞ þA2 cosðo2 tÞ þ B2 sinðo2 tÞ
K [Median(y(1)yy(n)) 0.5,
Median(y(1)yy(n))+ 0.5]
A1, A2 [ 0.5, 0.5]
B1, B2 [ 0.5, 0.5]
Fig. 7. Circadian data fitting using GA-LMA. o1,o2 [0, p]
The plot of the fitted and the observed data with outliers is The final fitted model is
given in Fig. 6. yðtÞ ¼ 0:01992 0:0128 cosð0:1247tÞ þ0:2032 sinð0:1247tÞ
It is obvious from the data plot that the dataset contains a large þ 0:4613 cosð0:2467tÞ 0:0532 sinð0:2467tÞ:
number of outliers, but the fitted curve successfully ignores them
and follows nicely the periodic pattern. The less obvious outliers, The plot of the observed data and the fitted model is given in
closer to the fitted curve, also do not distort the data fit. We get Fig. 8. We observe from the plot that the fit ignores the outliers
similar results using other proposed outlier-insensitive robust and is able to trace the correct sinusoidal pattern.
frequency estimation techniques. Fig. 7 gives fit of the data using Smyth and Hawkins (2000) considered the same dataset for
GA-LMA estimator. The fitted model under this approach is testing the usefulness of their robust frequency estimation
technique. For implementation of their method, which requires
yðtÞ ¼ 369:84 þ 19:01 cosð0:08711tÞ þ 12:51 sinð0:0:08711 tÞ: time points to be equidistant, the data was first interpolated
Similar fits are observed for other methods, except the GA-LS linearly onto an equally spaced grid of time points of the same
method, which fails completely. Considering the same dataset, it length, no such preprocessing of the data is required for
is reported in Smyth and Hawkins (2000) that the fitted frequency implementation of our methods. The estimated frequencies
for the first 8 days to be 0.87273, which is very close to our reported in Smyth and Hawkins (2000) are 0.126 and 0.253,
frequency estimates. which once again are close to our frequency estimates.
The GA-LTA estimates of the frequencies 0.1247 and 0.2461
5.3.2. Fitting Variable Star data correspond to periods of 50 and 25 days. The star is therefore
The variable star dataset is another important and very determined to be periodic with period of about 50 days.
frequently used data. The determination of the periodicities of a
variable star and the shape of its light curve is important in
studies of stellar structure and evolution. The relationship 6. Conclusion
between the period and magnitude is used to determine distances
on a cosmic scale, for example. The data in this example gives In this paper, we propose genetic algorithm based robust
observations on the magnitude of a variable star, made from the frequency estimation techniques for multiple sinusoidal models
Mount Stromlo Observatory near Canberra in Australia over a with correlated error structures. The proposed methods use
period of about 250 days (Reimenn, 1994). Magnitudes were genetic search technique for optimizing various outlier-insensitive
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001
ARTICLE IN PRESS
10 A. Mitra, D. Kundu / Engineering Applications of Artificial Intelligence ] (]]]]) ]]]–]]]
criterion functions. The methods do not require the data points to De Jong, K.A., 1975. An analysis of the behavior of a class of genetic adaptive
be equidistant or the noise sequence to be independent Gaussian systems. Ph.D. Thesis, University of Michigan.
Goldberg, D.E., 1989. In: Genetic Algorithms in Search, Optimization and Machine
structure, which is otherwise required in other robust frequency Learning. Pearson Education Inc..
estimation techniques for this model (see for example Smyth and Hannan, E.J., 1971. Non-linear time series regression. Journal of Applied Probability
Hawkins, 2000). Furthermore, the GA based robust frequency 8, 767–780.
Hollstien, R.B., 1971. Artificial genetic adaptation in computer control systems.
estimation techniques search a population of possible optimal Doctoral Dissertation, University of Michigan, Dissertation Abstracts Interna-
solutions in parallel and do not require derivative information or tional, 32(3), 1510B, University Microfilms No. 71-23,773.
other auxiliary information, only the levels of fitness influence the Kahn, M., Osborne, M.R., Smyth, G.K., 1993. On the consistency of Prony’s method
and related algorithms. Journal of Computational and Graphical Statistics 1,
direction of search. Another advantage of using the proposed
329–349.
methods is that since they are based on genetic algorithms they Kay, S.M., 1988. Modern Spectral Estimation: Theory and Applications. Prentice-
use probabilistic transition rules and have potentially high chance Hall, New York.
Kundu, D., 1993. Asymptotic theory of least-squares estimators of a particular non-
of converging to the optimal solution.
linear regression model. Statistics & Probability Letters 18, 13–17.
In the simulation studies and real life data analysis, it is Kundu, D., 1997. Asymptotic theory of least-squares estimators of sinusoidal
observed that the proposed genetic algorithm based robust signals. Statistics 30 (3), 221–238.
frequency estimators, optimizing outlier-insensitive criteria are Kundu, D., Mitra, A., 1996. Asymptotic theory of the least-squares estimators of a
nonlinear time series regression model. Communications in Statistics, Theory
able to resolve frequencies of the sinusoidal model with high Methods 25, 133–141.
degree of accuracy and provides reasonably high breakdown point Mackisack, M.S., Osborne, M.R., Smyth, G.K., 1994. A modified Prony algorithm for
robust estimates. estimating sinusoidal frequencies. Journal of Statistical Computation and
Simulation 49, 111–124.
Mitra, A., Kundu, D., 1997. Consistent method of estimating sinusoidal frequencies:
a non-iterative approach. Journal of Statistical Computation and Simulation 58,
Acknowledgement 171–194.
Nandi, S., Iyer, S., Kundu, D., 2002. Estimating the frequencies in presence of heavy
tail errors. Statistics and Probability Letters 58 (3), 265–282.
The work is supported by Department of Science & Technology, Quinn, B.G., Hannan, E.J., 2001. In: The Estimation and Tracking of Frequency.
Government of India, Grant no. SR/S4/MS:374/06. Cambridge University Press, Cambridge.
Reimenn, J.D., 1994. Frequency estimation using unequally-spaced astronomical
data. Ph.D. Thesis, University of California, Berkeley.
References Rice, J.A., Rosenblatt, M., 1988. On frequency estimation. Biometrika 75, 477–484.
Rousseeuw, P.J., 1984. Least-median of squares regression. Journal of American
Andrews, D.F., Herzberg, A.M., 1985. In: Data: A Collection of Problems from Many Statistical Association 79, 871–880.
Fields for the Student and Research Worker. Springer, New York. Rousseeuw, P.J., 1988. Robust estimation and identifying outliers. In: Wadsworth,
Barrodale, I., Roberts, F.D.K., 1973. An improved algorithm for discrete L1 linear H.M. (Ed.), Handbook of Statistical Methods for Engineers and Scientists.
approximations. SIAM Journal of Numerical Analysis 10, 839–848. McGraw-Hill, New York (Chapter 17).
Barrodale, I., Roberts, F.D.K., 1974. Solution of an overdetermined system of Rousseeuw, P.J., Leroy, A.M., 1987. In: Robust Regression and Outlier Detection.
equations in the L1 norm. Communications of the ACM 17, 319–320. Wiley, New York.
Bloomfield, P., Steiger, W.L., 1983. Least Absolute Deviations: Theory, Applications, Smyth, G.K., Hawkins, D.M., 2000. Robust frequency estimation using elemental
and Algorithms. Birkhauser, Boston, Mass. sets. Journal of Computational and Graphical Statistics 9, 196–214.
Bonaventura, A., Coluccio, L., Fedele, G., 2007. Frequency estimation of multi- Stoica, P., 1993. List of references on spectral line analysis. Signal Processing 31 (3),
sinusoidal signal by multiple integrals. In: IEEE International Symposium on 329–340.
Signal Processing and Information Technology, pp. 564–569. Stoica, P., Moses, R., 2005. Spectral Analysis of Signals. Prentice-Hall, Upper Saddle
Brillinger, D.R., 1987. Fitting cosines: some procedures and some physical River, NJ.
examples. In: MacNeill, B., Umphrey, G.J. (Eds.), Applied Probability and Thierens, D., 1997. Selection schemes, elitist recombination, and selection intensity.
Stochastic Process and Sampling Theory. D. Reidel Publishing Company, USA, In: Back, T. (Ed.), Proceedings of the Seventh International Conference on
pp. 75–100. Genetic Algorithms. San Francisco, USA, pp. 152–159.
Caruana, R.A., Schaffer, J.D., 1988. Representation and hidden bias: Gray vs. binary Trapero, J.R., Sira-Ramirez, H., Batlle, V.F., 2007. An algebraic frequency estimator
coding. In: Proceedings of the Sixth International Conference Machine for a biased and noisy sinusoidal signal. Signal Processing 87 (6), 1188–1201.
Learning, pp. 153–161. Walker, A.M., 1971. On the estimation of the Harmonic components in a time series
Chan, K.W., So, H.C., 2004. Accurate frequency estimation for real harmonic with Stationary residuals. Biometrika 58, 21–26.
sinusoids. IEEE Signal Processing Letters 11 (7), 609–612. Yokose, Y., Cingoski, V., Kaneda, K., Yamashita, H., 2000. Performance comparison
Coluccio, L., Eisinberg, A., Fedele, G., 2008. A property of the elementary symmetric between gray coded and binary coded genetic algorithms for inverse shape
functions on the frequencies of sinusoidal signals. Issue Series Title: Signal optimization of magnetic devices. Applied Electromagnetics (pp. 115–120),
Processing, doi:10.1016/j.sigpro.2008.10.021. 115–120.
Please cite this article as: Mitra, A., Kundu, D., Genetic algorithms based robust frequency estimation of sinusoidal signals with
stationary errors. Engineering Applications of Artificial Intelligence (2009), doi:10.1016/j.engappai.2009.07.001