A new parallel expectation-maximization （EM） algorithm is proposed for large databases. The purpose of the algorithm is to accelerate the operation of the EM algorithm. As a well-known algorithm for estimation in ge...A new parallel expectation-maximization （EM） algorithm is proposed for large databases. The purpose of the algorithm is to accelerate the operation of the EM algorithm. As a well-known algorithm for estimation in generic statistical problems, the EM algorithm has been widely used in many domains. But it often requires significant computational resources. So it is needed to develop more elaborate methods to adapt the databases to a large number of records or large dimensionality. The parallel EM algorithm is based on partial Esteps which has the standard convergence guarantee of EM. The algorithm utilizes fully the advantage of parallel computation. It was confirmed that the algorithm obtains about 2.6 speedups in contrast with the standard EM algorithm through its application to large databases. The running time will decrease near linearly when the number of processors increasing.展开更多
The quality of synthetic aperture radar(SAR)image degrades in the case of multiple imaging projection planes(IPPs)and multiple overlapping ship targets,and then the performance of target classification and recognition...The quality of synthetic aperture radar(SAR)image degrades in the case of multiple imaging projection planes(IPPs)and multiple overlapping ship targets,and then the performance of target classification and recognition can be influenced.For addressing this issue,a method for extracting ship targets with overlaps via the expectation maximization(EM)algorithm is pro-posed.First,the scatterers of ship targets are obtained via the target detection technique.Then,the EM algorithm is applied to extract the scatterers of a single ship target with a single IPP.Afterwards,a novel image amplitude estimation approach is pro-posed,with which the radar image of a single target with a sin-gle IPP can be generated.The proposed method can accom-plish IPP selection and targets separation in the image domain,which can improve the image quality and reserve the target information most possibly.Results of simulated and real mea-sured data demonstrate the effectiveness of the proposed method.展开更多
Compositional data, such as relative information, is a crucial aspect of machine learning and other related fields. It is typically recorded as closed data or sums to a constant, like 100%. The statistical linear mode...Compositional data, such as relative information, is a crucial aspect of machine learning and other related fields. It is typically recorded as closed data or sums to a constant, like 100%. The statistical linear model is the most used technique for identifying hidden relationships between underlying random variables of interest. However, data quality is a significant challenge in machine learning, especially when missing data is present. The linear regression model is a commonly used statistical modeling technique used in various applications to find relationships between variables of interest. When estimating linear regression parameters which are useful for things like future prediction and partial effects analysis of independent variables, maximum likelihood estimation (MLE) is the method of choice. However, many datasets contain missing observations, which can lead to costly and time-consuming data recovery. To address this issue, the expectation-maximization (EM) algorithm has been suggested as a solution for situations including missing data. The EM algorithm repeatedly finds the best estimates of parameters in statistical models that depend on variables or data that have not been observed. This is called maximum likelihood or maximum a posteriori (MAP). Using the present estimate as input, the expectation (E) step constructs a log-likelihood function. Finding the parameters that maximize the anticipated log-likelihood, as determined in the E step, is the job of the maximization (M) phase. This study looked at how well the EM algorithm worked on a made-up compositional dataset with missing observations. It used both the robust least square version and ordinary least square regression techniques. The efficacy of the EM algorithm was compared with two alternative imputation techniques, k-Nearest Neighbor (k-NN) and mean imputation (), in terms of Aitchison distances and covariance.展开更多
In this paper,an index modulation(IM)aided uplink orthogonal time frequency space modulation(OTFS)structure for sparse code multiple access(SCMA)is proposed.To be more specific,the information bits are firstly partiti...In this paper,an index modulation(IM)aided uplink orthogonal time frequency space modulation(OTFS)structure for sparse code multiple access(SCMA)is proposed.To be more specific,the information bits are firstly partitioned for transmit antenna(TA)selection and sparse codeword mapping,respectively.Subsequently,the codewords deployed on the 2-dimensional(2D)delay-Doppler(DD)plane are transmitted by the selected TA,and the superimposed signals are jointly detected at the receiver.Furthermore,a low-complexity zero-embedded expectation propagation(ZE-EP)detector is conceived,where the codebooks are extended with zero vectors to reflect the silent indices.The simulation results demonstrate that the proposed IM-OTFS-SCMA system is capable of providing significant performance gain over the OTFS-SCMA counterpart.展开更多
Variable-fidelity(VF)surrogate models have received increasing attention in engineering design optimization as they can approximate expensive high-fidelity(HF)simulations with reduced computational power.A key challen...Variable-fidelity(VF)surrogate models have received increasing attention in engineering design optimization as they can approximate expensive high-fidelity(HF)simulations with reduced computational power.A key challenge to building a VF model is devising an adaptive model updating strategy that jointly selects additional low-fidelity(LF)and/or HF samples.The additional samples must enhance the model accuracy while maximizing the computational efficiency.We propose ISMA-VFEEI,a global optimization framework that integrates an Improved Slime-Mould Algorithm(ISMA)and a Variable-Fidelity Expected Extension Improvement(VFEEI)learning function to construct a VF surrogate model efficiently.First,A cost-aware VFEEI function guides the adaptive LF/HF sampling by explicitly incorporating evaluation cost and existing sample proximity.Second,ISMA is employed to solve the resulting non-convex optimization problem and identify global optimal infill points for model enhancement.The efficacy of ISMA-VFEEI is demonstrated through six numerical benchmarks and one real-world engineering case study.The engineering case study of a high-speed railway Electric Multiple Unit(EMU),the optimization objective of a sanding device attained a minimum value of 1.546 using only 20 HF evaluations,outperforming all the compared methods.展开更多
Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is ...Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.展开更多
In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array ...In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array output and mutual coupling coefficients, we present a novel model of the array output with the unknown mutual coupling coefficients. Based on this model, we use the space alternating generalized expectation-maximization（SAGE） algorithm to jointly estimate the DOA parameters and the mutual coupling coefficients. Unlike many existing counterparts, our method requires neither calibration sources nor initial calibration information. At the same time,our proposed method inherits the characteristics of good convergence and high estimation precision of the SAGE algorithm. By numerical experiments we demonstrate that our proposed method outperforms the existing method for DOA estimation and mutual coupling calibration.展开更多
基金the National Natural Science Foundation of China(79990584)
文摘A new parallel expectation-maximization （EM） algorithm is proposed for large databases. The purpose of the algorithm is to accelerate the operation of the EM algorithm. As a well-known algorithm for estimation in generic statistical problems, the EM algorithm has been widely used in many domains. But it often requires significant computational resources. So it is needed to develop more elaborate methods to adapt the databases to a large number of records or large dimensionality. The parallel EM algorithm is based on partial Esteps which has the standard convergence guarantee of EM. The algorithm utilizes fully the advantage of parallel computation. It was confirmed that the algorithm obtains about 2.6 speedups in contrast with the standard EM algorithm through its application to large databases. The running time will decrease near linearly when the number of processors increasing.
基金This work was supported by the National Science Fund for Distinguished Young Scholars(62325104).
文摘The quality of synthetic aperture radar(SAR)image degrades in the case of multiple imaging projection planes(IPPs)and multiple overlapping ship targets,and then the performance of target classification and recognition can be influenced.For addressing this issue,a method for extracting ship targets with overlaps via the expectation maximization(EM)algorithm is pro-posed.First,the scatterers of ship targets are obtained via the target detection technique.Then,the EM algorithm is applied to extract the scatterers of a single ship target with a single IPP.Afterwards,a novel image amplitude estimation approach is pro-posed,with which the radar image of a single target with a sin-gle IPP can be generated.The proposed method can accom-plish IPP selection and targets separation in the image domain,which can improve the image quality and reserve the target information most possibly.Results of simulated and real mea-sured data demonstrate the effectiveness of the proposed method.
文摘Compositional data, such as relative information, is a crucial aspect of machine learning and other related fields. It is typically recorded as closed data or sums to a constant, like 100%. The statistical linear model is the most used technique for identifying hidden relationships between underlying random variables of interest. However, data quality is a significant challenge in machine learning, especially when missing data is present. The linear regression model is a commonly used statistical modeling technique used in various applications to find relationships between variables of interest. When estimating linear regression parameters which are useful for things like future prediction and partial effects analysis of independent variables, maximum likelihood estimation (MLE) is the method of choice. However, many datasets contain missing observations, which can lead to costly and time-consuming data recovery. To address this issue, the expectation-maximization (EM) algorithm has been suggested as a solution for situations including missing data. The EM algorithm repeatedly finds the best estimates of parameters in statistical models that depend on variables or data that have not been observed. This is called maximum likelihood or maximum a posteriori (MAP). Using the present estimate as input, the expectation (E) step constructs a log-likelihood function. Finding the parameters that maximize the anticipated log-likelihood, as determined in the E step, is the job of the maximization (M) phase. This study looked at how well the EM algorithm worked on a made-up compositional dataset with missing observations. It used both the robust least square version and ordinary least square regression techniques. The efficacy of the EM algorithm was compared with two alternative imputation techniques, k-Nearest Neighbor (k-NN) and mean imputation (), in terms of Aitchison distances and covariance.
基金supported in part by the National Key Research and Development Program of China with Grant number 2021YFB2900502。
文摘In this paper,an index modulation(IM)aided uplink orthogonal time frequency space modulation(OTFS)structure for sparse code multiple access(SCMA)is proposed.To be more specific,the information bits are firstly partitioned for transmit antenna(TA)selection and sparse codeword mapping,respectively.Subsequently,the codewords deployed on the 2-dimensional(2D)delay-Doppler(DD)plane are transmitted by the selected TA,and the superimposed signals are jointly detected at the receiver.Furthermore,a low-complexity zero-embedded expectation propagation(ZE-EP)detector is conceived,where the codebooks are extended with zero vectors to reflect the silent indices.The simulation results demonstrate that the proposed IM-OTFS-SCMA system is capable of providing significant performance gain over the OTFS-SCMA counterpart.
基金funded by National Natural Science Foundation of China(grant No.52405255)Special Program of Huzhou(grant No.2023GZ05)+1 种基金Projects of Huzhou Science and Technology Correspondent(grant No.2023KT76)Guangdong Basic and Applied Basic Research Foundation(grant No.2025A1515010487)。
文摘Variable-fidelity(VF)surrogate models have received increasing attention in engineering design optimization as they can approximate expensive high-fidelity(HF)simulations with reduced computational power.A key challenge to building a VF model is devising an adaptive model updating strategy that jointly selects additional low-fidelity(LF)and/or HF samples.The additional samples must enhance the model accuracy while maximizing the computational efficiency.We propose ISMA-VFEEI,a global optimization framework that integrates an Improved Slime-Mould Algorithm(ISMA)and a Variable-Fidelity Expected Extension Improvement(VFEEI)learning function to construct a VF surrogate model efficiently.First,A cost-aware VFEEI function guides the adaptive LF/HF sampling by explicitly incorporating evaluation cost and existing sample proximity.Second,ISMA is employed to solve the resulting non-convex optimization problem and identify global optimal infill points for model enhancement.The efficacy of ISMA-VFEEI is demonstrated through six numerical benchmarks and one real-world engineering case study.The engineering case study of a high-speed railway Electric Multiple Unit(EMU),the optimization objective of a sanding device attained a minimum value of 1.546 using only 20 HF evaluations,outperforming all the compared methods.
基金the National Natural Science Foundation of China(61771367)the Science and Technology on Communication Networks Laboratory(HHS19641X003).
文摘Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (No. 61302141)
文摘In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array output and mutual coupling coefficients, we present a novel model of the array output with the unknown mutual coupling coefficients. Based on this model, we use the space alternating generalized expectation-maximization（SAGE） algorithm to jointly estimate the DOA parameters and the mutual coupling coefficients. Unlike many existing counterparts, our method requires neither calibration sources nor initial calibration information. At the same time,our proposed method inherits the characteristics of good convergence and high estimation precision of the SAGE algorithm. By numerical experiments we demonstrate that our proposed method outperforms the existing method for DOA estimation and mutual coupling calibration.
