Hierarchical Optimization Method for Federated Learning with Feature Alignment and Decision Fusion

In the realm of data privacy protection,federated learning aims to collaboratively train a global model.However,heterogeneous data between clients presents challenges,often resulting in slow convergence and inadequate accuracy of the global model.Utilizing shared feature representations alongside customized classifiers for individual clients emerges as a promising personalized solution.Nonetheless,previous research has frequently neglected the integration of global knowledge into local representation learning and the synergy between global and local classifiers,thereby limiting model performance.To tackle these issues,this study proposes a hierarchical optimization method for federated learning with feature alignment and the fusion of classification decisions(FedFCD).FedFCD regularizes the relationship between global and local feature representations to achieve alignment and incorporates decision information from the global classifier,facilitating the late fusion of decision outputs from both global and local classifiers.Additionally,FedFCD employs a hierarchical optimization strategy to flexibly optimize model parameters.Through experiments on the Fashion-MNIST,CIFAR-10 and CIFAR-100 datasets,we demonstrate the effectiveness and superiority of FedFCD.For instance,on the CIFAR-100 dataset,FedFCD exhibited a significant improvement in average test accuracy by 6.83%compared to four outstanding personalized federated learning approaches.Furthermore,extended experiments confirm the robustness of FedFCD across various hyperparameter values.

Synergy Decision for Radar and IRST Data Fusion

A new synergy decision method for radar and infrared search and track (IRST) data fusion is proposed, to solve such problems as how to decrease opportunities for radar suffering from being locked on by adverse electronic support measures (ESM), how to retrieve range information of the target during radar off, and how to detect the maneuver of the target. Firstly, polynomials used to predict target motion states are constructed. Secondly, a set of discriminants for detecting target maneuver are established by comparing the predicted values with the observations from IRST. Thirdly, a set of decisions are presented. Lastly, simulation is performed on the given scenario to test the validity of the method.

Optimal decision fusion given sensor rules

When all the rules of sensor decision are known, the optimal distributeddecision fusion, which relies only on the joint conditional probability densities, can be derivedfor very general decision systems. They include those systems with interdependent sensorobservations and any network structure. It is also valid for m-ary Bayesian decision problems andbinary problems under the Neyman-Pearson criterion. Local decision rules of a sensor withcommunication from other sensors that are optimal for the sensor itself are also presented, whichtake the form of a generalized likelihood ratio test. Numerical examples are given to reveal someinteresting phenomena that communication between sensors can improve performance of a senordecision, but cannot guarantee to improve the global fusion performance when sensor rules were givenbefore fusing.

Cloud-Based Diabetes Decision Support System Using Machine Learning Fusion

Diabetes mellitus,generally known as diabetes,is one of the most common diseases worldwide.It is a metabolic disease characterized by insulin deciency,or glucose(blood sugar)levels that exceed 200 mg/dL(11.1 ml/L)for prolonged periods,and may lead to death if left uncontrolled by medication or insulin injections.Diabetes is categorized into two main types—type 1 and type 2—both of which feature glucose levels above“normal,”dened as 140 mg/dL.Diabetes is triggered by malfunction of the pancreas,which releases insulin,a natural hormone responsible for controlling glucose levels in blood cells.Diagnosis and comprehensive analysis of this potentially fatal disease necessitate application of techniques with minimal rates of error.The primary purpose of this research study is to assess the potential role of machine learning in predicting a person’s risk of developing diabetes.Historically,research has supported the use of various machine algorithms,such as naïve Bayes,decision trees,and articial neural networks,for early diagnosis of diabetes.However,to achieve maximum accuracy and minimal error in diagnostic predictions,there remains an immense need for further research and innovation to improve the machine-learning tools and techniques available to healthcare professionals.Therefore,in this paper,we propose a novel cloud-based machine-learning fusion technique involving synthesis of three machine algorithms and use of fuzzy systems for collective generation of highly accurate nal decisions regarding early diagnosis of diabetes.

