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.

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.

MUTUAL INFORMATION BASED 3D NON-RIGID REGISTRATION OF CT/MR ABDOMEN IMAGES

A mutual information based 3D non-rigid registration approach was proposed for the registration of deformable CT/MR body abdomen images. The Parzen Windows Density Estimation (PWDE) method is adopted to calculate the mutual information between the two modals of CT and MRI abdomen images. By maximizing MI between the CT and MR volume images, the overlapping part of them reaches the biggest, which means that the two body images of CT and MR matches best to each other. Visible Human Project (VHP) Male abdomen CT and MRI Data are used as experimental data sets. The experimental results indicate that this approach of non-rigid 3D registration of CT/MR body abdominal images can be achieved effectively and automatically, without any prior processing procedures such as segmentation and feature extraction, but has a main drawback of very long computation time.

Modeling of unsupervised knowledge graph of events based on mutual information among neighbor domains and sparse representation

Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,i.e.UKGE-MS.Specifically,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples.Firstly,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature items.Finally,the events knowledge graph is constructed by means of sparse representation and l1 norm.Extensive experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding algorithms.The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.

New bounds on the mutual information for discrete constellations and application to wireless channel estimation

The lack of closed-form expressions of the mutual information for discrete constellations has limited its uses for analyzing reliable communication over wireless fading channels.In order to address this issue,this paper proposes analytically-tractable lower bounds on the mutual information based on Arithmetic-Mean-Geometric-Mean(AMGM)inequality.The new bounds can apply to a wide range of discrete constellations and reveal some insights into the rate behavior at moderate to high Signal-to-Noise Ratio(SNR)values.The usability of the bounds is further demonstrated to approximate the optimum pilot overhead in stationary fading channels.

Deep convolutional adversarial graph autoencoder using positive pointwise mutual information for graph embedding

Graph embedding aims to map the high-dimensional nodes to a low-dimensional space and learns the graph relationship from its latent representations.Most existing graph embedding methods focus on the topological structure of graph data,but ignore the semantic information of graph data,which results in the unsatisfied performance in practical applications.To overcome the problem,this paper proposes a novel deep convolutional adversarial graph autoencoder(GAE)model.To embed the semantic information between nodes in the graph data,the random walk strategy is first used to construct the positive pointwise mutual information(PPMI)matrix,then,graph convolutional net-work(GCN)is employed to encode the PPMI matrix and node content into the latent representation.Finally,the learned latent representation is used to reconstruct the topological structure of the graph data by decoder.Furthermore,the deep convolutional adversarial training algorithm is introduced to make the learned latent representation conform to the prior distribution better.The state-of-the-art experimental results on the graph data validate the effectiveness of the proposed model in the link prediction,node clustering and graph visualization tasks for three standard datasets,Cora,Citeseer and Pubmed.

Double Pruning Structure Design for Deep Stochastic Configuration Networks Based on Mutual Information and Relevance

Deep stochastic configuration networks(DSCNs)produce redundant hidden nodes and connections during training,which complicates their model structures.Aiming at the above problems,this paper proposes a double pruning structure design algorithm for DSCNs based on mutual information and relevance.During the training process,the mutual information algorithm is used to calculate and sort the importance scores of the nodes in each hidden layer in a layer-by-layer manner,the node pruning rate of each layer is set according to the depth of the DSCN at the current time,the nodes that contribute little to the model are deleted,and the network-related parameters are updated.When the model completes the configuration procedure,the correlation evaluation strategy is used to sort the global connection weights and delete insignificance connections;then,the network parameters are updated after pruning is completed.The experimental results show that the proposed structure design method can effectively compress the scale of a DSCN model and improve its modeling speed;the model accuracy loss is small,and fine-tuning for accuracy restoration is not needed.The obtained DSCN model has certain application value in the field of regression analysis.

An automatic extraction method for individual tree crowns based on self-adaptive mutual information and tile computing

