Infrared and visible images are a pair of multi-source multi-sensors images. However, infrared images lack structural details and visible images are impressionable to the imaging environment. To fully utilize the meaningful information of infrared and visible images, a practical fusion method, termed as RCGAN, is proposed in this paper. In RCGAN, we introduce a pioneering use of the coupled generative adversarial network to the field of image fusion. Moreover, the simple yet efficient relativistic discriminator is applied to our network. By doing so, the network converges faster. More importantly, different from the previous works in which the label for generator is either infrared image or visible image, we innovatively put forward a strategy to use a pre-fused image as the label. This is a technical innovation, which makes the process of generating fused images no longer out of thin air, but from ‘existence’ to ‘excellent’. Extensive experiments demonstrate the proposed RCGAN can produce a faithful fused image, which can efficiently persevere the rich texture from visible images and thermal radiation information from infrared images. Compared with traditional methods, it successfully avoids complex manual designed fusion rules, and also shows clear advantages over other deep learning based fusion methods.

This paper studies the mean and mean-square behaviors of the M-estimate based normalized subband adaptive filter algorithm (M-NSAF) with robustness against impulsive noise. Based on the contaminated-Gaussian noise model, the stability condition, transient and steady-state results for the algorithm are formulated analytically. The analysis results help us to better understand the M-NSAF performance in impulsive noise. To further obtain fast convergence and low steady-state estimation error, we derive a variable step size (VSS) M-NSAF algorithm. This VSS scheme is also generalized to proportionate M-NSAF variants for sparse systems. Computer simulations on system identification in impulsive noise and acoustic echo cancellation with double-talk are performed to demonstrate our theoretical analysis and the effectiveness of the proposed algorithms.

This work develops robust diffusion recursive least squares algorithms to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. The first algorithm minimizes an exponentially weighted least-squares cost function subject to a time-dependent constraint on the squared norm of the intermediate update at each node. A recursive strategy for computing the constraint is proposed using side information from the neighboring nodes to further improve the robustness. We also analyze the mean-square convergence behavior of the proposed algorithm. The second proposed algorithm is a modification of the first one based on the dichotomous coordinate descent iterations. It has a performance similar to that of the former, however its complexity is significantly lower especially when input regressors of agents have a shift structure and it is well suited to practical implementation. Simulations show the superiority of the proposed algorithms over previously reported techniques in various impulsive noise scenarios.

The partial discharge (PD) classification for electric power equipment based on machine learning algorithms often leads to insufficient generalization ability and low recognition accuracy. To solve the problem, this paper develops an improved Wasserstein generative adversarial network with gradient penalty (WGAN-GP) based data augmentation model. The improved WGAN-GP model can generate data samples to supplement the low-data input set in PD source classification. Firstly, an improved WGAN-GP model with conditional generation is trained and various new data samples are generated. Then the new data samples are utilized to expand the raw data set. Finally, the expanded data set is trained to get a new PD classifier. Experimental results demonstrate the proposed model can generate new high-quality data samples more stably. Moreover, the proposed method can suppress the over-fitting risk caused by low-data or imbalanced data distributions and the classification accuracy is effectively improved.