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.

Robust and Discriminative Feature Learning via Mutual Information Maximization for Object Detection in Aerial Images

Object detection in unmanned aerial vehicle(UAV)aerial images has become increasingly important in military and civil applications.General object detection models are not robust enough against interclass similarity and intraclass variability of small objects,and UAV-specific nuisances such as uncontrolledweather conditions.Unlike previous approaches focusing on high-level semantic information,we report the importance of underlying features to improve detection accuracy and robustness fromthe information-theoretic perspective.Specifically,we propose a robust and discriminative feature learning approach through mutual information maximization(RD-MIM),which can be integrated into numerous object detection methods for aerial images.Firstly,we present the rank sample mining method to reduce underlying feature differences between the natural image domain and the aerial image domain.Then,we design a momentum contrast learning strategy to make object features similar to the same category and dissimilar to different categories.Finally,we construct a transformer-based global attention mechanism to boost object location semantics by leveraging the high interrelation of different receptive fields.We conduct extensive experiments on the VisDrone and Unmanned Aerial Vehicle Benchmark Object Detection and Tracking(UAVDT)datasets to prove the effectiveness of the proposed method.The experimental results show that our approach brings considerable robustness gains to basic detectors and advanced detection methods,achieving relative growth rates of 51.0%and 39.4%in corruption robustness,respectively.Our code is available at https://github.com/cq100/RD-MIM(accessed on 2 August 2024).

Automatic Extraction of Medical Latent Variables from ECG Signals Utilizing a Mutual Information-Based Technique and Capsular Neural Networks for Arrhythmia Detection

From a medical perspective,the 12 leads of the heart in an electrocardiogram(ECG)signal have functional dependencies with each other.Therefore,all these leads report different aspects of an arrhythmia.Their differences lie in the level of highlighting and displaying information about that arrhythmia.For example,although all leads show traces of atrial excitation,this function is more evident in lead II than in any other lead.In this article,a new model was proposed using ECG functional and structural dependencies between heart leads.In the prescreening stage,the ECG signals are segmented from the QRS point so that further analyzes can be performed on these segments in a more detailed manner.The mutual information indices were used to assess the relationship between leads.In order to calculate mutual information,the correlation between the 12 ECG leads has been calculated.The output of this step is a matrix containing all mutual information.Furthermore,to calculate the structural information of ECG signals,a capsule neural network was implemented to aid physicians in the automatic classification of cardiac arrhythmias.The architecture of this capsule neural network has been modified to perform the classification task.In the experimental results section,the proposed model was used to classify arrhythmias in ECG signals from the Chapman dataset.Numerical evaluations showed that this model has a precision of 97.02%,recall of 96.13%,F1-score of 96.57%and accuracy of 97.38%,indicating acceptable performance compared to other state-of-the-art methods.The proposed method shows an average accuracy of 2%superiority over similar works.

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.

A method based on mutual information and gradient information for medical image registration

Mutual information is widely used in medical image registration, because it does not require preprocessing the image. However, the local maximum problem in the registration is insurmountable. We combine mutual information and gradient information to solve this problem and apply it to the non-rigid deformation image registration. To improve the accuracy, we provide some implemental issues, for example, the Powell searching algorithm, gray interpolation and consideration of outlier points. The experimental results show the accuracy of the method and the feasibility in non-rigid medical image registration.

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.

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.

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 modem 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 （Ml）-based jamming design techniques were proposed. To interfere with the target detection, the jamming was designed to minimize the S1NR 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 I W, the relative decrease of the probability of detection using S1NR-based optimal jamming is about 47%, and the relative increase of MMSE using Ml-based optimal jamming is about 8%. Besides, two useful jamming design principles are concluded which can be used in limited jamming power situations.

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.

Registration Method for CT-MR Image Based on Mutual Information

