# Patent

## Title
Multitask learning method for broadband source-location mapping of acoustic sources

## Abstract

A method involves acoustic source localization by capitalizing on the sparse nature of a source location map (SLM). Sparsity arises naturally since one seeks the location of K sources in a grid of G tentative locations where G>>K. The source localization problem is cast as a regularized LS regression problem with a sparsity constraint whose solution yields the SLM. An iterative solver based on block coordinate descent (BCD) is used. BCD leads to scalar closed-form updates rendering the method's computational complexity per iteration linear with respect to the grid size. The disclosed method enables high resolution location estimation with fewer array measurements than classical matched field processing methods.

## Background
FEDERALLY-SPONSORED RESEARCH AND DEVELOPMENT
The Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources is assigned to the United States Government and is available for licensing for commercial purposes. Licensing and technical inquiries may be directed to the Office of Research and Technical Applications, Space and Naval Warfare Systems Center, Pacific, Code 72120, San Diego, Calif., 92152; voice (619) 553-5118; email ssc_pac_T2@navy.mil; reference Navy Case Number 102945.


BACKGROUND
Using passive sonar for localizing multiple acoustic sources in shallow water is a fundamental task for underwater surveillance and monitoring systems. These systems typically use an array of hydrophones to collect sound generated by underwater acoustic sources without radiating sound to the water. Moreover, their impact on the maritime environment is minimal when compared to the one of similar systems using active sonar. Localization using passive sonar is complicated by the complexities of underwater acoustic propagation, interactions among multiple acoustic sources, and the uncertain dynamics of the acoustic propagation environment. Shipping lanes, marine life, and other environmental factors introduce noise that masks acoustic signals of interest and leads to low signal-to-noise ratios (SNRs) at the hydrophone array.
Matched-field processing (MFP) has been the workhorse for underwater source localization via passive sonar. MFP postulates a grid of tentative source locations and uses an acoustic propagation model to predict the acoustic pressure fields, also known as replicas, at the hydrophone array caused by an acoustic source at each grid location. The replicas are then “matched” to the acoustic measurements to generate the so-called ambiguity surface summarizing acoustic power estimates across the grid. Next, the localization problem is reduced to a peak-picking one over the ambiguity surface.
Despite its popularity, MFP has been challenged by scenarios with multiple sources and environmental mismatch. In narrowband passive-sonar-based localization, it has been empirically observed that using high frequencies yields high source resolution at the expense of increased sensitivity to model mismatch, whereas using low-frequencies yields reduced sensitivity to model mismatch at the expense of reduced source resolution. A need exists for an underwater source localization algorithm with improved resolution and resilience to model mismatch.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 shows a block diagram of an embodiment of the operational concept of a system in accordance with the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources.
FIG. 2 shows a diagram of an embodiment of a data collection model used in accordance with the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources.
FIG. 3 shows a flowchart of an embodiment of a replica generation model in accordance with the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources.
FIG. 4 shows a diagram of an example of a broadband source localization map.
FIG. 5 shows a diagram of the structure of the regression coefficient matrix S.
FIG. 6 shows a diagram of regression coefficient updates flowed by the block coordinate descent where a row çg of the matrix S is updated one at a time while keeping all other rows fixed.
FIG. 7 shows a flowchart of an embodiment of a method in accordance with the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources.
FIG. 8 shows a diagram illustrating an embodiment of block coordination decent method for use in accordance with the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources.
FIG. 9 shows a diagram of propagation model used to characterize the propagation environment of SWellEX-3.
FIG. 10 shows a graph illustrating the probability of correct localization for a single acoustic source.
FIG. 11 shows a graph illustrating the probability of correct localization for two acoustic sources.
FIG. 12 shows a graph of the probability of correct localization for two sources, one at a fixed range and depth and the other moving along a straight line trajectory at a fixed depth.