Forest data acquisition,which is of crucial importance for modeling global biogeochemical cycles and climate,makes a contribution to building the ecological Digital Earth(DE).Due to the complex calculations and large volumes of data associated with high-resolution images of large areas,accurate and effective extraction of individual tree crowns remains challenging.In this study,two GeoEye-1 panchromatic images of Beihai and Ningbo in China with areas of 5 and 25 km2,respectively,were used as experimental data to establish a novel method for the automatic extraction of individual tree crowns based on a self-adaptive mutual information(SMI)algorithm and tile computing technology(SMI-TCT).To evaluate the performance of the algorithm,four commonly used algorithms were also applied to extract the individual tree crowns.The overall accuracy of the proposed method for the two experimental areas was superior to that of the four other algorithms,with maximum extraction accuracies of 85.7%and 63.8%.Moreover,the results also indicated that the novel method was suitable for individual tree crowns extraction in sizeable areas because of the multithread parallel computing technology.

Monotonicity Evaluation Method of Monitoring Feature Series Based on Ranking Mutual Information

As a prerequisite for effective prognostics, the goodness of the features affects the complexity of the prognostic methods. Comparing to features quality evaluation in diagnostics, features evaluation for prognostics is a new problem. Normally, the monotonic tendency of feature series can be used as the visual representation of equipment damage cumulation so that forecasting its future health states is easy to implement. Through introducing the concept of ranking mutual information in ordinal case, a monotonicity evaluation method of monitoring feature series is proposed. Finally, this method is verified by the simulating feature series and the results verify its effectivity. For the specific application in industry, the evaluation results can be used as the standard for selecting prognostic feature.

Mutual Information Optimization Based Dynamic Log-Polar Image Registration

Log-polar transformation(LPT)is widely used in image registration due to its scale and rotation invariant properties.Through LPT,rotation and scale transformation can be made into translation displacement in log-polar coordinates,and phase correlation technique can be used to get the displacement.In LPT based image registration,constant samples in digitalization processing produce less precise and effective results.Thus,dynamic log-polar transformation(DLPT)is used in this paper.DLPT is a method that generates several sample sets in axes to produce several results and only the effective results are used to get the final results by using statistical approach.Therefore,DLPT can get more precise and effective transformation results than the conventional LPT.Mutual information(MI)is a similarity measure to align two images and has been used in image registration for a long time.An optimal transform for image registration can be obtained by maximizing MI between the two images.Image registration based on MI is robust in noisy,occlusion and illumination changing circumstance.In this paper,we study image registration using MI and DLPT.Experiments with digitalizing images and with real image datasets are performed,and the experimental results show that the combination of MI with DLPT is an effective and precise method for image registration.

A method of waveform design based on mutual information

A novel method called the general waterfilling,which is suitable when clutter is not negligible,is proposed to solve the waveform design problem of broadband radar for the recognition of multiple extended targets.The uncertainty of the target’s radar signatures is decreased via maximizing the mutual information between a random extended target and the received signal.Then,the general water-filling method is employed to the waveform design problem for multiple extended targets identification to increase the separability of multiple targets.Experimental results evaluated the efficiency of the proposed method.Compared to chirp signal and water-filling signal,our method improves the classification rates and even performs better at low signal-to-interference-plus-noise ratio(SINR).

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.

Prediction of Ground Vibration Induced by Rock Blasting Based on Optimized Support Vector Regression Models

Accurately estimating blasting vibration during rock blasting is the foundation of blasting vibration management.In this study,Tuna Swarm Optimization(TSO),Whale Optimization Algorithm(WOA),and Cuckoo Search(CS)were used to optimize two hyperparameters in support vector regression(SVR).Based on these methods,three hybrid models to predict peak particle velocity(PPV)for bench blasting were developed.Eighty-eight samples were collected to establish the PPV database,eight initial blasting parameters were chosen as input parameters for the predictionmodel,and the PPV was the output parameter.As predictive performance evaluation indicators,the coefficient of determination(R2),rootmean square error(RMSE),mean absolute error(MAE),and a10-index were selected.The normalizedmutual information value is then used to evaluate the impact of various input parameters on the PPV prediction outcomes.According to the research findings,TSO,WOA,and CS can all enhance the predictive performance of the SVR model.The TSO-SVR model provides the most accurate predictions.The performances of the optimized hybrid SVR models are superior to the unoptimized traditional prediction model.The maximum charge per delay impacts the PPV prediction value the most.

