Joint Multi-Domain Channel Estimation Based on Sparse Bayesian Learning for OTFS System

Since orthogonal time-frequency space(OTFS)can effectively handle the problems caused by Doppler effect in high-mobility environment,it has gradually become a promising candidate for modulation scheme in the next generation of mobile communication.However,the inter-Doppler interference(IDI)problem caused by fractional Doppler poses great challenges to channel estimation.To avoid this problem,this paper proposes a joint time and delayDoppler(DD)domain based on sparse Bayesian learning(SBL)channel estimation algorithm.Firstly,we derive the original channel response(OCR)from the time domain channel impulse response(CIR),which can reflect the channel variation during one OTFS symbol.Compare with the traditional channel model,the OCR can avoid the IDI problem.After that,the dimension of OCR is reduced by using the basis expansion model(BEM)and the relationship between the time and DD domain channel model,so that we have turned the underdetermined problem into an overdetermined problem.Finally,in terms of sparsity of channel in delay domain,SBL algorithm is used to estimate the basis coefficients in the BEM without any priori information of channel.The simulation results show the effectiveness and superiority of the proposed channel estimation algorithm.

Vector Approximate Message Passing with Sparse Bayesian Learning for Gaussian Mixture Prior

Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.

DOA estimation based on multi-frequency joint sparse Bayesian learning for passive radar

This paper considers multi-frequency passive radar and develops a multi-frequency joint direction of arrival(DOA)estimation algorithm to improve estimation accuracy and resolution.The developed algorithm exploits the sparsity of targets in the spatial domain.Specifically,we first extract the required frequency channel data and acquire the snapshot data through a series of preprocessing such as clutter suppression,coherent integration,beamforming,and constant false alarm rate(CFAR)detection.Then,based on the framework of sparse Bayesian learning,the target’s DOA is estimated by jointly extracting the multi-frequency data via evidence maximization.Simulation results show that the developed algorithm has better estimation accuracy and resolution than other existing multi-frequency DOA estimation algorithms,especially under the scenarios of low signalto-noise ratio(SNR)and small snapshots.Furthermore,the effectiveness is verified by the field experimental data of a multi-frequency FM-based passive radar.

Multimodality Prediction of Chaotic Time Series with Sparse Hard-Cut EM Learning of the Gaussian Process Mixture Model

The contribution of this work is twofold： （1） a multimodality prediction method of chaotic time series with the Gaussian process mixture （GPM） model is proposed, which employs a divide and conquer strategy. It automatically divides the chaotic time series into multiple modalities with different extrinsic patterns and intrinsic characteristics, and thus can more precisely fit the chaotic time series. （2） An effective sparse hard-cut expec- tation maximization （SHC-EM） learning algorithm for the GPM model is proposed to improve the prediction performance. SHO-EM replaces a large learning sample set with fewer pseudo inputs, accelerating model learning based on these pseudo inputs. Experiments on Lorenz and Chua time series demonstrate that the proposed method yields not only accurate multimodality prediction, but also the prediction confidence interval SHC-EM outperforms the traditional variational 1earning in terms of both prediction accuracy and speed. In addition, SHC-EM is more robust and insusceptible to noise than variational learning.

Sparse Bayesian learning in ISAR tomography imaging

Inverse synthetic aperture radar(ISAR) imaging can be regarded as a narrow-band version of the computer aided tomography(CT). The traditional CT imaging algorithms for ISAR, including the polar format algorithm(PFA) and the convolution back projection algorithm(CBP), usually suffer from the problem of the high sidelobe and the low resolution. The ISAR tomography image reconstruction within a sparse Bayesian framework is concerned. Firstly, the sparse ISAR tomography imaging model is established in light of the CT imaging theory. Then, by using the compressed sensing(CS) principle, a high resolution ISAR image can be achieved with limited number of pulses. Since the performance of existing CS-based ISAR imaging algorithms is sensitive to the user parameter, this makes the existing algorithms inconvenient to be used in practice. It is well known that the Bayesian formalism of recover algorithm named sparse Bayesian learning(SBL) acts as an effective tool in regression and classification,which uses an efficient expectation maximization procedure to estimate the necessary parameters, and retains a preferable property of the l0-norm diversity measure. Motivated by that, a fully automated ISAR tomography imaging algorithm based on SBL is proposed.Experimental results based on simulated and electromagnetic(EM) data illustrate the effectiveness and the superiority of the proposed algorithm over the existing algorithms.

EARLY CATARACT DETECTION BY DYNAMIC LIGHT SCATTERING WITH SPARSE BAYESIAN LEARNING