DETAILED DESCRIPTION OF SOME EMBODIMENTS
In some embodiments, the subject matter disclosed herein involves underwater source localization by capitalizing on the sparse nature of a source location map (SLM). Sparsity arises naturally since one seeks the location of K sources in a grid of G tentative locations where G>>K. Traditionally, MFP has focused on the ambiguity surface describing acoustic power. However, due to constructive and destructive interactions of sound propagating in water, the ambiguity surface shows high power peaks, with amplitudes dependent on factors such as array aperture, frequency, and water depth, at locations other than the true source locations. Instead, in the method disclosed herein the robust source localization problem is cast as a regularized least-squares (LS) regression problem with a sparsity constraint whose solution yields the SLM. An iterative solver based on block coordinate descent (BCD) is used to solve the resulting regression problem. BCD leads to scalar closed-form updates rendering the algorithm's computational complexity per iteration linear with respect to the grid size. The disclosed method enables high resolution location estimation with fewer array measurements than classical MFP algorithms.
Instead of relying on acoustic power estimation as is done in MFP, the embodiments of the disclosed method formulate the broadband localization problem as a multi-task learning (MTL) problem. MTL seeks to simultaneously learn related tasks with the hope that information shared across them improves the generalization capabilities of the learning algorithm. The proposed method operates on the Fourier coefficients of the measured acoustic time-series data for a predefined set of frequencies. Per frequency, Fourier coefficients are modeled as a linear combination of replicas for a grid of tentative locations. Intuitively, only expansion coefficients corresponding to a true source location should partake in the regression, whereas all other expansion coefficients should be zero. Since the number of expansion coefficients (one per grid location) is larger than the number of sources, they are inherently sparse. Moreover, it is natural to require expansion coefficients for different frequencies to have a common support since the grid is common for all frequencies. These desiderata are naturally captured within the MTL framework by the group-Lasso regularizer.
Model mismatch further compounds the source localization problem by inducing ambiguities on the expansion coefficients and, thus, hinders source-location estimates. To alleviate this issue, each task is cast as a robust signal approximation problem, namely, a regularized stochastic LS one that explicitly accounts for model mismatch effects on the replicas. These tasks are coupled through group-Lasso penalties inducing a sparse and common support across regression coefficients.
BCD solvers are developed to enable efficient estimators for the expansion coefficients that can be used for constructing a broadband source location map (SLM). To reduce the computational complexity of the BCD solver, predictor screening rules that zero groups of regression coefficients prior to solving the optimization problems are used. These screening rules extend the Lasso ones to the group-Lasso family of l1/lq-regularizers with complex-valued optimization variables.
Broadband MFP approaches can be divided to time- and frequency-based ones. Time-based approaches rely on knowledge of the acoustic source signature. These methods entail high computational complexity in part due to the dense sampling that is required to avoid temporal aliasing in the model predicted temporal signatures. Frequency-based methods do not impose a sampling requirement and are, thus, preferred in situations where computational resources are scarce. Classical broadband MFP frequency based approaches for localization perform incoherent averages of log-ambiguity surfaces across frequencies to construct a broadband one. These approaches presume that constructive interference occurs around the main peaks of the ambiguity surface while destructive interference occurs elsewhere.
Although computationally simple, the latter approaches do not exploit the coherent phase information between measurements and replicas across frequencies. Second-order cross-correlations and fourth-order correlations between measurements and replicas have been used to generate a higher-order ambiguity surface that preserves the phase information. Drawbacks common to localization approaches relying on higher-order statistics are: (i) the need to know the phase of the acoustic source gains at the frequency ranges considered; and, (ii) the high number of measurements required for accurate estimation of higher-order moments.
Regarding notation used herein, upper (lower) bold face letters are used for matrices (column vectors); (•)′((•)†) denotes matrix and vector transpose (conjugate transpose); [•]n,m([•]n) the (n,m)-entry of a matrix (n-entry of a vector); diag(y) a diagonal matrix with y on its main diagonal; IN the N×N identity matrix; 1M(0M) an M×1 vector of ones (zeros); ∥y∥q:=(Σn=1N|yn|q)1/q, for q∈(1,∞), the lq-norm in N; ∥y∥∞:=maxn|yn| the l∞-norm in N; Re(•) the real-part operator; (x)+:=max{0,x} the positive-part operator; for x∈, |x| and arg(x) its magnitude and phase, respectively.
FIG. 1 shows a block diagram of an embodiment of the operational concept of a system 10 in accordance with the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources. System 10 includes K stationary acoustic sources 20, 30, and 40 in an environment such as shallow water propagation. Let rk∈d, d∈{2,3}, denote the unknown location of the k-th source. Each rk comprises the range, depth (with respect to the sea surface), and possibly azimuth for the k-th source.
An acoustic sensor array 50 detects acoustic signals 22, 32, and 42 from sources 20, 30, and 40, respectively. As an example, an acoustic sensor array 50 comprising an array of N hydrophones with known and arbitrary geometry, where N>0, is used to acquire T discrete time acoustic measurements {y(t)∈N}t=1T, where yn(t):=[y(t)]n corresponds to the acoustic measurements gathered by the n-th hydrophone at time t. With hn(t;rk) denoting the discrete-time impulse response of the channel between rk and the n-th hydrophone, yn(t) is given by the equation

yn(t)=Σk=1K[hn(t,rk)*sk(t)]+εn(t), n=1, . . . , N  (Eq. 1)

where * denotes the convolution operator, sk(t) the acoustic signature for the k-th source, and εEn(t) is a zero-mean random variable representing the measurement noise at the n-th hydrophone.

Given {y(t)}t=1T and K, the goal is to estimate the source locations {rk}k=1K. In some embodiments, the estimation of source locations is performed by a processor 52 embedded within acoustic sensor array 50, with the results being transmitted, via signal 54, to receiver 60. In some embodiments, acoustic sensor array sends, via signal 54, the signal measurements to receiver 60, which performs the required processing. Estimation of source locations is, however, a difficult task since: (i) the NK impulse responses hn(t;rk) are not exactly known; (ii) in general, the functional dependency of hn on rk is highly nonlinear and not available in closed form; and, (iii) the acoustic signatures sk(t) are unknown. The challenge in (i) can be partially alleviated by capitalizing on an appropriate underwater propagation model to describe the propagation environment at the frequency range of interest.
Although it is possible to work directly with {y(t)}t=1T, the computational complexity required to accurately reconstruct all {hn(t;rk)} can be excessive. Instead, a frequency-based broadband source-localization approach is used that does not require reconstruction of the {hn(t;rk)}. To this end, {y(t)}t=1T are partitioned to M (possibly overlapping) blocks. Per ωf, let ym,f∈N and sk,f∈ denote the discrete-time Fourier transform (DFT) coefficient vectors for the m-th measurement block and the acoustic gain DFT coefficient, respectively. Then, {ym,f}m=1M are modeled as

ym,f=Σk=1Ksk,f(pk,f+uk,f)+εm,f, m=1, . . . , M  (Eq. 2)

where εm,f denotes the Fourier coefficients at ωf corresponding to the noise in the m-th block; pk,f∈N the ωf model predicted Fourier coefficients at the array for a source located at rk normalized so that ∥pk,f∥2=1, ∀k, henceforth referred to as replicas; and uk,f∈N an unknown perturbation vector effecting pk,f accounting for the effect of mismatch between the adopted acoustic propagation model and the true propagation environment.

