Most of the existing direction of arrival(DOA)estimation algorithms are applied under the assumption that the array manifold is ideal.In practical engineering applications,the existence of non-ideal conditions such as...Most of the existing direction of arrival(DOA)estimation algorithms are applied under the assumption that the array manifold is ideal.In practical engineering applications,the existence of non-ideal conditions such as mutual coupling between array elements,array amplitude and phase errors,and array element position errors leads to defects in the array manifold,which makes the performance of the algorithm decline rapidly or even fail.In order to solve the problem of DOA estimation in the presence of amplitude and phase errors and array element position errors,this paper introduces the first-order Taylor expansion equivalent model of the received signal under the uniform linear array from the Bayesian point of view.In the solution,the amplitude and phase error parameters and the array element position error parameters are regarded as random variables obeying the Gaussian distribution.At the same time,the expectation-maximization algorithm is used to update the probability distribution parameters,and then the two error parameters are solved alternately to obtain more accurate DOA estimation results.Finally,the effectiveness of the proposed algorithm is verified by simulation and experiment.展开更多
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 gene...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.展开更多
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 ...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.展开更多
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 ...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.展开更多
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) a...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.展开更多
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 reco...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.展开更多
For dense time delay estimation(TDE),when multiple time delays are located within a grid interval,it is dificult for the existing sparse Bayesian learning/inference(SBL/SBI)methods to obtain high estimation accuracy t...For dense time delay estimation(TDE),when multiple time delays are located within a grid interval,it is dificult for the existing sparse Bayesian learning/inference(SBL/SBI)methods to obtain high estimation accuracy to meet the application requirements.To solve this problem,this paper proposes a method named off-grid sparse Bayesian inference-biased total grid(OGSBI-BTG),where a mesh evolution process is conducted to move the total grids iteratively based on the position of the off-grid between two grids.The proposed method updates the off-grid dictionary matrix by further reconstructing an optimum mesh and offsetting the off-grid vector.Experimental results demonstrate that the proposed approach performs better than other state-of-the-art SBI methods and multiple signal classification even when the grid interval is larger than the gap of true time delays.In this paper,the time domain model and frequency domain model of TDE are studied.展开更多
Orthogonal Time Frequency Space(OTFS)modulation has exhibited significant potential to further promote the performance of future wireless communication networks especially in high-mobility scenarios.In practical OTFS ...Orthogonal Time Frequency Space(OTFS)modulation has exhibited significant potential to further promote the performance of future wireless communication networks especially in high-mobility scenarios.In practical OTFS systems,the subcarrier-dependent Doppler shift which is referred to as the Doppler Squint Effect(DSE)plays an important role due to the assistance of time-frequency modulation.Unfortunately,most existing works on OTFS channel estimation ignore DSE,which leads to severe performance degradation.In this letter,OTFS systems taking DSE into consideration are investigated.Inspired by the input-output analysis with DSE and the embedded pilot pattern,the sparse Bayesian learning based parameter estimation scheme is adopted to recover the delay-Doppler channel.Simulation results verify the excellent performance of the proposed off-grid estimation approach considering DSE.展开更多
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...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.展开更多
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 s...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.展开更多
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 pa...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.展开更多
Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific ...Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific basis for governance and prevention efforts.In this paper,we propose an interval prediction method that considers the spatio-temporal characteristic information of PM_(2.5)signals from multiple stations.K-nearest neighbor(KNN)algorithm interpolates the lost signals in the process of collection,transmission,and storage to ensure the continuity of data.Graph generative network(GGN)is used to process time-series meteorological data with complex structures.The graph U-Nets framework is introduced into the GGN model to enhance its controllability to the graph generation process,which is beneficial to improve the efficiency and robustness of the model.In addition,sparse Bayesian regression is incorporated to improve the dimensional disaster defect of traditional kernel density estimation(KDE)interval prediction.With the support of sparse strategy,sparse Bayesian regression kernel density estimation(SBR-KDE)is very efficient in processing high-dimensional large-scale data.The PM_(2.5)data of spring,summer,autumn,and winter from 34 air quality monitoring sites in Beijing verified the accuracy,generalization,and superiority of the proposed model in interval prediction.展开更多
The sparse recovery algorithms formulate synthetic aperture radar （SAR） imaging problem in terms of sparse representation （SR） of a small number of strong scatters＇ positions among a much large number of potentia...The sparse recovery algorithms formulate synthetic aperture radar （SAR） imaging problem in terms of sparse representation （SR） of a small number of strong scatters＇ positions among a much large number of potential scatters＇ positions, and provide an effective approach to improve the SAR image resolution. Based on the attributed scatter center model, several experiments were performed with different practical considerations to evaluate the performance of five representative SR techniques, namely, sparse Bayesian learning （SBL）, fast Bayesian matching pursuit （FBMP）, smoothed 10 norm method （SL0）, sparse reconstruction by separable approximation （SpaRSA）, fast iterative shrinkage-thresholding algorithm （FISTA）, and the parameter settings in five SR algorithms were discussed. In different situations, the performances of these algorithms were also discussed. Through the comparison of MSE and failure rate in each algorithm simulation, FBMP and SpaRSA are found suitable for dealing with problems in the SAR imaging based on attributed scattering center model. Although the SBL is time-consuming, it always get better performance when related to failure rate and high SNR.展开更多
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 thro...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.展开更多
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 sy...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.展开更多
In the engineering field,switching systems have been extensively studied,where sudden changes of parameter value and structural form have a significant impact on the operational performance of the system.Therefore,it ...In the engineering field,switching systems have been extensively studied,where sudden changes of parameter value and structural form have a significant impact on the operational performance of the system.Therefore,it is important to predict the behavior of the switching system,which includes the accurate detection of mutation points and rapid reidentification of the model.However,few efforts have been contributed to accurately locating the mutation points.In this paper,we propose a new measure of mutation detection—the threshold-based switching index by analogy with the Lyapunov exponent.We give the algorithm for selecting the optimal threshold,which greatly reduces the additional data collection and the relative error of mutation detection.In the system identification part,considering the small data amount available and noise in the data,the abrupt sparse Bayesian regression(abrupt-SBR)method is proposed.This method captures the model changes by updating the previously identified model,which requires less data and is more robust to noise than identifying the new model from scratch.With two representative dynamical systems,we illustrate the application and effectiveness of the proposed methods.Our research contributes to the accurate prediction and possible control of switching system behavior.展开更多
Complex industry processes often need multiple operation modes to meet the change of production conditions. In the same mode,there are discrete samples belonging to this mode. Therefore,it is important to consider the...Complex industry processes often need multiple operation modes to meet the change of production conditions. In the same mode,there are discrete samples belonging to this mode. Therefore,it is important to consider the samples which are sparse in the mode.To solve this issue,a new approach called density-based support vector data description( DBSVDD) is proposed. In this article,an algorithm using Gaussian mixture model( GMM) with the DBSVDD technique is proposed for process monitoring. The GMM method is used to obtain the center of each mode and determine the number of the modes. Considering the complexity of the data distribution and discrete samples in monitoring process,the DBSVDD is utilized for process monitoring. Finally,the validity and effectiveness of the DBSVDD method are illustrated through the Tennessee Eastman( TE) process.展开更多
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,e...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.展开更多
When estimating the direction of arrival (DOA) of wideband signals from multiple sources, the performance of sparse Bayesian methods is influenced by the frequency bands occupied by signals in different directions. Th...When estimating the direction of arrival (DOA) of wideband signals from multiple sources, the performance of sparse Bayesian methods is influenced by the frequency bands occupied by signals in different directions. This is particularly true when multiple signal frequency bands overlap. Message passing algorithms (MPA) with Dirichlet process (DP) prior can be employed in a sparse Bayesian learning (SBL) framework with high precision. However, existing methods suffer from either high complexity or low precision. To address this, we propose a low-complexity DOA estimation algorithm based on a factor graph. This approach introduces two strong constraints via a stretching transformation of the factor graph. The first constraint separates the observation from the DP prior, enabling the application of the unitary approximate message passing (UAMP) algorithm for simplified inference and mitigation of divergence issues. The second constraint compensates for the deviation in estimation angle caused by the grid mismatch problem. Compared to state-of-the-art algorithms, our proposed method offers higher estimation accuracy and lower complexity.展开更多
基金supported by the National Natural Science Foundation of China (62071144)
文摘Most of the existing direction of arrival(DOA)estimation algorithms are applied under the assumption that the array manifold is ideal.In practical engineering applications,the existence of non-ideal conditions such as mutual coupling between array elements,array amplitude and phase errors,and array element position errors leads to defects in the array manifold,which makes the performance of the algorithm decline rapidly or even fail.In order to solve the problem of DOA estimation in the presence of amplitude and phase errors and array element position errors,this paper introduces the first-order Taylor expansion equivalent model of the received signal under the uniform linear array from the Bayesian point of view.In the solution,the amplitude and phase error parameters and the array element position error parameters are regarded as random variables obeying the Gaussian distribution.At the same time,the expectation-maximization algorithm is used to update the probability distribution parameters,and then the two error parameters are solved alternately to obtain more accurate DOA estimation results.Finally,the effectiveness of the proposed algorithm is verified by simulation and experiment.
基金supported by the Natural Science Foundation of Chongqing(No.cstc2019jcyj-msxmX0017)。
文摘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.
基金supported by NSFC projects(61960206005,61803211,61871111,62101275,62171127,61971136,and 62001056)Jiangsu NSF project(BK20200820)+1 种基金Postgraduate Research&Practice Innovation Program of Jiangsu Province(KYCX210106)Research Fund of National Mobile Communications Research Laboratory.
文摘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.
基金supported by the National Natural Science Foundation of China(62071335,61931015,61831009)the Technological Innovation Project of Hubei Province of China(2019AAA061).
文摘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.
基金Project(61171133)supported by the National Natural Science Foundation of ChinaProject(11JJ1010)supported by the Natural Science Fund for Distinguished Young Scholars of Hunan Province,ChinaProject(61101182)supported by the National Natural Science Foundation for Young Scientists of China
文摘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.
基金the National Science Council of the Republic of China under the Contract No.NSC-97-2112-M-006-006.
文摘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 National Natural Science Foundation of China(No.61401145)the Natural Science Foundation of Shanghai(No.19ZR1437600)。
文摘For dense time delay estimation(TDE),when multiple time delays are located within a grid interval,it is dificult for the existing sparse Bayesian learning/inference(SBL/SBI)methods to obtain high estimation accuracy to meet the application requirements.To solve this problem,this paper proposes a method named off-grid sparse Bayesian inference-biased total grid(OGSBI-BTG),where a mesh evolution process is conducted to move the total grids iteratively based on the position of the off-grid between two grids.The proposed method updates the off-grid dictionary matrix by further reconstructing an optimum mesh and offsetting the off-grid vector.Experimental results demonstrate that the proposed approach performs better than other state-of-the-art SBI methods and multiple signal classification even when the grid interval is larger than the gap of true time delays.In this paper,the time domain model and frequency domain model of TDE are studied.
文摘Orthogonal Time Frequency Space(OTFS)modulation has exhibited significant potential to further promote the performance of future wireless communication networks especially in high-mobility scenarios.In practical OTFS systems,the subcarrier-dependent Doppler shift which is referred to as the Doppler Squint Effect(DSE)plays an important role due to the assistance of time-frequency modulation.Unfortunately,most existing works on OTFS channel estimation ignore DSE,which leads to severe performance degradation.In this letter,OTFS systems taking DSE into consideration are investigated.Inspired by the input-output analysis with DSE and the embedded pilot pattern,the sparse Bayesian learning based parameter estimation scheme is adopted to recover the delay-Doppler channel.Simulation results verify the excellent performance of the proposed off-grid estimation approach considering DSE.
基金supported by the National Key R&D Program of China(Grant No.2018YFB1701202)。
文摘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.
基金supported by the National Natural Science Foundation of China(11574120,U1636117)the Open Project Program of the Key Laboratory of Underwater Acoustic Signal Processing,Ministry of Education,China(UASP1503)+1 种基金the Natural Science Foundation of Jiangsu Province of China(BK20161359)Foundation of Key Laboratory of Underwater Acoustic Warfare Technology of China and Qing Lan Project
文摘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.
基金National Natural Sci-ence Foundation of China(NSFC)(61971379)Key Research and Development Program of Zhejiang Province(2020C03100)+2 种基金Leading Innovative and Entrepreneur Team In-troduction Program of Zhejiang(2018R01001)Fundamental Research Funds for the Central Universities(226202200096)Program of Innovation 2030 on Smart Ocean in Zhejiang University(129000*194232201)。
文摘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.
基金Project(2020YFC2008605)supported by the National Key Research and Development Project of ChinaProject(52072412)supported by the National Natural Science Foundation of ChinaProject(2021JJ30359)supported by the Natural Science Foundation of Hunan Province,China。
文摘Urban air pollution has brought great troubles to physical and mental health,economic development,environmental protection,and other aspects.Predicting the changes and trends of air pollution can provide a scientific basis for governance and prevention efforts.In this paper,we propose an interval prediction method that considers the spatio-temporal characteristic information of PM_(2.5)signals from multiple stations.K-nearest neighbor(KNN)algorithm interpolates the lost signals in the process of collection,transmission,and storage to ensure the continuity of data.Graph generative network(GGN)is used to process time-series meteorological data with complex structures.The graph U-Nets framework is introduced into the GGN model to enhance its controllability to the graph generation process,which is beneficial to improve the efficiency and robustness of the model.In addition,sparse Bayesian regression is incorporated to improve the dimensional disaster defect of traditional kernel density estimation(KDE)interval prediction.With the support of sparse strategy,sparse Bayesian regression kernel density estimation(SBR-KDE)is very efficient in processing high-dimensional large-scale data.The PM_(2.5)data of spring,summer,autumn,and winter from 34 air quality monitoring sites in Beijing verified the accuracy,generalization,and superiority of the proposed model in interval prediction.
基金Project(61171133)supported by the National Natural Science Foundation of ChinaProject(11JJ1010)supported by the Natural Science Fund for Distinguished Young Scholars of Hunan Province,ChinaProject(61101182)supported by National Natural Science Foundation for Young Scientists of China
文摘The sparse recovery algorithms formulate synthetic aperture radar （SAR） imaging problem in terms of sparse representation （SR） of a small number of strong scatters＇ positions among a much large number of potential scatters＇ positions, and provide an effective approach to improve the SAR image resolution. Based on the attributed scatter center model, several experiments were performed with different practical considerations to evaluate the performance of five representative SR techniques, namely, sparse Bayesian learning （SBL）, fast Bayesian matching pursuit （FBMP）, smoothed 10 norm method （SL0）, sparse reconstruction by separable approximation （SpaRSA）, fast iterative shrinkage-thresholding algorithm （FISTA）, and the parameter settings in five SR algorithms were discussed. In different situations, the performances of these algorithms were also discussed. Through the comparison of MSE and failure rate in each algorithm simulation, FBMP and SpaRSA are found suitable for dealing with problems in the SAR imaging based on attributed scattering center model. Although the SBL is time-consuming, it always get better performance when related to failure rate and high SNR.
基金funded by the Excellent Youth Science Fund of Heilongjiang Province(Grant No.YQ2022F001).
文摘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.
基金supported by the National Key Research and Development Program of China(2018YFB1701202)the National Natural Science Foundation of China(92167201 and 51975237)the Fundamental Research Funds for the Central Universities,Huazhong University of Science and Technology(2021JYCXJJ028)。
文摘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.
基金the National Natural Science Foundation of China(Grant No.12072261)。
文摘In the engineering field,switching systems have been extensively studied,where sudden changes of parameter value and structural form have a significant impact on the operational performance of the system.Therefore,it is important to predict the behavior of the switching system,which includes the accurate detection of mutation points and rapid reidentification of the model.However,few efforts have been contributed to accurately locating the mutation points.In this paper,we propose a new measure of mutation detection—the threshold-based switching index by analogy with the Lyapunov exponent.We give the algorithm for selecting the optimal threshold,which greatly reduces the additional data collection and the relative error of mutation detection.In the system identification part,considering the small data amount available and noise in the data,the abrupt sparse Bayesian regression(abrupt-SBR)method is proposed.This method captures the model changes by updating the previously identified model,which requires less data and is more robust to noise than identifying the new model from scratch.With two representative dynamical systems,we illustrate the application and effectiveness of the proposed methods.Our research contributes to the accurate prediction and possible control of switching system behavior.
基金National Natural Science Foundation of China(No.61374140)the Youth Foundation of National Natural Science Foundation of China(No.61403072)
文摘Complex industry processes often need multiple operation modes to meet the change of production conditions. In the same mode,there are discrete samples belonging to this mode. Therefore,it is important to consider the samples which are sparse in the mode.To solve this issue,a new approach called density-based support vector data description( DBSVDD) is proposed. In this article,an algorithm using Gaussian mixture model( GMM) with the DBSVDD technique is proposed for process monitoring. The GMM method is used to obtain the center of each mode and determine the number of the modes. Considering the complexity of the data distribution and discrete samples in monitoring process,the DBSVDD is utilized for process monitoring. Finally,the validity and effectiveness of the DBSVDD method are illustrated through the Tennessee Eastman( TE) process.
基金supported by the National Natural Science Foundation of China(Grant No.92167201).
文摘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.
基金supported in part by the National Natural Science Foundation of China(Nos.6202780103 and 62033001)the Innovation Key Project of Guangxi Province(No.AA22068059)+2 种基金the Key Research and Development Program of Guilin(No.2020010332)the Natural Science Foundation of Henan Province(No.222300420504)Academic Degrees and Graduate Education Reform Project of Henan Province(No.2021SJGLX262Y).
文摘When estimating the direction of arrival (DOA) of wideband signals from multiple sources, the performance of sparse Bayesian methods is influenced by the frequency bands occupied by signals in different directions. This is particularly true when multiple signal frequency bands overlap. Message passing algorithms (MPA) with Dirichlet process (DP) prior can be employed in a sparse Bayesian learning (SBL) framework with high precision. However, existing methods suffer from either high complexity or low precision. To address this, we propose a low-complexity DOA estimation algorithm based on a factor graph. This approach introduces two strong constraints via a stretching transformation of the factor graph. The first constraint separates the observation from the DP prior, enabling the application of the unitary approximate message passing (UAMP) algorithm for simplified inference and mitigation of divergence issues. The second constraint compensates for the deviation in estimation angle caused by the grid mismatch problem. Compared to state-of-the-art algorithms, our proposed method offers higher estimation accuracy and lower complexity.
