Search Results (144)

Through extensive literature review, it has been found that sparse Bayesian learning (SBL) is mainly applied to traditional scalar hydrophones and is rarely applied to vector hydrophones. This article proposes a direction of arrival (DOA) estimation method for vector hydrophones based on SBL (Vector-SBL). Firstly, vector hydrophones capture both sound pressure and particle velocity, enabling the acquisition of multidimensional sound field information. Secondly, SBL accurately reconstructs the received vector signal, addressing challenges like low signal-to-noise ratio (SNR), limited snapshots, and coherent sources. Finally, precise DOA estimation is achieved for multiple sources without prior knowledge of their number. Simulation experiments have shown that compared with the OMP, MUSIC, and CBF algorithms, the proposed method exhibits higher DOA estimation accuracy under conditions of low SNR, small snapshots, multiple sources, and coherent sources. Furthermore, it demonstrates superior resolution when dealing with closely spaced signal sources. Full article

Given the vulnerability of surface water to the direct impacts of climate change, the accurate prediction of groundwater levels has become increasingly important, particularly for dry regions, offering significant resource management benefits. This study presents the first statewide groundwater level anomaly (GWLA) prediction for Arizona across its two distinct aquifer types—unconsolidated sand and gravel aquifers and rock aquifers. Machine learning (ML) models were combined with empirical Bayesian kriging (EBK) geostatistical interpolation models to predict monthly GWLAs between January 2010 and December 2019. Model evaluations were based on the Nash–Sutcliffe efficiency (NSE) and coefficient of determination (R²) metrics. With average NSE/R² values of 0.62/0.63 and 0.72/0.76 during the validation and test phases, respectively, our multi-model approach demonstrated satisfactory performance, and the predictive accuracy was much higher for the unconsolidated sand and gravel aquifers. By employing a remote sensing-based approach, our proposed model design can be replicated for similar climates globally, and hydrologically data-sparse and remote areas of the world are not left out. Full article

Multiple-input multiple-output (MIMO) linear time-invariant (LTI) systems exhibit enormous computational costs for high-dimensional problems. To address this problem, we propose a novel approach for reducing the dimensionality of MIMO systems. The method leverages the Takenaka–Malmquist basis and incorporates the strictly complex-valued relevant vector machine (SCRVM). We refer to this method as covariance-free maximum likelihood (CoFML). The proposed method avoids the explicit computation of the covariance matrix. CoFML solves multiple linear systems to obtain the required posterior statistics for covariance. This is achieved by exploiting the preconditioning matrix and the matrix diagonal element estimation rule. We provide theoretical justification for this approximation and show why our method scales well in high-dimensional settings. By employing the CoFML algorithm, we approximate MIMO systems in parallel, resulting in significant computational time savings. The effectiveness of this method is demonstrated through three well-known examples. Full article

Off-grid issues and high computational complexity are two major challenges faced by sparse Bayesian learning (SBL)-based compressive sensing (CS) algorithms used for random frequency pulse interval agile (RFPA) radar. Therefore, this paper proposes an off-grid CS algorithm for RFPA radar based on Root-SBL to address these issues. To effectively cope with off-grid issues, this paper derives a root-solving formula inspired by the Root-SBL algorithm for velocity parameters applicable to RFPA radar, thus enabling the proposed algorithm to directly solve the velocity parameters of targets during the fine search stage. Meanwhile, to ensure computational feasibility, the proposed algorithm utilizes a simple single-level hierarchical prior distribution model and employs the derived root-solving formula to avoid the refinement of velocity grids. Moreover, during the fine search stage, the proposed algorithm combines the fixed-point strategy with the Expectation-Maximization algorithm to update the hyperparameters, further reducing computational complexity. In terms of implementation, the proposed algorithm updates hyperparameters based on the single-level prior distribution to approximate values for the range and velocity parameters during the coarse search stage. Subsequently, in the fine search stage, the proposed algorithm performs a grid search only in the range dimension and uses the derived root-solving formula to directly solve for the target velocity parameters. Simulation results demonstrate that the proposed algorithm maintains low computational complexity while exhibiting stable performance for parameter estimation in various multi-target off-grid scenarios. Full article