Let Yf:=[y1,f, . . . yM,f] comprise all M Fourier coefficient vectors at ωf. Given an underwater propagation model, Fourier coefficients {Yf}f=1F, and K, broadband underwater source localization seeks {rk}k=1K while being robust to the perturbations {{uk,f}k=1K}f=1F on the replicas. Even if the adopted underwater propagation model were to exactly characterize the propagation environment, i.e., if all {uk,f} were known, and all the sk,f were also known, solving for the {rk}k=1K entails solving a difficult nonlinear regression problem. In fact, a closed-form expression relating rk to pk,f is unavailable since in most cases of interest finding pk,f entails solving the wave equation for specific boundary conditions given by the environment model.
As shown in diagram 100 of FIG. 2, acoustic sources 110 generate acoustic signals 120 that propagate through the propagation environment towards the array. Acoustic signals are captured by the acoustic sensor array 140 as a time series 130 of acoustic pressures. The times series data captured by each hydrophone in the array 140 is transformed to the Fourier domain via a DFT processing step 150 yielding DFT coefficient. The Fourier coefficients obtained across hydrophones for a set of F frequencies {ω1, . . . , ωF} are grouped to construct Fourier coefficient vectors ym,f∈N at the end of processing step 160. Referring to FIG. 3, diagram 200 shows an embodiment of a model-based prediction component, where a signal 212 radiated from a postulated source location 210 is input into a model-based predictor 220. Based upon an acoustic model characterizing the true propagation environment, predictor 220 yields replica vectors 222, i.e., model-based predicted Fourier coefficients, which are used to model the ym,f's and determine the source localizations.
In order to circumvent the computational challenges posed by the non-linear relationship between rk and the {pk,f}f=1F, a grid {rg∈d}g=1G with G>>max{N,K} tentative locations rg spanning the region of interest is introduced. Let pg,f denote the replica vector at frequency ωf for a source located at rg. For given ωf, Pf:=[p1,f, . . . , pG,f]∈N×G comprises all normalized replicas corresponding to the G locations where ∥pg,f∥2=1, ∀g. Each ym,f is now modeled as

ym,f=Σg=1Gsg,f(g,f+vg,f)+εm,f, ∀m,f  (Eq. 3)

where sg,f denotes the acoustic gain at ωf for a source located at rg, pg,f∈N is the replica for ωf corresponding to a source located at rg normalized so that ∥pg,f∥2=1, vg,f∈N is an unknown perturbation vector effecting pg,f, and εm,f denotes the Fourier coefficients at ωf corresponding to the noise in the m-th block. Not only does the set {vg,f} captures the mismatch between the adopted propagation model and the true propagation environment, but also it captures mismatch induced on the replicas due to misalignment between {rk}k=1K and the r∈. Note that sg,f subsumes both the source acoustic gain and the path loss incurred by an acoustic signal transmitted from rg at ωf.

Since there are only K<<G acoustic sources present, most of the {sg,f} in (Eq. 3) are expected to be zero. Only those sg,f that correspond to the location of the sources are expected to take nonzero values. In terms of notation, let sf:=[s1,f, . . . , sG,f]′∈G denote the complex-valued vector of regression coefficients at ωf, S:=[s1, . . . , sF]∈G×F denote a complex-valued matrix comprising all regression coefficients, and Vf:=[v1,f, . . . , vG,f]∈N×G denote a complex-valued matrix comprising all perturbation vectors for ωf. Using (Eq. 3), a broadband SLM may be obtained through the solution of the following problem for robust underwater source-location mapping: Given {(Yf,Pf)}f=1F and K, find K nonzero regression coefficients per column of S that minimize Σf=1F∥Yf−(Pf+Vf)sf1M′∥22 while being robust to {Vf}f=1F.
FIG. 4 shows a diagram 300 of the structure of the regression coefficient matrix S 310. Once an estimate for S has been obtained, its columns can be used to construct SLMs over  per ωf. Furthermore, a broadband SLM can be constructed using whole rows of S for each rg∈. For instance, after defining çg:=[sg,1, . . . , sg,F]′∈F as the vector corresponding to the g-th row of S 320, an SLM can be constructed by plotting the pairs (rg,∥çg∥q) for all rg∈ and q>1. The source localization estimates {{circumflex over (r)}k}k∈ indexed by the index-set ⊂{1, . . . , G} correspond to the location of the K-largest entries in the map and are given by




  
    
      
                ∈
        
          
            argmax
            
              
                
                                
              
              =
              K
            
          
          ⁢
          
            
              ∑
              
                k
                ∈
                              
            
            ⁢
            
              
                
                
                  ϛ
                  k
                
                
              
              q
            
          
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          4
        
        )
      
    
  




FIG. 5 shows a diagram 400 of an embodiment of a broadband SLM 410 comprising a plurality of tentative locations and an estimated source location 420. Location 420 corresponds to a point (rg,∥çgçq) as discussed above. Although only one estimated source location 420 is shown for SLM 410, other SLMs may contain additional estimated source locations 420.
One approach to estimate S considers each frequency ωf separately. Even if the perturbations {Vf}f=1F were perfectly known, estimating each sf would require solving an underdetermined system of linear equations entailing G variables and MN equations, where usually G>>MN. Although using a minimum-norm estimator based on the Moore-Penrose pseudo-inverse for each sf is possible, such an estimator would be unaware of the sparse structure inherent to sf and sensitive to perturbations on Yf. Moreover, considering each sf separately would disregard correlations among the columns of S. Naturally, estimating each sf is further complicated when Vf is unknown.
Below, a robust estimator for S is developed. Hereafter, a stochastic model is adopted for the unknown perturbations {Vf}f=1F as described next. A first assumption is that columns of Vf are zero-mean random vectors with covariance matrix Σf∈G×G, and are independent across Vf's. Thus, Vf=ON×G, ∀f;Vf†Vf=Σf, ∀f; and Vf†Vf′=OG×G, ∀f≠f′. Each Σf can be written as Σf=QfDfQf† where Qf is a unitary matrix and Df is a diagonal matrix whose main-diagonal entries {σg,f2}g=1g correspond to ∥vg,f∥22.
The problem is now cast within a multi-task learning framework with F robust regression tasks as the following regularized stochastic LS problem:




  
    
      
        
          
            min
            
              S
              ∈
              
                                
                  G
                  ×
                  F
                
              
            
          
          ⁢
          
            
              1
              
                2
                ⁢
                M
              
            
            ⁢
            
              
                ∑
                
                  f
                  =
                  1
                
                F
              
              ⁢
              
                                ⁢
                
                  
                    
                    
                      
                        Y
                        f
                      
                      -
                      
                        
                          (
                          
                            
                              P
                              f
                            
                            +
                            
                              V
                              f
                            
                          
                          )
                        
                        ⁢
                        
                          s
                          f
                        
                        ⁢
                        
                          1
                          M
                          ′
                        
                      
                    
                    
                  
                  F
                  2
                
              
            
          
        
        +
        
          μ
          ⁢
          
            
              ∑
              
                g
                =
                1
              
              G
            
            ⁢
            
              
                
                
                  ϛ
                  g
                
                
              
              q
            
          
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          5
        
        )
      
    
  




