Mutual Information Maximization via Joint Power Allocation in Integrated Sensing and Communications System

In this paper, we focus on the power allocation of Integrated Sensing and Communication(ISAC) with orthogonal frequency division multiplexing(OFDM) waveform. In order to improve the spectrum utilization efficiency in ISAC, we propose a design scheme based on spectrum sharing, that is,to maximize the mutual information(MI) of radar sensing while ensuring certain communication rate and transmission power constraints. In the proposed scheme, three cases are considered for the scattering off the target due to the communication signals,as negligible signal, beneficial signal, and interference signal to radar sensing, respectively, thus requiring three power allocation schemes. However,the corresponding power allocation schemes are nonconvex and their closed-form solutions are unavailable as a consequence. Motivated by this, alternating optimization(AO), sequence convex programming(SCP) and Lagrange multiplier are individually combined for three suboptimal solutions corresponding with three power allocation schemes. By combining the three algorithms, we transform the non-convex problem which is difficult to deal with into a convex problem which is easy to solve and obtain the suboptimal solution of the corresponding optimization problem. Numerical results show that, compared with the allocation results of the existing algorithms, the proposed joint design algorithm significantly improves the radar performance.

Quantized Decoders that Maximize Mutual Information for Polar Codes

In this paper,we innovatively associate the mutual information with the frame error rate(FER)performance and propose novel quantized decoders for polar codes.Based on the optimal quantizer of binary-input discrete memoryless channels(BDMCs),the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information(MMI)between source bits and quantized symbols.The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage.Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error(MMSE)with 4 quantization bits,and yield even better performance than uniform MMI quantized decoders with 5 quantization bits.Furthermore,the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.

Fault monitoring based on mutual information feature engineering modeling in chemical process

A large amount of information is frequently encountered when characterizing the sample model in chemical process.A fault diagnosis method based on dynamic modeling of feature engineering is proposed to effectively remove the nonlinear correlation redundancy of chemical process in this paper.From the whole process point of view,the method makes use of the characteristic of mutual information to select the optimal variable subset.It extracts the correlation among variables in the whitening process without limiting to only linear correlations.Further,PCA(Principal Component Analysis)dimension reduction is used to extract feature subset before fault diagnosis.The application results of the TE(Tennessee Eastman)simulation process show that the dynamic modeling process of MIFE(Mutual Information Feature Engineering)can accurately extract the nonlinear correlation relationship among process variables and can effectively reduce the dimension of feature detection in process monitoring.

New approach to eliminate structural redundancy in case resource pools using α mutual information

Structural redundancy elimination in case resource pools （CRP） is critical for avoiding performance bottlenecks and maintaining robust decision capabilities in cloud computing services. For these purposes, this paper proposes a novel approach to ensure redundancy elimination of a reasoning system in CRP. By using α entropy and mutual information, functional measures to eliminate redundancy of a system are developed with respect to a set of outputs. These measures help to distinguish both the optimal feature and the relations among the nodes in reasoning networks from the redundant ones with the elimination criterion. Based on the optimal feature and its harmonic weight, a model for knowledge reasoning in CRP （CRPKR） is built to complete the task of query matching, and the missing values are estimated with Bayesian networks. Moreover, the robustness of decisions is verified through parameter analyses. This approach is validated by the simulation with benchmark data sets using cloud SQL. Compared with several state-of-the-art techniques, the results show that the proposed approach has a good performance and boosts the robustness of decisions.

A novel SINR and mutual information based radar jamming technique

The improvements of anti-jamming performance of modern radar seeker are great threats to military targets. To protect the target from detection and estimation, the novel signal-to-interference-plus-noise ratio(SINR)-based and mutual information(MI)-based jamming design techniques were proposed. To interfere with the target detection, the jamming was designed to minimize the SINR of the radar seeker. To impair the estimation performance, the mutual information between the radar echo and the random target impulse response was used as the criterion. The spectral of optimal jamming under the two criteria were achieved with the power constraints. Simulation results show the effectiveness of the jamming techniques. SINR and MI of the SINR-based jamming, the MI-based jamming as well as the predefined jamming under the same power constraints were compared. Furthermore, the probability of detection and minimum mean-square error(MMSE) were also utilized to validate the jamming performance. Under the jamming power constraint of 1 W, the relative decrease of the probability of detection using SINR-based optimal jamming is about 47%, and the relative increase of MMSE using MI-based optimal jamming is about 8%. Besides, two useful jamming design principles are concluded which can be used in limited jamming power situations.