Dynamic light scattering(DLS)is a promising technique for early cataract detection and for studying cataractogenesis.A novel probabilistic analysis tool,the sparse Bayesian learning(SBL)algorithm,is described for reconstructing the most-probable size distribution ofα-crystallin and their aggregates in an ocular lens from the DLS data.The performance of the algorithm is evaluated by analyzing simulated correlation data from known distributions and DLS data from the ocular lenses of a fetal calf,a Rhesus monkey,and a man,so as to establish the required efficiency of the SBL algorithm for clinical studies.

基于吉布斯采样的稀疏水声信道估计方法

The estimation of sparse underwater acoustic(UWA)channels can be regarded as an inference problem involving hidden variables within the Bayesian framework.While the classical sparse Bayesian learning(SBL),derived through the expectation maximization(EM)algorithm,has been widely employed for UWA channel estimation,it still differs from the real posterior expectation of channels.In this paper,we propose an approach that combines variational inference(VI)and Markov chain Monte Carlo(MCMC)methods to provide a more accurate posterior estimation.Specifically,the SBL is first re-derived with VI,allowing us to replace the posterior distribution of the hidden variables with a variational distribution.Then,we determine the full conditional probability distribution for each variable in the variational distribution and then iteratively perform random Gibbs sampling in MCMC to converge the Markov chain.The results of simulation and experiment indicate that our estimation method achieves lower mean square error and bit error rate compared to the classic SBL approach.Additionally,it demonstrates an acceptable convergence speed.

Denoising enabled channel estimation for underwater acoustic communications:A sparsity-aware model-driven learning approach

It has always been difficult to achieve accurate information of the channel for underwater acoustic communications because of the severe underwater propagation conditions,including frequency-selective property,high relative mobility,long propagation latency,and intensive ambient noise,etc.To this end,a deep unfolding neural network based approach is proposed,in which multiple layers of the network mimic the iterations of the classical iterative sparse approximation algorithm to extract the inherent sparse features of the channel by exploiting deep learning,and a scheme based on the Sparsity-Aware DNN(SA-DNN)for UAC estimation is proposed to improve the estimation accuracy.Moreover,we propose a Denoising Sparsity-Aware DNN(DeSA-DNN)based enhanced method that integrates a denoising CNN module in the sparsity-aware deep network,so that the degradation brought by intensive ambient noise could be eliminated and the estimation accuracy can be further improved.Simulation results demonstrate that the performance of the proposed schemes is superior to the state-of-the-art compressed sensing based and iterative sparse recovery schems in the aspects of channel recovery precision,pilot overhead,and robustness,particularly under unideal circumstances of intensive ambient noise or inadequate measurement pilots.

Online identification of time-varying dynamical systems for industrial robots based on sparse Bayesian learning

Nowadays, industrial robots have been widely used in manufacturing, healthcare, packaging, and more. Choosing robots in these applications mainly attributes to their repeatability and precision. However, prolonged and loaded operations can deteriorate the accuracy and efficiency of industrial robots due to the unavoidable accumulated kinematical and dynamical errors. This paper resolves these aforementioned issues by proposing an online time-varying sparse Bayesian learning(SBL) method to identify dynamical systems of robots in real-time. The identification of dynamical systems for industrial robots is cast as a sparse linear regression problem. By constructing the dictionary matrix, the parameters of the robot dynamics are effectively estimated via a re-weighted1-minimization algorithm. Online recursive methods are integrated into SBL to achieve real-time system identification. By including sparsity and promoting online learning, the proposed method can handle time-varying dynamical systems and therefore improve operational stability and accuracy. Experimental results on both simulated and real selective compliance assembly robot arm(SCARA) robots have demonstrated the effectiveness of the proposed method for industrial robots.

On fast estimation of direction of arrival for underwater acoustic target based on sparse Bayesian learning

The Direction of Arrival （DOA） estimation methods for underwater acoustic target using Temporally Multiple Sparse Bayesian Learning （TMSBL） as the reconstructing algorithm have the disadvantage of slow computing speed. To solve this problem, a fast underwater acoustic target direction of arrival estimation was proposed. Analyzing the model characteristics of block-sparse Bayesian learning framework for DOA estimation, an algorithm was proposed to obtain the value of core hyper-parameter through MacKay＇s fixed-point method to estimate the DOA. By this process, it will spend less time for computation and provide more superior recovery performance than TMSBL algorithm. Simulation results verified the feasibility and effectiveness of the proposed algorithm.

Data-Driven Discovery of Stochastic Differential Equations