where μ>0 is a tuning parameter controlling the sparsity level on S and q∈(1,∞]. Each task in (Eq. 5) contrives to learn the regression coefficient vectors sf that best explain Yf. Columns of S are expected to have a common support since their support corresponds to the source locations which are assumed constant across frequencies. A natural way to guarantee a common support for all columns of S, thereby enabling information sharing across tasks, is by inducing group sparsity on the rows of S as is done in (Eq. 5) by the l1/lq-regularizer. The l1/lq-regularizer, a.k.a. group-Lasso regularizer, is known to induce group sparsity. Hence, setting q∈(1,∞] in (Eq. 5) guarantees that the {sf}f=1F shares a common support while encouraging sparsity across the rows of S.

The problem in (Eq. 5) can be recast as a deterministic optimization problem as stated next. With yf:=Yf1M/M, the stochastic LS problem defined in (Eq. 5) is equivalent to the following deterministic optimization problem:




  
    
      
        
          min
          
            S
            ∈
            
                            
                G
                ×
                F
              
            
          
        
        ⁢
        
          
            1
            2
          
          ⁢
          
            
              ∑
              
                f
                =
                1
              
              F
            
            ⁢
            
              (
              
                
                  
                    
                    
                      
                        
                          y
                          _
                        
                        f
                      
                      -
                      
                        
                          P
                          f
                        
                        ⁢
                        
                          s
                          f
                        
                      
                    
                    
                  
                  2
                  2
                
                +
                
                  
                    s
                    f
                    †
                  
                  ⁢
                  
                    Σ
                    f
                  
                  ⁢
                  
                    s
                    f
                  
                
                +
                
                  μ
                  ⁢
                  
                    
                      ∑
                      
                        g
                        =
                        1
                      
                      G
                    
                    ⁢
                    
                      
                        
                        
                          ϛ
                          g
                        
                        
                      
                      q
                    
                  
                
              
            
          
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          6
        
        )
      
    
  




The proof of equivalency between (Eq. 5) and (Eq. 6) follows after expanding the quadratic term within the expectation in (Eq. 5), using the assumption, and applying the definition for yf. The stochastic error fitting term in (Eq. 5) has been replaced by two deterministic terms in (Eq. 6): (i) a term capturing the goodness-of-fit term between the average replica yf and the deterministic predictions Pfsf; and, (ii) a term penalizing the size of sf. Intuitively, on average Vf causes larger variations on Pf along the direction where it has larger variance. The term sf†Σfsf penalizes the magnitude of every entry in sf proportionally to the level of uncertainty (measured by its variance) induced by the corresponding column of Vf.

Setting μ=0 in (Eq. 6) renders the optimization problem separable across sf. Per index f, the resulting regression problem is a weighted ridge regression one for which there exists a non-sparse closed-form solution ŝfRidge=(Pf†Pf+Σf)−1P† yf. Although each ŝfRidge is available in closed form, computing ŝfRidge entails O(G3) computations rendering this approach computationally taxing for large G. With μ>0, using q=1 is known to encourage sparsity on each çg. Since Σg=1G∥çg∥1=Σf=1F∥sf∥1, setting q=1 encourages sparsity in each column of S while rendering (Eq. 6) separable across columns of S as well. Further assuming that Σf=λG, λ>0∀f, allows one to interpret (Eq. 6) as an LS-regularized regression problem per f using the elastic-net penalty. Note that neither setting captures the affinity across the regression coefficients for the various ωf.
Regarding the choice of q, albeit any l1/lq regularizers with q∈(1, ∞] can be used to induce group sparsity on the rows of S while yielding an optimization problem that can be cast as a convex optimization one, it has been suggested that q can define the level of coupling allowed across coefficients in different tasks. For q=1, the coefficients within a group çg are uncoupled; for q=2, the same coefficients are highly coupled; and for q=∞, their coupling is weaker. In fact, for the latter case the magnitude of the entries of çg can be set independently for each f so that |[çg]f|≦∥çg∥∞, ∀f, without affecting the value of the regularization term.
As illustrated by the diagram 500 in FIG. 6, a block coordinate decent (BCD) solver iteratively updates çg 510 by minimizing the cost in (Eq. 6) with respect to each row of S while keeping all other ones fixed 510 and 530. It uses a cyclic rule to visit the rows of S from first-to-last. An algorithm for the BCD solver is shown as diagram 700 of FIG. 8
FIG. 7 shows a flowchart of an embodiment of a method 600 in accordance with the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources. As an example, method 600 may be performed by system 10, 100, and 200 as shown in FIGS. 1-3. Also, while FIG. 7 shows one embodiment of method 600 to include steps 610-680, other embodiments of method 600 may contain fewer or more steps. Further, while in some embodiments the steps of method 600 may be performed as shown in FIG. 7, in other embodiments the steps may be performed in a different order, or certain steps may occur simultaneously with one or more other steps. Additionally, some or all of the steps of method 600 may be performed by processor 52 embedded within acoustic sensor array 50, by receiver 60, or by other processing means operatively connected to acoustic sensor array 50.
Method 600 may begin with step 610, which involves defining a grid  of G tentative locations rg, base on the location of an acoustic sensor array 50, where up to K acoustic sources 20, 30, and 40 are presumed to be located. In some embodiments step 610 includes the step of estimating the number of acoustic sources, while in other embodiments the number of acoustic sources is predetermined.
Step 620 involves using an acoustic model to compute, via the model-based predictor 220, replicas caused by simulated acoustic sources at locations in , wherein the replicas are Fourier coefficient vectors at F frequencies {ωf}f=1F corresponding to the acoustic pressure field 120 as sampled by an acoustic sensor array 140 having N sensors. Step 630 involves collecting, using the acoustic sensor array 140, time series data 130 of actual acoustic measurements at each sensor of the acoustic sensor array due to the acoustic sources 110.
Method 600 may proceed to step 640, which involves using a discrete-time Fourier transform (DFT) 150 on the collected time series data 130 partitioned to m blocks to compute Fourier coefficients at frequencies {ωf}f=1F for all sensors. Step 650 involves constructing DFT coefficient vectors ym,f∈N, ∀m,f at processing step 160 using the Fourier coefficients previously obtained via the DFT.
Step 660 involves modeling DFT coefficient vectors at ωf for the m-th measurement block of the collected time series data as ym,f=Σg=1Gsg,f(pg,f+vg,f)+εm,f, ∀m,f, where sg,f denotes the acoustic gain at ωf for a source located at rg, pg,f∈N is the replica for ωf corresponding to a source located at rg normalized so that ∥pg,f∥2=1, vg,f∈N is an unknown perturbation vector effecting pg,f, and εm,f denotes the Fourier coefficients at ωf corresponding to the noise in the m-th block.
Step 670 involves discarding locations from the set of tentative source locations  via a regression-coefficient screening procedure that depends on the available measurements, desired sparsity level, and specific form of an estimator for a complex-valued matrix S comprising all regression coefficients {sg,f}. In some embodiments, the regression-coefficient screening procedure is used to identify a set of çg's prior to finding Ŝ such that the {circumflex over (ç)}g=0F. In some embodiments, the regression-coefficient screening procedure uses a screening rule where the optimal {circumflex over (ç)}g(μ′′)=0F if and only if




  
    
      
        ∑
        
          f
          =
          1
        
        F
      
      ⁢
      
        
          (
          
            
              
                
                  1
                  +
                  
                    σ
                    
                      g
                      ,
                      f
                    
                  
                
              
              ⁢
              
                
                
                  
                    1
                    
                      μ
                      ′
                    
                  
                  -
                  
                    1
                    
                      μ
                      ′′
                    
                  
                
                
              
              ⁢
              
                
                  
                  y
                  
                
                2
              
            
            +
            
              
              
                
                  p
                  
                    g
                    ,
                    f
                  
                  †
                
                ⁢
                
                  
                    
                      γ
                      ~
                    
                    f
                    *
                  
                  ⁡
                  
                    (
                    
                      μ
                      ′
                    
                    )
                  
                
              
              
            
          
          )
        
        p
      
    
    ≤
    1
  
  ,