Mutual Information-Based Modified Randomized Weights Neural Networks

Randomized weights neural networks have fast learning speed and good generalization performance with one single hidden layer structure. Input weighs of the hidden layer are produced randomly. By employing certain activation function, outputs of the hidden layer are calculated with some randomization. Output weights are computed using pseudo inverse. Mutual information can be used to measure mutual dependence of two variables quantitatively based on the probability theory. In this paper, these hidden layer’s outputs that relate to prediction variable closely are selected with the simple mutual information based feature selection method. These hidden nodes with high mutual information values are maintained as a new hidden layer. Thus, the size of the hidden layer is reduced. The new hidden layer’s output weights are learned with the pseudo inverse method. The proposed method is compared with the original randomized algorithms using concrete compressive strength benchmark dataset.

Case Report: Generalized Mutual Information (GMI) Analysis of Sensory Motor Rhythm in a Subject Affected by Facioscapulohumeral Muscular Dystrophy after Ken Ware Treatment

In this case report we study the dynamics of the SMR band in a subject affected from Facioscapulohumeral Muscular Dystrophy and subjected to Ken Ware Neuro Physics treatment. We use the Generalized Mutual Information (GMI) to analyze in detail the SMR band at rest during the treatment. Brain dynamics responds to a chaotic-deterministic regime with a complex behaviour?that?constantly self-rearranges and self-organizes such dynamics in function of the outside require-ments. We demonstrate that the SMR chaotic dynamics responds directly to such regime and that also decreasing in EEG during muscular activity really increases its ability of self-arrangement and self-organization in brain. The proposed novel method of the GMI is arranged by us so that it may?be used in several cases of clinical interest. In the case of muscular dystrophy here examined,?GMI?enables us to quantify with accuracy the improvement that the subject realizes during such?treatment.

Image Registration Based on Improved Mutual Information with Hybrid Optimizer

An improved image registration method is proposed based on mutual information with hybrid optimizer. Firstly, mutual information measure is combined with morphological gradient information. The essence of the gradient information is that locations with a large gradient magnitude should be aligned, but also the orientation of the gradients at those locations should be similar. Secondly, a hybrid optimizer combined PSO with Powell algorithm is proposed to restrain local maxima of mutual information function and improve the registration accuracy to sub-pixel level. Lastly, multiresolution data structure based on Mallat decomposition can not only improve the behavior of registration function, but also improve the speed of the algorithm. Experimental results demonstrate that the new method can yield good registration result, superior to traditional optimizer with respect to smoothness and attraction basin as well as convergence speed.

ANALYSIS OF THE MUTUAL INFORMATION BETWEEN INPUT AND OUTPUT OF A CLASS OF CLOCK-CONTROLLED SEQUENCES

In this paper, the mutual information between clock-controlled input and output sequences is discussed. It is proved that the mutual information is a strictly monotone increasing function of the length of output sequence, and its divergent rate is gaven.

Dimensionality Reduction by Mutual Information for Text Classification

The frame of text classification system was presented. The high dimensionality in feature space for text classification was studied. The mutual information is a widely used information theoretic measure, in a descriptive way, to measure the stochastic dependency of discrete random variables. The measure method was used as a criterion to reduce high dimensionality of feature vectors in text classification on Web. Feature selections or conversions were performed by using maximum mutual information including linear and non-linear feature conversions. Entropy was used and extended to find right features commendably in pattern recognition systems. Favorable foundation would be established for text classification mining.

Multiplex network infomax:Multiplex network embedding via information fusion