Stochastic differential equations(SDEs)are mathematical models that are widely used to describe complex processes or phenomena perturbed by random noise from different sources.The identification of SDEs governing a system is often a challenge because of the inherent strong stochasticity of data and the complexity of the system’s dynamics.The practical utility of existing parametric approaches for identifying SDEs is usually limited by insufficient data resources.This study presents a novel framework for identifying SDEs by leveraging the sparse Bayesian learning(SBL)technique to search for a parsimonious,yet physically necessary representation from the space of candidate basis functions.More importantly,we use the analytical tractability of SBL to develop an efficient way to formulate the linear regression problem for the discovery of SDEs that requires considerably less time-series data.The effectiveness of the proposed framework is demonstrated using real data on stock and oil prices,bearing variation,and wind speed,as well as simulated data on well-known stochastic dynamical systems,including the generalized Wiener process and Langevin equation.This framework aims to assist specialists in extracting stochastic mathematical models from random phenomena in the natural sciences,economics,and engineering fields for analysis,prediction,and decision making.

DOA Estimation Based on Root Sparse Bayesian Learning Under Gain and Phase Error

The direction of arrival(DOA)is approximated by first-order Taylor expansion in most of the existing methods,which will lead to limited estimation accuracy when using coarse mesh owing to the off-grid error.In this paper,a new root sparse Bayesian learning based DOA estimation method robust to gain-phase error is proposed,which dynamically adjusts the grid angle under coarse grid spacing to compensate the off-grid error and applies the expectation maximization(EM)method to solve the respective iterative formula-based on the prior distribution of each parameter.Simulation results verify that the proposed method reduces the computational complexity through coarse grid sampling while maintaining a reasonable accuracy under gain and phase errors,as compared to the existing methods.

Data-driven discovery of linear dynamical systems from noisy data

In modern science and engineering disciplines,data-driven discovery methods play a fundamental role in system modeling,as data serve as the external representations of the intrinsic mechanisms within systems.However,empirical data contaminated by process and measurement noise remain a significant obstacle for this type of modeling.In this study,we have developed a data-driven method capable of directly uncovering linear dynamical systems from noisy data.This method combines the Kalman smoothing and sparse Bayesian learning to decouple process and measurement noise under the expectation-maximization framework,presenting an analytical method for alternate state estimation and system identification.Furthermore,the discovered model explicitly characterizes the probability distribution of process and measurement noise,as they are essential for filtering,smoothing,and stochastic control.We have successfully applied the proposed algorithm to several simulation systems.Experimental results demonstrate its potential to enable linear dynamical system discovery in practical applications where noise-free data are intractable to capture.

Codimensional matrix pairing perspective of BYY harmony learning:hierarchy of bilinear systems,joint decomposition of data-covariance,and applications of network biology

One paper in a preceding issue of this journal has introduced the Bayesian Ying-Yang(BYY)harmony learning from a perspective of problem solving,parameter learning,and model selection.In a complementary role,the paper provides further insights from another perspective that a co-dimensional matrix pair(shortly co-dim matrix pair)forms a building unit and a hierarchy of such building units sets up the BYY system.The BYY harmony learning is re-examined via exploring the nature of a co-dim matrix pair,which leads to improved learning performance with refined model selection criteria and a modified mechanism that coordinates automatic model selection and sparse learning.Besides updating typical algorithms of factor analysis(FA),binary FA(BFA),binary matrix factorization(BMF),and nonnegative matrix factorization(NMF)to share such a mechanism,we are also led to(a)a new parametrization that embeds a de-noise nature to Gaussian mixture and local FA(LFA);(b)an alternative formulation of graph Laplacian based linear manifold learning;(c)a codecomposition of data and covariance for learning regularization and data integration;and(d)a co-dim matrix pair based generalization of temporal FA and state space model.Moreover,with help of a co-dim matrix pair in Hadamard product,we are led to a semi-supervised formation for regression analysis and a semi-blind learning formation for temporal FA and state space model.Furthermore,we address that these advances provide with new tools for network biology studies,including learning transcriptional regulatory,Protein-Protein Interaction network alignment,and network integration.

ESTIMATION AND UNCERTAINTY QUANTIFICATION FOR PIECEWISE SMOOTH SIGNAL RECOVERY

This paper presents an application of the sparse Bayesian learning(SBL)algorithm to linear inverse problems with a high order total variation(HOTV)sparsity prior.For the problem of sparse signal recovery,SBL often produces more accurate estimates than maximum a posteriori estimates,including those that useℓ1 regularization.Moreover,rather than a single signal estimate,SBL yields a full posterior density estimate which can be used for uncertainty quantification.However,SBL is only immediately applicable to problems having a direct sparsity prior,or to those that can be formed via synthesis.This paper demonstrates how a problem with an HOTV sparsity prior can be formulated via synthesis,and then utilizes SBL.This expands the class of problems available to Bayesian learning to include,e.g.,inverse problems dealing with the recovery of piecewise smooth functions or signals from data.Numerical examples are provided to demonstrate how this new technique is effectively employed.