given {{tilde over (y)}f*(μ′)} and μ′, μ′′ such that μ′>μ′′>0, where {tilde over (y)}f*(μ′) is a Lagrange multiplier, wherein μ′=μmax, for which





  
    
      
        γ
        ~
      
      f
      *
    
    ⁡
    
      (
      
        μ
        max
      
      )
    
  
  =
  
    
      
        y
        f
      
      
        μ
        max
      
    
    .
  




Step 680 involves estimating



  
    
      
    
    ⁢
    
      S
      ⁢
      
        
      
      ⁢
      as
    
  




  
    
      
        S
        ^
      
      :=
      
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              min
              
                S
                ∈
                
                                    
                    G
                    ×
                    F
                  
                
              
            
            ⁢
            
              
                1
                
                  2
                  ⁢
                  M
                
              
              ⁢
              
                
                  ∑
                  
                    f
                    =
                    1
                  
                  F
                
                ⁢
                
                                    ⁢
                  
                    
                      
                      
                        
                          Y
                          f
                        
                        -
                        
                          
                            (
                            
                              
                                P
                                f
                              
                              +
                              
                                V
                                f
                              
                            
                            )
                          
                          ⁢
                          
                            s
                            f
                          
                          ⁢
                          
                            1
                            M
                            ′
                          
                        
                      
                      
                    
                    F
                    2
                  
                
              
            
          
        
        +
        
          μ
          ⁢
          
            
              ∑
              
                g
                =
                1
              
              G
            
            ⁢
            
              
                
                
                  ϛ
                  g
                
                
              
              q
            
          
        
      
    
    ,
  



where, for a given ωf, Yf:=[y1,f, . . . yM,f] comprises all M DFT Fourier coefficient vectors, Pf:=[p1,f, . . . , pG,f]∈N×G comprises all normalized replicas corresponding to locations in  where ∥pg,f∥2=1, ∀g,f, Vf:=[v1,f, . . . , vG,f]∈N×G is a complex-valued matrix comprising all perturbation vectors for ωf, μ is a tuning parameter controlling sparsity of the groups formed by the rows of S, çg:=[sg,1, . . . , sg,F]′∈F comprises the vector corresponding to the g-th row of S, sf:=[s1,f, . . . , sG,f]′∈F comprises the vector corresponding to the f-th column of S, 1M′ an M×1 vector of ones, and q∈(1,∞].