For networking of big data applications,an essential issue is how to represent networks in vector space for further mining and analysis tasks,e.g.,node classification,clustering,link prediction,and visualization.Most existing studies on this subject mainly concentrate on monoplex networks considering a single type of relation among nodes.However,numerous real-world networks are naturally composed of multiple layers with different relation types;such a network is called a multiplex network.The majority of existing multiplex network embedding methods either overlook node attributes,resort to node labels for training,or underutilize underlying information shared across multiple layers.In this paper,we propose Multiplex Network Infomax(MNI),an unsupervised embedding framework to represent information of multiple layers into a unified embedding space.To be more specific,we aim to maximize the mutual information between the unified embedding and node embeddings of each layer.On the basis of this framework,we present an unsupervised network embedding method for attributed multiplex networks.Experimental results show that our method achieves competitive performance on not only node-related tasks,such as node classification,clustering,and similarity search,but also a typical edge-related task,i.e.,link prediction,at times even outperforming relevant supervised methods,despite that MNI is fully unsupervised.

基于MI-EMD的激光引信回波信号去噪方法研究

为解决激光引信回波信号容易被噪声污染、信噪比低的问题,提出一种基于互信息经验模态分解的激光引信回波信号去噪方法。该方法融合了互信息相关性和经验模态分解自适应性的特点,对基于雷达原理建立的激光引信回波信号进行经验模态分解,通过互信息及相关阈值区分噪声模态和信号模态,提取出分解信号中的有用信号分量,并将其相关模态进行重构实现噪声的有效去除。实验结果表明:该方法处理后的信噪比提高到了18.8854 dB,均方根误差减小到2.81×10^(-6),且去噪后信号曲线的平滑度较高。该方法能有效滤除激光引信回波信号中的噪声,很好地还原激光引信回波原始信号,保证信号的完整性,为后续激光引信在噪声条件下的精确定距奠定了坚实的基础。

Characteristics analysis of acupuncture electroencephalograph based on mutual information Lempel-Ziv complexity

As a convenient approach to the characterization of cerebral cortex electrical information, electroencephalograph （EEG） has potential clinical application in monitoring the acupuncture effects. In this paper, a method composed of the mutual information method and Lempel-Ziv complexity method （MILZC） is proposed to investigate the effects of acupuncture on the complexity of information exchanges between different brain regions based on EEGs. In the experiments, eight subjects are manually acupunctured at ＇Zusanli＇ acupuncture point （ST-36） with different frequencies （i.e., 50, 100, 150, and 200 times/min） and the EEGs are recorded simultaneously. First, MILZC values are compared in general. Then average brain connections are used to quantify the effectiveness of acupuncture under the above four frequencies. Finally, significance index P values are used to study the spatiality of the acupuncture effect on the brain. Three main findings are obtained： （i） MILZC values increase during the acupuncture; （ii） manual acupunctures （MAs） with 100 times/rain and 150 times/min are more effective than with 50 times/min and 200 times/rain; （iii） contralateral hemisphere activation is more prominent than ipsilateral hemisphere＇s. All these findings suggest that acupuncture contributes to the increase of brain information exchange complexity and the MILZC method can successfully describe these changes.

基于互信息和MiniRocket网络的CFST脱空识别

为提高钢管混凝土(concrete filled steel tube,CFST)脱空检测的效率和精度,本文提出了一种基于快速傅里叶变换(fast fourier transform,FFT)、互信息(mutual information,MI)和MiniRocket神经网络的智能识别方法。首先,采用FFT将待测CFST敲击声波时域信号转换为频域信号;其次,采用MI建立频域信号与脱空状态的相关性,提取相关性最大的前30个特征建立数据集,避免了复杂的数学运算和冗余信息;建立MiniRocket深度学习网络,通过使用更少的参数量和更小的特征尺寸,提高分类的速度和精度。最后,考察了模型的噪音鲁棒性,并与其他算法、特征提取方法和识别方法进行对比。结果表明,在不同脱空深度和脱空宽度下,所提的方法在100次重复试验中获得了100%的平均预测精度。在高信噪比下,该方法受影响较小。此外,与其他算法、特征提取方法和识别方法相比,本方法具有更好的预测性能。因此,所提出的方法在未来实际CFST结构的智能脱空识别中具有较大的应用潜力。

Feature selection algorithm for text classification based on improved mutual information

