By Topic

A hybrid simplex genetic algorithm for estimating geoacoustic parameters using matched-field inversion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Musil, M. ; Sch. of Earth & Ocean Sci., Victoria Univ., BC, Canada ; Wilmut, M.J. ; Chapman, N.R.

Matched-fieId inversion (MFI) undertakes to estimate the geometric and geoacoustic parameters in an ocean acoustic scenario by matching acoustic field data recorded at hydrophone array with numerical calculations of the field. The model which provides the best fit to the data is the estimate of the actual experimental scenario. MFI provides a comparatively inexpensive method for estimating ocean bottom parameters over an extensive area. The basic components of the inversion process are a sound propagation model and matching (minimization) algorithm. Since a typical MFI problem requires a large number of computationally intensive sound propagation calculations, both of these components have to be efficient. In this study, a hybrid inversion algorithm which uses a parabolic equation propagation model and combines the downhill simplex algorithm with genetic algorithms is introduced. The algorithm is demonstrated on synthetic range-dependent shallow-water data generated using the parabolic equation propagation model. The performance for estimating the model parameters is compared for realistic signal-to-noise ratios in the synthetic data

Published in:

Oceanic Engineering, IEEE Journal of  (Volume:24 ,  Issue: 3 )