To solve the problem that the hydrophone arrays are disturbed by ocean noise when collecting signals in shallow seas, resulting in reduced accuracy and resolution of target orientation estimation, a direction-of-arrival (DOA) estimation algorithm based on iterative EMD interval thresholding (EMD-IIT) and off-grid sparse Bayesian learning is proposed. Firstly, the noisy signal acquired by the hydrophone array is denoised by the EMD-IIT algorithm. Secondly, the singular value decomposition is performed on the denoised signal, and then an off-grid sparse reconstruction model is established. Finally, the maximum a posteriori probability of the target signal is obtained by the Bayesian learning algorithm, and the DOA estimate of the target is derived to achieve the orientation estimation of the target. Simulation analysis and sea trial data results show that the algorithm achieves a resolution probability of 100% at an azimuthal separation of 8° between adjacent signal sources. At a low signal-to-noise ratio of −9 dB, the resolution probability reaches 100%. Compared with the conventional MUSIC-like and OGSBI-SVD algorithms, this algorithm can effectively eliminate noise interference and provides better performance in terms of localization accuracy, algorithm runtime, and algorithm robustness. Full article

Sound source identification technology based on a microphone array has many application scenarios. The compressive beamforming method has attracted much attention due to its high accuracy and high-resolution performance. However, for the far-field measurement problem of large microphone arrays, existing methods based on fixed grids have the defect of basis mismatch. Due to the large number of grid points representing potential sound source locations, the identification accuracy of traditional grid adjustment methods also needs to be improved. To solve this problem, this paper proposes a sound source identification method based on adaptive grid splitting and refinement. First, the initial source locations are obtained through a sparse Bayesian learning framework. Then, higher-weight candidate grids are retained, and local regions near them are split and updated. During the iteration process, Green’s function and the source strength obtained in the previous iteration are multiplied to get the sound pressure matrix. The robust principal component analysis model of the Gaussian mixture separates and replaces the sound pressure matrix with a low-rank matrix. The actual sound source locations are gradually approximated through the dynamically adjusted sound pressure low-rank matrix and optimized grid transfer matrix. The performance of the method is verified through numerical simulations. In addition, experiments on a standard aircraft model are conducted in a wind tunnel and speakers are installed on the model, proving that the proposed method can achieve fast, high-precision imaging of low-frequency sound sources in an extensive dynamic range at long distances. Full article

In this paper, we present a novel sparse Bayesian learning (SBL) method for image reconstruction. We integrate the generalized approximate message passing (GAMP) algorithm and Laplacian hierarchical priors (LHP) into a basic SBL model (called LHP-GAMP-SBL) to improve the reconstruction efficiency. In our SBL model, the GAMP structure is used to estimate the mean and variance without matrix inversion in the E-step, while LHP is used to update the hyperparameters in the M-step.The combination of these two structures further deepens the hierarchical structures of the model. The representation ability of the model is enhanced so that the reconstruction accuracy can be improved. Moreover, the introduction of LHP accelerates the convergence of GAMP, which shortens the reconstruction time of the model. Experimental results verify the effectiveness of our method. Full article

With the increasingly complex electromagnetic environment faced by radar, random stepped frequency (RSF) has garnered widespread attention owing to its remarkable Electronic Counter-Countermeasure (ECCM) characteristic, and it has been universally applied in inverse synthetic aperture radar (ISAR) in recent years. However, if the phase error induced by the translational motion of the target in RSF ISAR is not precisely compensated, the imaging result will be defocused. To address this challenge, a novel 2D method based on sparse Bayesian learning, denoted as 2D-autofocusing complex-value inverse-free SBL (2D-AFCIFSBL), is proposed to accomplish joint ISAR imaging and autofocusing for RSF ISAR. First of all, to integrate autofocusing into the ISAR imaging process, phase error estimation is incorporated into the imaging model. Then, we increase the speed of Bayesian inference by relaxing the evidence lower bound (ELBO) to avoid matrix inversion, and we further convert the iterative process into a matrix form to improve the computational efficiency. Finally, the 2D phase error is estimated through maximum likelihood estimation (MLE) in the image reconstruction iteration. Experimental results on both simulated and measured datasets have substantiated the effectiveness and computational efficiency of the proposed 2D joint imaging and autofocusing method. Full article