Step 680 also involves constructing one or more source localization maps (SLMs) 300 over  per frequency ωf using Ŝ, wherein each location on a particular SLM is associated with its corresponding acoustic gain estimate ŝg,f, wherein estimates of the actual locations of the K acoustic sources correspond to the locations of the K-largest, in magnitude, coefficients ŝg,f depicted in the SLM. In some embodiments, step 680 involves using each column ŝf of Ŝ to construct the SLMs per frequency ωf, while in other embodiments, step 680 involves using a whole row of S for each rg∈ to construct a broadband SLM. In some embodiments, the estimator for S is developed using a block coordinate descent approach.
Method 600 may be implemented as a series of modules, either functioning alone or in concert, with physical electronic and computer hardware devices. Method 600 may be computer-implemented as a program product comprising a plurality of such modules, which may be displayed for a user.
Various storage media, such as magnetic computer disks, optical disks, and electronic memories, as well as non-transitory computer-readable storage media and computer program products, can be prepared that can contain information that can direct a device, such as a micro-controller, to implement the above-described systems and/or methods. Once an appropriate device has access to the information and programs contained on the storage media, the storage media can provide the information and programs to the device, enabling the device to perform the above-described systems and/or methods.
For example, if a computer disk containing appropriate materials, such as a source file, an object file, or an executable file, were provided to a computer, the computer could receive the information, appropriately configure itself and perform the functions of the various systems and methods outlined in the diagrams and flowcharts above to implement the various functions. That is, the computer could receive various portions of information from the disk relating to different elements of the above-described systems and/or methods, implement the individual systems and/or methods, and coordinate the functions of the individual systems and/or methods.
Simulation Results
The performance of the disclosed broadband underwater source localization mapping method (BB-SLM) is illustrated below. The environment considered corresponds to the one in the third Shallow-Water Evaluation Cell Experiment (SWellEX-3), see diagram 800 shown in FIG. 9. In SWellEX-3, a 64-element, 118.1 m aperture (1.875 m spacing) vertical line array 810, was mounted beneath the floating instrument platform in 198 m of water 820. For this analysis, only N=9 elements spaced 11.25 m apart were used, forming a total aperture of 90 m with the bottom element 6 m above the seafloor 830, with differing levels of depth shown by reference numbers 840, 850, and 860. A grid with G=20; 000 locations spanning radial distances 0-10 km and depths 0-198 m was used. The grid's radial and vertical spacing was 50 m and 2 m, respectively.
Sample parameter values for the acoustic propagation model shown in FIG. 9 are: v1=1; 520 m/s, v2=1; 498 m/s, v3=1; 490 m/s, v4=1; 490 m/s, v5=1; 572 m/s, v6=1; 593 m/s, v7=1; 881 m/s, v8=3; 246 m/s, v9=5; 200 m/s, _b1=0:2 dB/m/KHz, _b2=0:06 dB/m/kHz, _b3=0:02 dB/m/kHz, _b1=1:76 g/cm3, _b2=2:06 g/cm3, and _b3=2:66 g/cm3.
The performance of the BB-SLM was compared to the one of: (i) incoherent Barlett, (ii) coherent broadband MFP (BB), (iii) coherent broadband MFP with white-noise constraint (WNC), (iv) the homotopy-based method (HB). For WNC, the diagonal loading factor was set to 0.01×Tr(R) where R denotes the sample covariance matrix.
Numerical results obtained from synthetic data were obtained from broadband sources transmitting at 5 frequencies {53+32 k}k=04. For the single source case, the source's gain was set to 125 dB per frequency, and its phase was chosen at random and was kept equal across frequencies. Predefined SNR values were obtained by adding different levels of additive white Gaussian noise to the scaled replicas at the array. HB and BB-SLM used M=1, while all other algorithms used M=10. A source with true location (r1, r2) is correctly localized if the largest peak of the ambiguity surface or SLM lie within (r1, r2):={(r1±k1Δr1,r2±k2Δr2), (r1±2Δr1,r2), (r1,r2±2Δr1):(k1,k2)∈{−1,0,1}2}. Both the disclosed method and the HB method were tuned to stop if more than 5 non-zeros were present in the SLMs. Since there was no mismatch between the true environment and the model used, λ=0 was used.
The probability of correct localization achieved by the various algorithms for a one- and two-source scenarios is illustrated in FIGS. 10 and 11. FIG. 10 shows a graph 900 illustrating the approach using both the l2 and l∞ regularizers for the single source case, while FIG. 11 shows a graph 1000 illustrating the approach using both the l2 and l∞ regularizers for the two source case. In FIG. 10, the acoustic source was located at (5 km, 100 m). Line 910 of FIG. 10 represents the Barlett method, line 920 represents the WNC approach, line 930 represents the BB method, line 940 represents the HB method, line 950 represents the BB-SLM l2 method as discussed herein, and line 960 represents the BB-SLM l∞ method as discussed herein.
In FIG. 11, the two acoustic sources were located at located at (5 km, 100 m) and (2 km, 170 m). Line 1010 of FIG. 11 represents the Barlett method, line 1020 represents the WNC approach, line 1030 represents the BB method, line 1040 represents the HB method, line 1050 represents the BB-SLM l2 method, and line 1060 represents the BB-SLM l∞ method. For the two source scenario, none of the MFP-based localization algorithms was able to correctly localize both sources even at high SNRs. The disclosed algorithm successfully localized both sources at medium and high SNRs.
Next, a scenario with two sources and a fixed average SNR at the receiver of 20 dB is considered. The source gains were set to 125 dB and their phases were chosen randomly. Both source gain and phase were set equal across frequencies for each source. The first source was kept fixed at 6.2 km range and 4 m depth. The second source moved away from the array at a constant depth of 146 m. Note that although the source levels are the same for all sources, their signal-to-interference-plus-noise-ratio at the receiver array is different for each source in accordance to their radial distance from the array.
FIG. 12 shows a graph 1100 illustrating the probability of correct localization of the disclosed method and the one of HB obtained for different ranges of the submerged source. Here, correct localization was defined to occur if the two largest peaks of the resulting SLMs lie within (r1, r2) defined by the true source locations. The probability of correct localization at each range was averaged over 50 Monte Carlo runs per location. In this case, the MFP based algorithms were not able to correctly localized the two sources. Both SCBB and HB were able to correctly localize the sources achieving different performance at different ranges. However, SCBB yielded higher probabilities of correct localization at most ranges considered. The source gain for each source is set equal for each frequency so that their received power at the array is 125 dB. Their phases are chosen at random per source, but are kept equal across frequencies.
Although some embodiments of the method were discussed herein with regard to underwater source localization, some embodiments of the method may apply other acoustic source localization environments, such as above water, where accurate in-air acoustic propagation models are available. The embodiments of the method disclosed herein may also be extended to exploit prior information about source locations so as to develop sparsity-cognizant tracking algorithms using passive sonar. Another possible extension involves using spatially distributed arrays for localization as a way to exploit spatial diversity to counteract multipath affects in the localization performance and to reduce the presence of surveillance gaps.
Many modifications and variations of the Multitask Learning Method for Broadband Source-Location Mapping of Acoustic Sources are possible in light of the above description. Within the scope of the appended claims, the embodiments of the systems described herein may be practiced otherwise than as specifically described. The scope of the claims is not limited to the implementations and the embodiments disclosed herein, but extends to other implementations and embodiments as may be contemplated by those having ordinary skill in the art.