Medical image registration is important in many medical applications. Registration method based on maximization of mutual information of voxel intensities is one of the most popular methods for 3-D multi-modality medical image registration. Generally, the optimization process is easily trapped in local maximum, resulting in wrong registration results. In order to find the correct optimum, a new multi-resolution approach for brain image registration based on normalized mutual information is proposed. In this method, to eliminate the effect of local optima, multi-scale wavelet transformation is adopted to extract the image edge features. Then the feature images are registered, and the result at this level is taken as the initial estimate for the registration of the original images. Three-dimensional volumes are used to test the algorithm. Experimental results show that the registration strategy proposed is a robust and efficient method which can reach sub-voxel accuracy and improve the optimization speed.

Mutual Information and Relative Entropy of Sequential Effect Algebras

In this paper,we introduce and investigate the mutual information and relative entropy on the sequentialeffect algebra,we also give a comparison of these mutual information and relative entropy with the classical ones by thevenn diagrams.Finally,a nice example shows that the entropies of sequential effect algebra depend extremely on theorder of its sequential product.

Mutual Information for Image Registration

Image registration is the overlaying of two images of the same scene taken at different times or by different sensors. It is one of the essential steps in information processing in remote sensing. To attain a highly accurate, reliable and low computation cost in image registration a suitable and similarity metric and reduction in search data and search space is required. In this paper, the author shows that if the right bin size is chosen, mutual information can be more robust than correlation in the registration of multi-temporal images. The author also compares the sensitivity of mutual information and correlation to Gaussian and multiplicative speckle noise. The author investigates automatic subimage selection as a reduction in search data strategy. The author proposes a measure, called alienability, which shows the ability ofa subimage to provide reliable registration. Alternate subimage selection methods such as using gradient, entropy and variance are also investigated. The author furthermore looks into a search space strategy using a gradient approach to maximize mutual information and show our first results.

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.

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 enbance 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 mutu- al 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.

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.

Image Registration Based on Improved Mutual Information with Hybrid Optimizer

An improved image registration method is proposed based on mutual infor- mation with hybrid optimizer. Firstly, mutual information measure is combined with morphological gradient information. The essence of the gradient information is that locations 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, muhlresolution 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.

Medical Image Registration Based on Phase Congruency and Regional Mutual Information

In this paper, a new approach of muhi-modality image registration is represented with not only image intensity, but also features describing image structure. There are two novelties in the proposed method. Firstly, instead of standard mutual information （ MI ） based on joint intensity histogram, regional mutual information （ RMI ） is employed, which allows neighborhood information to be taken into account. Secondly, a new feature images obtained by means of phase congruency are invariants to brightness or contrast changes. By incorporating these features and intensity into RMI, we can combine the aspects of both structural and neighborhood information together, which offers a more robust and a high level of registration accuracy.

Use of Mutual Information Arrays to Predict Coevolving Sites in the Full Length HIV gp120 Protein for Subtypes B and C

It is well established that different sites within a protein evolve at different rates according to their role within the protein; identification of these correlated mutations can aid in tasks such as ab initio protein structure, structure function analysis or sequence alignment. Mutual Information is a standard measure for coevolution between two sites but its application is limited by signal to noise ratio. In this work we report a preliminary study to investigate whether larger sequence sets could circumvent this problem by calculating mutual information arrays for two sets of drug naive sequences from the HIV gpl20 protein for the B and C subtypes. Our results suggest that while the larger sequences sets can improve the signal to noise ratio, the gain is offset by the high mutation rate of the HIV virus which makes it more difficult to achieve consistent alignments. Nevertheless, we were able to predict a number of coevolving sites that were supported by previous experimental studies as well as a region close to the C terminal of the protein that was highly variable in the C subtype but highly conserved in the B subtype.

Measuring causality by taking the directional symbolic mutual information approach

We propose a novel measure to assess causality through the comparison of symbolic mutual information between the future of one random quantity and the past of the other.This provides a new perspective that is different from the conventional conceptions.Based on this point of view,a new causality index is derived that uses the definition of directional symbolic mutual information.This measure presents properties that are different from the time delayed mutual information since the symbolization captures the dynamic features of the analyzed time series.In addition to characterizing the direction and the amplitude of the information flow,it can also detect coupling delays.This method has the property of robustness,conceptual simplicity,and fast computational speed.