Multi-target tracking using infrared images is receiving more and more attention. There are many state-of-the-art methods, and the deep learning network and low-rank and sparse matrix separation are two kinds of methods with high accuracy. However, the former suffers from heavy training samples, and the latter requires high-dimensional processing, meaning its computing cost is huge. In this work, a united detection and tracking method with matrix separation and PMBM filtering is proposed. In the detection process, a low-rank and sparse matrix separation algorithm with a differentiable form based on a single image is constructed. In the filtering process, the multi-target state is modeled as a PMBM distribution, which is conjugate in the Bayesian framework. The two processes interact mutually in that the detection provides measurements, and the filtering offers prior information for the next detection to improve accuracy. The computational complexity is given by a theoretical analysis, which shows a significant reduction. The numerical analysis, carried out on a practical dataset, verifies an enhancement in the BSF and SCRG metrics and ROC curves. Full article

In this work, we present a novel methodology for performing the supervised classification of time-ordered noisy data; we call this methodology Entropic Sparse Probabilistic Approximation with Markov regularization (eSPA-Markov). It is an extension of entropic learning methodologies, allowing the simultaneous learning of segmentation patterns, entropy-optimal feature space discretizations, and Bayesian classification rules. We prove the conditions for the existence and uniqueness of the learning problem solution and propose a one-shot numerical learning algorithm that—in the leading order—scales linearly in dimension. We show how this technique can be used for the computationally scalable identification of persistent (metastable) regime affiliations and regime switches from high-dimensional non-stationary and noisy time series, i.e., when the size of the data statistics is small compared to their dimensionality and when the noise variance is larger than the variance in the signal. We demonstrate its performance on a set of toy learning problems, comparing eSPA-Markov to state-of-the-art techniques, including deep learning and random forests. We show how this technique can be used for the analysis of noisy time series from DNA and RNA Nanopore sequencing. Full article

Sparse recovery space–time adaptive processing (SR-STAP) technology improves the moving target detection performance of airborne radar. However, the sparse recovery method with a fixed dictionary usually leads to an off-grid effect. This paper proposes a STAP algorithm for airborne radar based on dictionary and clutter power spectrum joint correction (DCPSJC-STAP). The algorithm first performs nonlinear regression in a non-stationary clutter environment with unknown yaw angles, and it corrects the corresponding dictionary for each snapshot by updating the clutter ridge parameters. Then, the corrected dictionary is combined with the sparse Bayesian learning algorithm to iteratively update the required hyperparameters, which are used to correct the clutter power spectrum and estimate the clutter covariance matrix. The proposed algorithm can effectively overcome the off-grid effect and improve the moving target detection performance of airborne radar in actual complex clutter environments. Simulation experiments verified the effectiveness of this algorithm in improving clutter estimation accuracy and moving target detection performance. Full article

