Adaptive filters utilizing the low-order moments hidden in robust loss functions have achieved desirable performance under Gaussian input and impulsive noises. However, when the input cannot be modeled by Gaussian process and is simultaneously contaminated by outliers, these filters may suffer from misalignment. To this end, applying fractional-order calculus in stochastic gradient descent method, this letter proposes a fractional-order generalized Cauchy kernel loss (FoGCKL) algorithm to model complex α-stable process input. The mean square deviation (MSD) is calculated to evaluate the steady-state performance of FoGCKL. To further avoid steady-state jitters and improve filtering accuracy, an enhanced batch method is constructed in FoGCKL using optimized weighted term, generating another enhanced batch FoGCKL (EB-FoGCKL) algorithm. Simulations on system identification verify the correctness of theoretical analysis and demonstrate the superiorities of FoGCKL and EB-FoGCKL.
Unpaired single-image dehazing has become a challenging research hotspot due to its wide application in modern transportation, remote sensing, and intelligent surveillance, among other applications. Recently, CycleGAN-based approaches have been popularly adopted in single-image dehazing as the foundations of unpaired unsupervised training. However, there are still deficiencies with these approaches, such as obvious artificial recovery traces and the distortion of image processing results. This paper proposes a novel enhanced CycleGAN network with an adaptive dark channel prior for unpaired single-image dehazing. First, a Wave-Vit semantic segmentation model is utilized to achieve the adaption of the dark channel prior (DCP) to accurately recover the transmittance and atmospheric light. Then, the scattering coefficient derived from both physical calculations and random sampling means is utilized to optimize the rehazing process. Bridged by the atmospheric scattering model, the dehazing/rehazing cycle branches are successfully combined to form an enhanced CycleGAN framework. Finally, experiments are conducted on reference/no-reference datasets. The proposed model achieved an SSIM of 94.9% and a PSNR of 26.95 on the SOTS-outdoor dataset and obtained an SSIM of 84.71% and a PSNR of 22.72 on the O-HAZE dataset. The proposed model significantly outperforms typical existing algorithms in both objective quantitative evaluation and subjective visual effect.
A significant challenge faced by wireless sensor networks (WSNs) is how to maintain a high sensing coverage rate with dynamic energy decay. In this study, we investigate methods to extend the duration of high sensing coverage rate in WSNs under limited power supply circumstances. In contrast to the sensing model presented earlier, we consider the relationships between a sensor node’s sensing capacity and the decay of supply energy. Based on the decay of supply energy with time, a dynamic sensing model is established to analyze the sensing ability. Moreover, an adaptive coverage strategy with dynamic energy decay based on the multi-objective dingo algorithm(MODOA) is proposed. And the Pareto multi-objective strategy is integrated to this algorithm to optimize the sensing coverage. The experimental result is point out that during the initial operation, our approach can increase the sensing coverage rate by 4.56% compared to the multi-objective artificial vulture optimization algorithm(MOAVOA) and by 6.84% compared to the multi-objective particle swarm algorithm(MOPSO) and by the 20th week, it increases by 7.46%, 3.71% compared to MOPSO algorithm, MOAVOA algorithm.
The kernel conjugate gradient (KCG) algorithms have been proposed to improve the convergence rate and the filtering accuracy of kernel adaptive filters (KAFs) efficiently. However, sparsification is necessary in the KCG algorithms to curb the growth of network structure for online applications. To this end, a novel online kernel conjugate gradient algorithm under the mean square error criterion is proposed to approximate the kernel matrix in KAFs by combining k-means sampling into the Nystrom method in a fixed-dimensional feature space, namely a Nystrom kernel conjugate gradient algorithm based on k-means sampling (NysKCG-KM). The approximation accuracy of the kernel matrix as well as the filtering performance of NysKCG-KM are therefore guaranteed by k-means sampling. The proposed NysKCG-KM with no requirement of sparsification can achieve dramatically better filtering accuracy than the kernel least mean square with sparsification, and approach the filtering accuracy of the kernel recursive least squares with sparsification. Monte Carlo simulations using both the synthetic and real-world data validate the superiorities of the proposed NysKCG-KM.