Multiple snapshot and multiple frequency compressive matched field processing

• Published in: The Journal of the Acoustical Society of America Vol. 139; no. 4; p. 2082
• Main Authors: Gemba, Kay L., Hodgkiss, William S., Gerstoft, Peter
• Format: Journal Article
• Language: English
• Published: 01.04.2016
• ISSN: 0001-4966; 1520-8524
• DOI: 10.1121/1.4950179

Matched field processing is a generalized beamforming method which matches received array data to a dictionary of replica vectors to locate and track a source. Its solution set generally is sparse since there are considerably fewer sources than replicas. The problem is also underdetermined since the number of sensors are less than the number of unique depth-range cells. Using compressive sensing (CS), the traditional spatial matched-filter problem is reformulated as a convex optimization problem subject to a row-sparsity constraint (RSC). The RSC selects the best match among the replica dictionary when using multiple snapshots. It is found that CS performance is equivalent to the Bartlett processor when comparing the sparse solution to the ambiguity surface’s peak for any number of snapshots in a single frequency—single source scenario. Results also indicate that CS performs similarly to the adaptive white noise constraint processor in a multiple source scenario. The RSC can further be exploited to select a common depth-range cell from snapshots corresponding to multiple frequencies to improve the source tracking in the presence of data-replica mismatch. Results are demonstrated using both simulated and SWellEx-96 experiment data.