In order to solve the poor performance in text classification when using traditional formula of mutual information (MI),a feature selection algorithm were proposed based on improved mutual information.The improved mutual information algorithm,which is on the basis of traditional improved mutual information methods that enhance the MI value of negative characteristics and feature's frequency,supports the concept of concentration degree and dispersion degree.In accordance with the concept of concentration degree and dispersion degree,formulas which embody concentration degree and dispersion degree were constructed and the improved mutual information was implemented based on these.In this paper,the feature selection algorithm was applied based on improved mutual information to a text classifier based on Biomimetic Pattern Recognition and it was compared with several other feature selection methods.The experimental results showed that the improved mutual information feature selection method greatly enhances the performance compared with traditional mutual information feature selection methods and the performance is better than that of information gain.Through the introduction of the concept of concentration degree and dispersion degree,the improved mutual information feature selection method greatly improves the performance of text classification system.

Feature selection based on mutual information and redundancy-synergy coefficient

Mutual information is an important information measure for feature subset. In this paper, a hashing mechanism is proposed to calculate the mutual information on the feature subset. Redundancy-synergy coefficient, a novel redundancy and synergy measure of features to express the class feature, is defined by mutual information. The information maximization rule was applied to derive the heuristic feature subset selection method based on mutual information and redundancy-synergy coefficient. Our experiment results showed the good performance of the new feature selection method.

基于NMI-SC的糖尿病混合数据特征选择

针对糖尿病预测精度受高维混合数据影响的问题,提出基于NMI-SC的糖尿病特征选择方法,通过邻域互信息(NMI)计算混合属性特征邻域半径内的联合概率密度,构建相似度矩阵,通过糖尿病特征之间的相似性构建无向图,基于谱聚类(SC)将糖尿病特征切分为多个特征相似组,实现非线性特征间的聚类,根据特征分类重要性选出相似组中的代表特征。并将其与原始特征集在支持向量机分类器上的准确率进行比较,该特征选择方法在删除46个冗余特征后,准确率提高了13.07%。实验结果表明,该方法能有效删除冗余特征,得到糖尿病分类性能优异的特征子集。

Evaluation Criteria Based on Mutual Information for Classifications Including Rejected Class

与用表演措施的常规评估标准不同，信息理论基于在场的标准在机器学习的应用的一个唯一的有益的特征。然而，我们仍然远非正在拥有熵类型标准的深入的理解，说，在与常规基于表演的标准的关系。这份报纸学习通用分类问题，它包括一拒绝，或未知，班。我们在场基本公式和分类基于信息学习的图解的图理论。一个靠近形式的方程为通用分类问题在规范的相互的信息和扩充混乱矩阵之间被导出。敏感方程的三个定理和定理集合为学习在相互的信息和常规表演索引之间的关系被给。我们也与常规标准比较举与相互的信息标准的优点和限制有关的数字例子和几讨论。

Fuzzy entropy design for non convex fuzzy set and application to mutual information

Fuzzy entropy was designed for non convex fuzzy membership function using well known Hamming distance measure.The proposed fuzzy entropy had the same structure as that of convex fuzzy membership case.Design procedure of fuzzy entropy was proposed by considering fuzzy membership through distance measure,and the obtained results contained more flexibility than the general fuzzy membership function.Furthermore,characteristic analyses for non convex function were also illustrated.Analyses on the mutual information were carried out through the proposed fuzzy entropy and similarity measure,which was also dual structure of fuzzy entropy.By the illustrative example,mutual information was discussed.

k-NN Based Bypass Entropy and Mutual Information Estimation for Incremental Remote-Sensing Image Compressibility Evaluation

Incremental image compression techniques using priori information are of significance to deal with the explosively increasing remote-sensing image data. However, the potential benefi ts of priori information are still to be evaluated quantitatively for effi cient compression scheme designing. In this paper, we present a k-nearest neighbor(k-NN) based bypass image entropy estimation scheme, together with the corresponding mutual information estimation method. Firstly, we apply the k-NN entropy estimation theory to split image blocks, describing block-wise intra-frame spatial correlation while avoiding the curse of dimensionality. Secondly, we propose the corresponding mutual information estimator based on feature-based image calibration and straight-forward correlation enhancement. The estimator is designed to evaluate the compression performance gain of using priori information. Numerical results on natural and remote-sensing images show that the proposed scheme obtains an estimation accuracy gain by 10% compared with conventional image entropy estimators. Furthermore, experimental results demonstrate both the effectiveness of the proposed mutual information evaluation scheme, and the quantitative incremental compressibility by using the priori remote-sensing frames.