Abstract

Matched-field source localization methods can be sensitive to environmental parameter mismatch. A statistically optimal approach to source localization in the presence of environmental uncertainty is the maximum a posteriori probability (MAP) estimator. Unfortunately, practical implementation of the MAP estimator results in a computationally intensive processor. In this paper, a localization technique is presented that is a computationally efficient approximation to the MAP estimator. A two-step search procedure is used to estimate source position. The first step utilizes an approximation to the MAP estimator which allows much of the computation to be computed efficiently off-line. This step also includes a computationally efficient range-depth smoothing which provides robustness to grid density. In step two, ambiguities arising from step one are resolved using a fine-grid search procedure over the source location parameters. Simulations using the NRL Workshop benchmark environment, which has seven uncertain environmental parameters, show the performance of the technique to be comparable to that of the MAP estimator while requiring only a fraction of the computations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.