Building trust networks in the absence of trust relations

User-specified trust relations are often very sparse and dynamic, making them difficult to accurately predict from online social media. In addition, trust relations are usually unavailable for most social media platforms.These issues pose a great challenge for predicting trust relations and further building trust networks. In this study,we investigate whether we can predict trust relations via a sparse learning model, and propose to build a trust network without trust relations using only pervasively available interaction data and homophily effect in an online world. In particular, we analyze the reliability of predicting trust relations by interaction behaviors, and provide a principled way to mathematically incorporate interaction behaviors and homophily effect in a novel framework,b Trust. Results of experiments on real-world datasets from Epinions and Ciao demonstrated the effectiveness of the proposed framework. Further experiments were conducted to understand the importance of interaction behaviors and homophily effect in building trust networks.

Protein Phosphorylation Site Prediction via Feature Discovery Support Vector Machine

Protein phosphorylation/dephosphorylation is the central mechanism of post-translational modification which regulates cellular responses and phenotypes. Due to the efficiency and resource constraints of the in vivo methods for identifying phosphorylation sites, there is a strong motivation to computationally predict potential phosphorylation sites. In this work, we propose to use a unique set of features to represent the peptides surrounding the amino acid sites of interest and use feature selection support vector machine to predict whether the serine/threonine sites are potentially phosphorylable, as well as selecting important features that may lead to phosphorylation. Experimental results indicate that the new features and the prediction method can more effectively predict protein phosphorylation sites than the existing state of the art methods. The features selected by our prediction model provide biological insights to the in vivo phosphorylation.

Methods for Population-Based eQTL Analysis in Human Genetics

Gene expression is a critical process in biological system that is influenced and modulated by many factors including genetic variation. Expression Quantitative Trait Loci（e QTL） analysis provides a powerful way to understand how genetic variants affect gene expression. For genome wide e QTL analysis, the number of genetic variants and that of genes are large and thus the search space is tremendous. Therefore, e QTL analysis brings about computational and statistical challenges. In this paper, we provide a comprehensive review of recent advances in methods for e QTL analysis in population-based studies. We first present traditional pairwise association methods, which are widely used in human genetics. To account for expression heterogeneity, we investigate the methods for correcting confounding factors. Next, we discuss newly developed statistical learning methods including Lasso-based models. In the conclusion, we provide an overview of future method development in analyzing e QTL associations. Although we focus on human genetics in this review, the methods are applicable to many other organisms.

Multi-dimensional scenario forecast for generation of multiple wind farms

A novel multi-dimensional scenario forecast approach which can capture the dynamic temporal-spatial interdependence relation among the outputs of multiple wind farms is proposed.In the proposed approach,support vector machine(SVM)is applied for the spot forecast of wind power generation.The probability density function(PDF)of the SVM forecast error is predicted by sparse Bayesian learning(SBL),and the spot forecast result is corrected according to the error expectation obtained.The copula function is estimated using a Gaussian copula-based dynamic conditional correlation matrix regression(DCCMR)model to describe the correlation among the errors.And the multidimensional scenario is generated with respect to the estimated marginal distributions and the copula function.Test results on three adjacent wind farms illustrate the effectiveness of the proposed approach.

Deep adaptive control with online identification for industrial robots

Derivation of control equations from data is a critical problem in numerous scientific and engineering fields.The inverse dynamic control of robot manipulators in the field of industrial robot research is a key example.Traditionally,researchers needed to obtain the robot dynamic model through physical modeling methods before developing controllers.However,the robot dynamic model and suitable control methods are often elusive and difficult to tune,particularly when dealing with real dynamical systems.In this paper,we combine an enhanced online sparse Bayesian learning(OSBL)algorithm and a model reference adaptive control method to obtain a data-driven modeling and control strategy from data containing noise;this strategy can be applied to dynamical systems.In particular,we use a sparse Bayesian approach,relying only on some prior knowledge of its physics,to extract an accurate mechanistic model from the measured data.Unmodeled parameters are further identified from the modeling error through a deep neural network(DNN).By combining the identification model with a model reference adaptive control approach,a general deep adaptive control(DAC)method is obtained,which can tolerate unmodeled dynamics.The adaptive update law is derived from Lyapunov’s stability criterion,which guarantees the asymptotic stability of the system.Finally,the Enhanced OSBL identification method and DAC scheme are applied on a six-degree-of-freedom industrial robot,and the effectiveness of the proposed method is verified.