Efficient fast mode decision using mode complexity for multi-view video coding

The variable block-size motion estimation(ME) and disparity estimation(DE) are adopted in multi-view video coding(MVC) to achieve high coding efficiency. However, much higher computational complexity is also introduced in coding system, which hinders practical application of MVC. An efficient fast mode decision method using mode complexity is proposed to reduce the computational complexity. In the proposed method, mode complexity is firstly computed by using the spatial, temporal and inter-view correlation between the current macroblock(MB) and its neighboring MBs. Based on the observation that direct mode is highly possible to be the optimal mode, mode complexity is always checked in advance whether it is below a predefined threshold for providing an efficient early termination opportunity. If this early termination condition is not met, three mode types for the MBs are classified according to the value of mode complexity, i.e., simple mode, medium mode and complex mode, to speed up the encoding process by reducing the number of the variable block modes required to be checked. Furthermore, for simple and medium mode region, the rate distortion(RD) cost of mode 16×16 in the temporal prediction direction is compared with that of the disparity prediction direction, to determine in advance whether the optimal prediction direction is in the temporal prediction direction or not, for skipping unnecessary disparity estimation. Experimental results show that the proposed method is able to significantly reduce the computational load by 78.79% and the total bit rate by 0.07% on average, while only incurring a negligible loss of PSNR(about 0.04 d B on average), compared with the full mode decision(FMD) in the reference software of MVC.

Scheme of Cooperative Spectrum Sensing Based on Adaptive Decision Fusion Algorithm

Spectrum sensing is one of the core technologies for cognitive radios （CR）, where reliable detection of the signals of primary users （PUs） is precondition for implementing the CR systems. A cooperative spectrum sensing scheme based on an adaptive decision fusion algorithm for spectrum sensing in CR is proposed in this paper. This scheme can estimate the PU prior probability and the miss detection and false alarm probabilities of various secondary users （SU）, and make the local decision with the Chair-Varshney rule so that the decisions fusion can be done for the global decision. Simulation results show that the false alarm and miss detection probabilities resulted from the proposed algorithm are significantly lower than those of the single SU, and the performance of the scheme outperforms that of the cooperative detection by using the conventional decision fusion algorithms.

Dependent Randomization in Parallel Binary Decision Fusion

We consider a parallel decentralized detection system employing a bank of local detectors(LDs)to access a commonly-observed phenomenon.The system makes a binary decision about the phenomenon,accepting one of two hypotheses(H_(0)("absent")or H_(1)("present")).The kth LD uses a local decision rule to compress its local observations yk into a binary local decision uk;uk=0 if the kth LD accepts H_(0)and uk=1 if it accepts H_(1).The kth LD sends its decision uk over a noiseless dedicated channel to a Data Fusion Center(DFC).The DFC combines the local decisions it receives from n LDs(u_(1),u_(2),...,u_(n))into a single binary global decision u_(0)(u_(0)=0 for accepting H_(0)or u_(0)=1 for accepting H_(1)).If each LD uses a single deterministic local decision rule(calculating uk from the local observations yk)and the DFC uses a single deterministic global decision rule(calculating u_(0)from the n local decisions),the team receiver operating characteristic(ROC)curve is in general non-concave.The system's performance under a Neyman-Pearson criterion may then be suboptimal in the sense that a mixed strategy may yield a higher probability of detection when the probability of false alarm is constrained not to exceed a certain value,α>0.Specifically,a"dependent randomization"detection scheme can be applied in certain circumstances to improve the system's performance by making the ROC curve concave.This scheme requires a coordinated and synchronized action between the DFC and the LDs.In this study,we specify when dependent randomization is needed,and discuss the proper response of the detection system if synchronization between the LDs and the DFC is temporarily lost.

Ulva prolifera subpixel mapping with multiple-feature decision fusion

