An imaging algorithm for high-resolution imaging sonar system
Multireceiver synthetic aperture sonar (SAS) can produce high-resolution images by coherently superposing successive echoed signal. However, multireceiver SAS imaging is a difficult issue since the system can be divided into many bistatic SASs. Traditional imaging algorithms cannot be directly used...
Saved in:
Published in | Multimedia tools and applications Vol. 83; no. 11; pp. 31957 - 31973 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.03.2024
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Multireceiver synthetic aperture sonar (SAS) can produce high-resolution images by coherently superposing successive echoed signal. However, multireceiver SAS imaging is a difficult issue since the system can be divided into many bistatic SASs. Traditional imaging algorithms cannot be directly used to process the multireceiver SAS echoed signal, as they are just applied to monostatic sonar system. In order to solve this issue, this paper proposes an imaging algorithm based on Loffeld’s bistatic formula (LBF) for multireceiver SAS system. With the LBF method, the point target reference spectrum (PTRS) of multireceiver SAS system can be split into quasi-monostatic term and the bistatic deformation term. The quasi-monostatic term is similar to the spectrum of monostatic SAS while the bistatic deformation term is caused by the displacement of transmitter and receiver. In this paper, the data of multireceiver SAS is firstly coerced into monostatic one by compensating the bistatic deformation term. After this step, the chirp scaling (CS) algorithm based on monostatic SAS can be directly applied. At last, simulations are exploited to demonstrate the presented method. Compared to traditional multireceiver SAS CS algorithms, the presented method significantly improves the imaging performance. Both ghosts target and higher sidelobes that traditional multireceiver SAS CS algorithms suffer from can be successfully suppressed. Furthermore, the presented method can obtain high-resolution results which are nearly identical to the benchmark of BP algorithm. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1573-7721 1380-7501 1573-7721 |
DOI: | 10.1007/s11042-023-16757-0 |