## Claims

1. A method comprising the steps of:
determining a grid  of G tentative locations rg of one or more K acoustic sources;
using an acoustic model to predict replicas caused by simulated acoustic sources at locations in , wherein the replicas are Fourier coefficient vectors at F frequencies {ωf}f=1F corresponding to the acoustic pressure field as sampled by an acoustic sensor array having N sensors;
collecting, using the acoustic sensor array, time series data of actual acoustic measurements at each sensor of the acoustic sensor array due to the acoustic sources;
using a discrete-time Fourier transform (DFT) on the collected time series data partitioned to m blocks to compute Fourier coefficients at frequencies {ωf}f=1F for all sensors;
constructing DFT coefficient vectors ym,f∈N, ∀m,f using the Fourier coefficients previously obtained via the DFT;
modeling DFT coefficient vectors at ωf for the m-th measurement block of the collected time series data as ym,f=Σg=1Gsg,f(pg,f+vg,f)+εm,f, ∀m, f, where sg,f denotes the acoustic gain at ωf for a source located at rg, pg,f∈N is the replica for ωf corresponding to a source located at rg normalized so that ∥pg,f∥2=1, vg,f∈N is an unknown perturbation vector effecting pg,f, and εm,f denotes the Fourier coefficients at ωf corresponding to the noise in the m-th block;
discarding locations within  from a set of tentative source locations via a regression-coefficient screening procedure that depends on the available measurements, desired sparsity level, and specific form of an estimator for a complex-valued matrix S comprising all regression coefficients {sg,f};
estimating S as





  
    
      S
      ^
    
    :=
    
      
        arg
        ⁢
        
          
        
        ⁢
        
          
            min
            
              S
              ∈
              
                                
                  G
                  ×
                  F
                
              
            
          
          ⁢
          
            
              1
              
                2
                ⁢
                M
              
            
            ⁢
            
              
                ∑
                
                  f
                  =
                  1
                
                F
              
              ⁢
              
                                ⁢
                
                  
                    
                    
                      
                        Y
                        f
                      
                      -
                      
                        
                          (
                          
                            
                              P
                              f
                            
                            +
                            
                              V
                              f
                            
                          
                          )
                        
                        ⁢
                        
                          s
                          f
                        
                        ⁢
                        
                          1
                          M
                          ′
                        
                      
                    
                    
                  
                  F
                  2
                
              
            
          
        
      
      +
      
        μ
        ⁢
        
          
            ∑
            
              g
              =
              1
            
            G
          
          ⁢
          
            
              
              
                ϛ
                g
              
              
            
            q
          
        
      
    
  
  ,




where, for a given ωf, Yf:=[y1,f, . . . yM,f] comprises all MDFT Fourier coefficient vectors, Pf:=[p1,f, . . . , pG,f]∈N×G comprises all normalized replicas corresponding to locations in  where ∥pg,f∥2=1, ∀g, f, Vf:=[v1,f, . . . , vG,f]∈N×G is a complex-valued matrix comprising all perturbation vectors for ωf, μ is a tuning parameter controlling sparsity of the groups formed by the rows of S, çg:=[sg,1, . . . , sg,F]′∈F comprises the vector corresponding to the g-th row of S, sf:=[s1,f, . . . , sG,f]′∈F comprises the vector corresponding to the f-th column of S, 1M′ an M×1 vector of ones, and q∈(1, ∞]; and
constructing one or more SLMs over  per frequency ωf using Ŝ, wherein each location on a particular SLM is associated with its corresponding acoustic gain estimate ŝg,f, wherein estimates of the actual locations of the K acoustic sources correspond to the locations of the K-largest in magnitude coefficients ŝg,f depicted in the SLM.

2. The method of claim 1, wherein the step of determining a grid of tentative locations of an underwater acoustic source includes the step of estimating the number of acoustic sources.

3. The method of claim 1, wherein the step of constructing SLMs per frequency ωf comprises using each column ŝf of Ŝ to construct the SLMs per frequency ωf.

4. The method of claim 1, wherein the step of constructing SLMs over  per frequency ωf using S comprises using a whole row of S for each rg∈ to construct a broadband SLM.

5. The method of claim 1, wherein the estimator for S is developed using a block coordinate descent approach.

6. The method of claim 1, wherein the acoustic sources are surface and underwater acoustic sources, the acoustic model is an underwater acoustic model, and the acoustic sensor array is a hydrophone array.

7. The method of claim 1, wherein the regression-coefficient screening procedure is used to identify a set of çg's prior to finding Ŝ such that the {circumflex over (ç)}g=0F.

8. The method of claim 7, wherein the regression-coefficient screening procedure uses a screening rule where the optimal {circumflex over (ç)}g(μ′′)=0F if and only if




  
    
      
        ∑
        
          f
          =
          1
        
        F
      
      ⁢
      
        
          (
          
            
              
                
                  1
                  +
                  
                    σ
                    
                      g
                      ,
                      f
                    
                  
                
              
              ⁢
              
                
                
                  
                    1
                    
                      μ
                      ′
                    
                  
                  -
                  
                    1
                    
                      μ
                      ′′
                    
                  
                
                
              
              ⁢
              
                
                  
                  y
                  
                
                2
              
            
            +
            
              
              
                
                  p
                  
                    g
                    ,
                    f
                  
                  †
                
                ⁢
                
                  
                    
                      γ
                      ~
                    
                    f
                    *
                  
                  ⁡
                  
                    (
                    
                      μ
                      ′
                    
                    )
                  
                
              
              
            
          
          )
        
        p
      
    
    ≤
    1
  
  ,




given {{tilde over (y)}f*(μ′)} and μ′, μ′′ such that μ′>μ′′>0, where {tilde over (y)}f*(μ′) is a Lagrange multiplier.

9. The method of claim 8, wherein μ′=μmax, for which




  
    
      
        γ
        ~
      
      f
      *
    
    ⁡
    
      (
      
        μ
        max
      
      )
    
  
  =
  
    
      
        y
        f
      
      
        μ
        max
      
    
    .