Side-Channel Leakage Analysis of Inner Product Masking

The Inner Product Masking(IPM)scheme has been shown to provide higher theoretical security guarantees than the BooleanMasking(BM).This scheme aims to increase the algebraic complexity of the coding to achieve a higher level of security.Some previous work unfolds when certain(adversarial and implementation)conditions are met,and we seek to complement these investigations by understanding what happens when these conditions deviate from their expected behaviour.In this paper,we investigate the security characteristics of IPM under different conditions.In adversarial condition,the security properties of first-order IPMs obtained through parametric characterization are preserved in the face of univariate and bivariate attacks.In implementation condition,we construct two new polynomial leakage functions to observe the nonlinear leakage of the IPM and connect the security order amplification to the nonlinear function.We observe that the security of IPMis affected by the degree and the linear component in the leakage function.In addition,the comparison experiments from the coefficients,signal-to-noise ratio(SNR)and the public parameter show that the security properties of the IPM are highly implementation-dependent.

Research on time-frequency cross mutual of motor imagination data based on multichannel EEG signal

At present,multi-channel electroencephalogram(EEG)signal acquisition equipment is used to collect motor imagery EEG data,and there is a problem with selecting multiple acquisition channels.Choosing too many channels will result in a large amount of calculation.Components irrelevant to the task will interfere with the required features,which is not conducive to the real-time processing of EEG data.Using too few channels will result in the loss of useful information and low robustness.A method of selecting data channels for motion imagination is proposed based on the time-frequency cross mutual information(TFCMI).This method determines the required data channels in a targeted manner,uses the common spatial pattern mode for feature extraction,and uses support vector ma-chine(SVM)for feature classification.An experiment is designed to collect motor imagery EEG da-ta with four experimenters and adds brain-computer interface(BCI)Competition IV public motor imagery experimental data to verify the method.The data demonstrates that compared with the meth-od of selecting too many or too few data channels,the time-frequency cross mutual information meth-od using motor imagery can improve the recognition accuracy and reduce the amount of calculation.

AN INFORMATIC APPROACH TO A LONG MEMORY STATIONARY PROCESS

Long memory is an important phenomenon that arises sometimes in the analysis of time series or spatial data.Most of the definitions concerning the long memory of a stationary process are based on the second-order properties of the process.The mutual information between the past and future I_(p−f) of a stationary process represents the information stored in the history of the process which can be used to predict the future.We suggest that a stationary process can be referred to as long memory if its I_(p−f) is infinite.For a stationary process with finite block entropy,I_(p−f) is equal to the excess entropy,which is the summation of redundancies that relate the convergence rate of the conditional(differential)entropy to the entropy rate.Since the definitions of the I_(p−f) and the excess entropy of a stationary process require a very weak moment condition on the distribution of the process,it can be applied to processes whose distributions are without a bounded second moment.A significant property of I_(p−f) is that it is invariant under one-to-one transformation;this enables us to know the I_(p−f) of a stationary process from other processes.For a stationary Gaussian process,the long memory in the sense of mutual information is more strict than that in the sense of covariance.We demonstrate that the I_(p−f) of fractional Gaussian noise is infinite if and only if the Hurst parameter is H∈(1/2,1).

Nonbinary ldpc-coded probabilistic shaping scheme for MIMO systems based on signal space diversity