Prediction tunnel settlement in shield tunnels during the operation period has gained increasing significance within the realm of maintenance strategy formulation. The sparse settlement data during this period present a formidable challenge for predictive Artificial Intelligence (AI) models, as they may not handle non-stationary relationships effectively or have the risk of overfitting. In this study, we propose an improved machine learning (ML) model based on sparse settlement data. We enhance training data via time series clustering, use time decomposition to uncover latent features, and employ Extreme Gradient Boosting (XGBoost) v1.5.1 with Bayesian Optimization (BO) v1.2.0 for precise predictions. Comparative experiments conducted on different acquisition points substantiate our model’s efficacy, the in-training set yielding a Mean Absolute Error (MAE) of 0.649 mm, Root Mean Square Error (RMSE) of 0.873 mm, Mean Absolute Percentage Error (MAPE) of 3.566, and Coefficient of Determination (R²) of 0.872, and the in-testing set yielding a MAE of 0.717 mm, RMSE of 1.048 mm, MAPE of 4.080, and R² of 0.846. The empirical results show the superiority of the proposed model compared to simple ML models and a complex neural network model, as it has a lower prediction error and higher accuracy across different sparse settlement datasets. Moreover, this paper underlines that accurate settlement predictions contribute to achieving some Sustainable Development Goals (SDGs). Specifically, preventive tunnel maintenance strategies based on predictive results can enhance tunnels’ long-term operational reliability, which is in accordance with SDG 9 (Industry, Innovation, and Infrastructure) and SDG 11 (Sustainable Cities and Communities). Full article

As an important research focus in radar detection and localization, direction-of-arrival (DOA) estimation has advanced significantly owing to deep learning techniques with powerful fitting and classifying abilities in recent years. However, deep learning inevitably requires substantial data to ensure learning and generalization abilities and lacks reasonable interpretability. Recently, a deep unfolding technique has attracted widespread concern due to the more explainable perspective and weaker data dependency. More importantly, it has been proven that deep unfolding enables convergence acceleration when applied to iterative algorithms. On this basis, we rigorously deduce an iterative sparse Bayesian learning (SBL) algorithm and construct a Bayesian deep unfolded network in a one-to-one correspondence. Moreover, the common but intractable off-grid errors, caused by grid mismatch, are directly considered in the signal model and computed in the iterative process. In addition, minimum hole array, little considered in deep unfolding, is adopted to further improve estimation performance owing to the maximized array degrees of freedom (DOFs). Extensive simulation results are presented to illustrate the superiority of the proposed method beyond other state-of-the-art methods. Full article

Reverberation in real environments is an important factor affecting the high resolution of target sound source localization (SSL) methods. Broadband low-frequency signals are common in real environments. This study focuses on the localization of this type of signal in reverberant environments. Because the time reversal (TR) method can overcome multipath effects and realize adaptive focusing, it is particularly suitable for SSL in a reverberant environment. On the basis of the significant advantages of the sparse Bayesian learning algorithm in the estimation of wave direction, a novel SSL is proposed in reverberant environments. First, the sound propagation model in a reverberant environment is studied and the TR focusing signal is obtained. We then use the sparse Bayesian framework to locate the broadband low-frequency sound source. To validate the effectiveness of the proposed method for broadband low-frequency targeting in a reverberant environment, simulations and real data experiments were performed. The localization performance under different bandwidths, different numbers of microphones, signal-to-noise ratios, reverberation times, and off-grid conditions was studied in the simulation experiments. The practical experiment was conducted in a reverberation chamber. Simulation and experimental results indicate that the proposed method can achieve satisfactory spatial resolution in reverberant environments and is robust. Full article

Partially impaired sensor arrays pose a significant challenge in accurately estimating signal parameters. The occurrence of bad data is highly probable, resulting in random loss of source information and substantial performance degradation in parameter estimation. In this paper, a tensor variational sparse Bayesian learning (TVSBL) method is proposed for the estimate of direction of arrival (DOA) and polarization parameters jointly based on a conformal polarization sensitive array (CPSA), taking into account scenarios with the partially impaired sensor array. First, a sparse tensor-based received data model is developed for CPSAs that incorporates bad data. Then, a column vector detection method is proposed to diagnose the positions of the impaired sensors. In scenarios involving partially impaired sensor arrays, a low-rank matrix completion method is employed to recover the random loss of signal information. Finally, variational sparse Bayesian learning (VSBL) and minimum eigenvector methods are utilized sequentially to obtain the DOA and polarization parameters estimation, successively. Furthermore, the Cramér-Rao bound is given for the proposed method. Simulation results validated the effectiveness of the proposed method. Full article