10. A system comprising:
a processor operatively connected to an acoustic sensor array, wherein the processor is configured to perform the steps of:
determining a grid  of G tentative locations rg of one or more K acoustic sources;
using an acoustic model to predict replicas caused by simulated acoustic sources at locations in , wherein the replicas are Fourier coefficient vectors at F frequencies {ωf}f=1F corresponding to the acoustic pressure field as sampled by an acoustic sensor array having N sensors;
collecting, using the acoustic sensor array, time series data of actual acoustic measurements at each sensor of the acoustic sensor array due to the acoustic sources;
using a discrete-time Fourier transform (DFT) on the collected time series data partitioned to m blocks to compute Fourier coefficients at frequencies {ωf}f=1F for all sensors;
constructing DFT coefficient vectors ym,f∈N, ∀m, f using the Fourier coefficients previously obtained via the DFT;
modeling DFT coefficient vectors at ωf for the m-th measurement block of the collected time series data as ym,f=Σg=1Gsg,f(pg,f+vg,f)+εm,f, ∀m, f , where sg,f denotes the acoustic gain at ωf for a source located at rg, pg,f∈N is the replica for ωf corresponding to a source located at rg normalized so that ∥g,f∥2=1, vg,f∈N is an unknown perturbation vector effecting pg,f, and εm,f denotes the Fourier coefficients at ωf corresponding to the noise in the m-th block;
discarding locations within  from a set of tentative source locations via a regression-coefficient screening procedure that depends on the available measurements, desired sparsity level, and specific form of an estimator for a complex-valued matrix S comprising all regression coefficients {sg,f};
estimating S as





  
    
      S
      ^
    
    :=
    
      
        arg
        ⁢
        
          
        
        ⁢
        
          
            min
            
              S
              ∈
              
                                
                  G
                  ×
                  F
                
              
            
          
          ⁢
          
            
              1
              
                2
                ⁢
                M
              
            
            ⁢
            
              
                ∑
                
                  f
                  =
                  1
                
                F
              
              ⁢
              
                                ⁢
                
                  
                    
                    
                      
                        Y
                        f
                      
                      -
                      
                        
                          (
                          
                            
                              P
                              f
                            
                            +
                            
                              V
                              f
                            
                          
                          )
                        
                        ⁢
                        
                          s
                          f
                        
                        ⁢
                        
                          1
                          M
                          ′
                        
                      
                    
                    
                  
                  F
                  2
                
              
            
          
        
      
      +
      
        μ
        ⁢
        
          
            ∑
            
              g
              =
              1
            
            G
          
          ⁢
          
            
              
              
                ϛ
                g
              
              
            
            q
          
        
      
    
  
  ,




where, for a given ωf, Yf:=[y1,f, . . . yM,f] comprises all MDFT Fourier coefficient vectors, Pf:=[p1,f, . . . , pG,f]∈N×G comprises all normalized replicas corresponding to locations in  where ∥pg,f∥2=1, ∀g, f, Vf:=[v1,f, . . . , vG,f]∈N×G is a complex-valued matrix comprising all perturbation vectors for ωf, μ is a tuning parameter controlling sparsity of the groups formed by the rows of S, çg:=[sg,1, . . . , sg,F]′∈F comprises the vector corresponding to the g-th row of S, sf:=[s1,f, . . . , sG,f]′∈F comprises the vector corresponding to the f-th column of S, 1M′ an M×1 vector of ones, and q∈(1, ∞]; and
constructing one or more SLMs over  per frequency ωf using Ŝ, wherein each location on a particular SLM is associated with its corresponding acoustic gain estimate ŝg,f, wherein estimates of the actual locations of the K acoustic sources correspond to the locations of the K-largest in magnitude coefficients ŝg,f depicted in the SLM.

11. The system of claim 10, wherein the step of determining a grid of tentative locations of an underwater acoustic source includes the step of estimating the number of acoustic sources.

12. The system of claim 10, wherein the step of constructing SLMs per frequency ωf comprises using each column ŝf of Ŝ to construct the SLMs per frequency ωf.

13. The system of claim 10, wherein the step of constructing SLMs over  per frequency ωf using S comprises using a whole row of S for each rg∈ to construct a broadband SLM.

14. The system of claim 10, wherein the estimator for S is developed using a block coordinate descent approach.

15. The system of claim 10, wherein the acoustic sources are surface and underwater acoustic sources, the acoustic model is an underwater acoustic model, and the acoustic sensor array is a hydrophone array.

16. The system of claim 10, wherein the regression-coefficient screening procedure is used to identify a set of çg's prior to finding Ŝ such that the {circumflex over (ç)}g=0F.

17. The system of claim 16, wherein the regression-coefficient screening procedure uses a screening rule where the optimal {circumflex over (ç)}g(μ′′)=0F if and only if




  
    
      
        ∑
        
          f
          =
          1
        
        F
      
      ⁢
      
        
          (
          
            
              
                
                  1
                  +
                  
                    σ
                    
                      g
                      ,
                      f
                    
                  
                
              
              ⁢
              
                
                
                  
                    1
                    
                      μ
                      ′
                    
                  
                  -
                  
                    1
                    
                      μ
                      ′′
                    
                  
                
                
              
              ⁢
              
                
                  
                  y
                  
                
                2
              
            
            +
            
              
              
                
                  p
                  
                    g
                    ,
                    f
                  
                  †
                
                ⁢
                
                  
                    
                      γ
                      ~
                    
                    f
                    *
                  
                  ⁡
                  
                    (
                    
                      μ
                      ′
                    
                    )
                  
                
              
              
            
          
          )
        
        p
      
    
    ≤
    1
  
  ,




given {{tilde over (y)}f*(μ′)} and μ′, μ′′ such that μ′>μ′′>0, where {tilde over (y)}f*(μ′) is a Lagrange multiplier, wherein μ′=μmax, for which




  
    
      
        γ
        ~
      
      f
      *
    
    ⁡
    
      (
      
        μ
        max
      
      )
    
  
  =
  
    
      
        y
        f
      
      
        μ
        max
      
    
    .