This paper first describes a binary Low-Density Parity-Check(LDPC)-coded Probabilistic Shaping(PS)scheme for Multiple-Input Multiple-Output(MIMO)systems based on Signal Space Diversity(SSD).Second,a Nonbinary(NB)LDPC-coded PS scheme for MIMO systems based on SSD is proposed.The first scheme can be used to obtain a shaping gain,whereas the second can also realize a coding gain.The theoretical average mutual information of the optimized rotated quadrature amplitude modulation constellations is analyzed and the simulated error per-formance with 22 and 44 MIMO schemes is investigated.The theoretical average mutual information analysis and simulation results show that the proposed NB LDPC-coded PS scheme for MIMO systems based on SSD is reliable and robust,and is therefore suitable for future wireless communication systems.

Automatic Diagnosis of Polycystic Ovarian Syndrome Using Wrapper Methodology with Deep Learning Techniques

One of the significant health issues affecting women that impacts their fertility and results in serious health concerns is Polycystic ovarian syndrome(PCOS).Consequently,timely screening of polycystic ovarian syndrome can help in the process of recovery.Finding a method to aid doctors in this procedure was crucial due to the difficulties in detecting this condition.This research aimed to determine whether it is possible to optimize the detection of PCOS utilizing Deep Learning algorithms and methodologies.Additionally,feature selection methods that produce the most important subset of features can speed up calculation and enhance the effectiveness of classifiers.In this research,the tri-stage wrapper method is used because it reduces the computation time.The proposed study for the Automatic diagnosis of PCOS contains preprocessing,data normalization,feature selection,and classification.A dataset with 39 characteristics,including metabolism,neuroimaging,hormones,and biochemical information for 541 subjects,was employed in this scenario.To start,this research pre-processed the information.Next for feature selection,a tri-stage wrapper method such as Mutual Information,ReliefF,Chi-Square,and Xvariance is used.Then,various classification methods are tested and trained.Deep learning techniques including convolutional neural network(CNN),multi-layer perceptron(MLP),Recurrent neural network(RNN),and Bi long short-term memory(Bi-LSTM)are utilized for categorization.The experimental finding demonstrates that with effective feature extraction process using tri stage wrapper method+CNN delivers the highest precision(97%),high accuracy(98.67%),and recall(89%)when compared with other machine learning algorithms.

The Classification to Stationary Process of Tidal Motion Observed at the Time of Kuroshio’s Meandering

The tide level displays information about the state of the sea current and the tidal motion. The tide level of the southern coast of Japan Island is affected strongly by Kuroshio Current flowing in the western part of North Pacific Ocean. When Kuroshio takes the straight path and flow along the Japan Islands, the tide level increases, and it is calculated from two tide level data observed at Kushimoto and Uragami in the southern part of Kii Peninsula. In contrast, the tide level decreases at the time when Kuroshio leaves from the Japan Islands. In this paper, the hourly tidal data are analyzed using the Autocorrelation Function (ACF) and the Mutual Information (MI) and the phase trajectories at first. We classify the results into 5 types of tidal motion. Each categorized type is investigated and characterized precisely using the mean tide level and the unit root test (ADF test) next. The frequency of the type having unstable tidal motion increases when the Kuroshio Current is non-meandering or in a transition state or the tide level is high, and the type shows a non-stationary process. On the other hand, when the Kuroshio Current meanders, the tidal motion tends to take a periodical and stable state and the motion is a stationary process. Though it is not frequent, we also discover a type of stationary and irregular tidal motion.

Achievable information rate optimization in C‑band optical fber communication system

Optical fber communication networks play an important role in the global telecommunication network.However,nonlinear efects in the optical fber and transceiver noise greatly limit the performance of fber communication systems.In this paper,the product of mutual information(MI)and communication bandwidth is used as the metric of the achievable information rate(AIR).The MI loss caused by the transceiver is also considered in this work,and the bit-wise MI,generalized mutual information(GMI),is used to calculate the AIR.This loss is more signifcant in the use of higher-order modulation formats.The AIR analysis is carried out in the QPSK,16QAM,64QAM and 256QAM modulation formats for the communication systems with diferent communication bandwidths and transmission distances based on the enhanced Gaussian noise(EGN)model.The paper provides suggestions for the selection of the optimal modulation format in diferent transmission scenarios.