The unavoidable nature of Ulva prolifera mixed pixel in low-resolution remote sensing images would result in rough boundary of U.prolifera patches,omission of tiny patches,and overestimation of coverage area.The decomposition of U.prolifera mixed pixel addresses the issue of coverage area overestimation,and the remaining problems can be alleviated by subpixel mapping(SPM).Due to the drift and dissipation of U.prolifera,a suitable SPM method is the single image-based unsupervised method.However,the method has difficulties in detail reconstruction,insufficient learning of spectral information,and SPM error introduced by abundance deviation.Therefore,we proposed a multiple-feature decision fusion SPM(MFDFSPM)method.It involves three branches to obtain the spatial,abundance,and spectral features of U.prolifera while considers multi-feature information using the fusion strategy.Experiments on the Geostationary Ocean Color Imager images in the Yellow Sea of China indicate that the MFDFSPM overperforms several typical U.prolifera SPM methods in higher accuracy and stronger robustness in both SPM and abundance calculation,which produced subpixel map with more detailed spatial information and less noise.

DECISION FUSION FOR WIRELESS SENSOR NETWORKS UNDER NAKAGAMI FADING CHANNELS

Decision fusion rules for Wireless Sensor Networks (WSNs) under Nakagami fading channels are investigated in this paper. Considering the application limitation of Likelihood Ratio Test fusion rule based on information of Channel Statistics using Series expansion (LRT-CSS),and the detection performance limitation of the Censoring based Mixed Fusion rule (CMF),a new LRT fusion rule based on information of channel statistics has been presented using Laplace approximation (LRT-CSL). Theoretical analysis and simulations show that the proposed fusion rule provides better detection performance than the Censoring based Mixed Fusion (CMF) and LRT-CSS fusion rules. Furthermore,compared with LRT-CSS fusion rule,the proposed fusion rule expands the application range of likelihood ratio test fusion rule.

Multi-view feature fusion for rolling bearing fault diagnosis using random forest and autoencoder

To improve the accuracy and robustness of rolling bearing fault diagnosis under complex conditions, a novel method based on multi-view feature fusion is proposed. Firstly, multi-view features from perspectives of the time domain, frequency domain and time-frequency domain are extracted through the Fourier transform, Hilbert transform and empirical mode decomposition (EMD).Then, the random forest model (RF) is applied to select features which are highly correlated with the bearing operating state. Subsequently, the selected features are fused via the autoencoder (AE) to further reduce the redundancy. Finally, the effectiveness of the fused features is evaluated by the support vector machine (SVM). The experimental results indicate that the proposed method based on the multi-view feature fusion can effectively reflect the difference in the state of the rolling bearing, and improve the accuracy of fault diagnosis.

Feature Fusion Multi-View Hashing Based on Random Kernel Canonical Correlation Analysis

Hashing technology has the advantages of reducing data storage and improving the efficiency of the learning system,making it more and more widely used in image retrieval.Multi-view data describes image information more comprehensively than traditional methods using a single-view.How to use hashing to combine multi-view data for image retrieval is still a challenge.In this paper,a multi-view fusion hashing method based on RKCCA(Random Kernel Canonical Correlation Analysis)is proposed.In order to describe image content more accurately,we use deep learning dense convolutional network feature DenseNet to construct multi-view by combining GIST feature or BoW_SIFT(Bag-of-Words model+SIFT feature)feature.This algorithm uses RKCCA method to fuse multi-view features to construct association features and apply them to image retrieval.The algorithm generates binary hash code with minimal distortion error by designing quantization regularization terms.A large number of experiments on benchmark datasets show that this method is superior to other multi-view hashing methods.

Contrastive Consistency and Attentive Complementarity for Deep Multi-View Subspace Clustering

Deep multi-view subspace clustering (DMVSC) based on self-expression has attracted increasing attention dueto its outstanding performance and nonlinear application. However, most existing methods neglect that viewprivatemeaningless information or noise may interfere with the learning of self-expression, which may lead to thedegeneration of clustering performance. In this paper, we propose a novel framework of Contrastive Consistencyand Attentive Complementarity (CCAC) for DMVsSC. CCAC aligns all the self-expressions of multiple viewsand fuses them based on their discrimination, so that it can effectively explore consistent and complementaryinformation for achieving precise clustering. Specifically, the view-specific self-expression is learned by a selfexpressionlayer embedded into the auto-encoder network for each view. To guarantee consistency across views andreduce the effect of view-private information or noise, we align all the view-specific self-expressions by contrastivelearning. The aligned self-expressions are assigned adaptive weights by channel attention mechanism according totheir discrimination. Then they are fused by convolution kernel to obtain consensus self-expression withmaximumcomplementarity ofmultiple views. Extensive experimental results on four benchmark datasets and one large-scaledataset of the CCAC method outperformother state-of-the-artmethods, demonstrating its clustering effectiveness.

Fault diagnosis method of AC motor rolling bearing based on heterogeneous data fusion of current and infrared image

In order to improve the accuracy of rolling bearing fault diagnosis when the motor is running under non-stationary conditions,an AC motor rolling bearing fault diagnosis method was proposed based on heterogeneous data fusion of current and infrared images.Firstly,VMD was used to decompose the motor current signal and extract the low-frequency component of the bearing fault signal.On this basis,the current signal was transformed into a two-dimensional graph suitable for convolutional neural network,and the data set was classified by convolutional neural network and softmax classifier.Secondly,the infrared image was segmented and the fault features were extracted,so as to calculate the similarity with the infrared image of the fault bearing in the library,and further the sigmod classifier was used to classify the data.Finally,a decision-level fusion method was introduced to fuse the current signal with the infrared image signal diagnosis result according to the weight,and the motor bearing fault diagnosis result was obtained.Through experimental verification,the proposed fault diagnosis method could be used for the fault diagnosis of motor bearing outer ring under the condition of load variation,and the accuracy of fault diagnosis can reach 98.85%.

基于AI的多模态融合感知综合决策系统设计实现

针对传统军事要地安防系统智能化程度较低,各自独立互不关联,缺少顶层数据综合治理等问题,选取外围周界、重要卡口、无人巡更和区域高点四种典型安防业务场景开展建模,通过数据标准化接入、智能研判分析、安防态势显示三个处理环节,构建基于AI的多模态融合感知综合决策系统,实现前端感知多维化、中台研判智能化、后端处置多样化,有效支撑了重要军事目标安全防卫,系统后续也具有良好的可扩展性与可维护性。

Multi-source image fusion algorithm based on fast weighted guided filter

In last few years,guided image fusion algorithms become more and more popular.However,the current algorithms cannot solve the halo artifacts.We propose an image fusion algorithm based on fast weighted guided filter.Firstly,the source images are separated into a series of high and low frequency components.Secondly,three visual features of the source image are extracted to construct a decision graph model.Thirdly,a fast weighted guided filter is raised to optimize the result obtained in the previous step and reduce the time complexity by considering the correlation among neighboring pixels.Finally,the image obtained in the previous step is combined with the weight map to realize the image fusion.The proposed algorithm is applied to multi-focus,visible-infrared and multi-modal image respectively and the final results show that the algorithm effectively solves the halo artifacts of the merged images with higher efficiency,and is better than the traditional method considering subjective visual consequent and objective evaluation.

CNN Based Multi-Object Segmentation and Feature Fusion for Scene Recognition

Latest advancements in vision technology offer an evident impact on multi-object recognition and scene understanding.Such sceneunderstanding task is a demanding part of several technologies,like augmented reality-based scene integration,robotic navigation,autonomous driving,and tourist guide.Incorporating visual information in contextually unified segments,convolution neural networks-based approaches will significantly mitigate the clutter,which is usual in classical frameworks during scene understanding.In this paper,we propose a convolutional neural network(CNN)based segmentation method for the recognition of multiple objects in an image.Initially,after acquisition and preprocessing,the image is segmented by using CNN.Then,CNN features are extracted from these segmented objects,and discrete cosine transform(DCT)and discrete wavelet transform(DWT)features are computed.After the extraction of CNN features and computation of classical machine learning features,fusion is performed using a fusion technique.Then,to select theminimal set of features,genetic algorithm-based feature selection is used.In order to recognize and understand the multi-objects in the scene,a neuro-fuzzy approach is applied.Once objects in the scene are recognized,the relationship between these objects is examined by employing the object-to-object relation approach.Finally,a decision tree is incorporated to assign the relevant labels to the scenes based on recognized objects in the image.The experimental results over complex scene datasets including SUN Red Green Blue-Depth(RGB-D)and Cityscapes’demonstrated a remarkable performance.

A novel fuzzy sensor fusion algorithm

A novel fusion algorithm was given based on fuzzy similarity and fuzzy integral theory. First, it calculated the fuzzy similarity among a certain sensor＇s measurement values and the multiple sensors＇ objective prediction values to determine the importance weight of each sensor and realize multi-sensor data fusion. Then according to the determined importance weight, an intelligent fusion system based on fuzzy integral theory was given, which can solve FEI-DEO and DEI-DEO fusion problems and realize the decision fusion. Simulation results were proved that fuzzy integral algorithm has enhanced the capability of handling the uncertain information and improved the intelligence degrees

Gear Transmission Fault Classification using Deep Neural Networks and Classifier Level Sensor Fusion

Gear transmissions are widely used in industrial drive systems.Fault diagnosis of gear transmissions is important for maintaining the system performance,reducing the maintenance cost,and providing a safe working environment.This paper presents a novel fault diagnosis approach for gear transmissions based on convolutional neural networks(CNNs)and decision-level sensor fusion.In the proposed approach,a CNN is first utilized to classify the faults of a gear transmission based on the acquired signals from each of the sensors.Raw sensory data is sent directly into the CNN models without manual feature extraction.Then,classifier level sensor fusion is carried out to achieve improved classification accuracy by fusing the classification results from the CNN models.Experimental study is conducted,which shows the superior performance of the developed method in the classification of different gear transmission conditions in an automated industrial machine.The presented approach also achieves end-to-end learning that ean be applied to the fault elassification of a gear transmission under various operating eonditions and with signals from different types of sensors.

Fusion of multiagent preference orderings with information on agent's importance being incomplete certain

The problem of fusing multiagent preference orderings, with information on agent＇s importance being incomplete certain with respect to a set of possible courses of action, is described. The approach is developed for dealing with the fusion problem described in the following sections and requires that each agent provides a preference ordering over the different alternatives completely independent of the other agents, and the information on agent＇s importance is incomplete certain. In this approach, the ternary comparison matrix of the alternatives is constructed, the eigenvector associated with the maximum eigenvalue of the ternary comparison matrix is attained so as to normalize priority vector of the alternatives. The interval number of the alternatives is then obtained by solving two sorts of linear programming problems. By comparing the interval numbers of the alternatives, the ranking of alternatives can be generated. Finally, some examples are given to show the feasibility and effectiveness of the method.

A New Deghosting Algorithm with Hypothesis Testing Data Fusion

Eliminating the false intersection (deghosting) is a difficult problem in a passive cross location system. Using a decentralized decision fusion topology, a new deghosting algorithm derived from hypothesis testing theory is developed. It uses the difference between ghosts and true targets in the statistical error, which occurs between their projection angles on a deghosting sensor and is measured from a deghosting sensor, and constructs a corresponding test statistic. Under the Gaussian assumption, ghosts and true targets are decided and discriminated by Chi-square distribution. Simulation results show the feasibility of the algorithm.