30 July 2021 in IEEE Transactions on Medical Imaging
Generative adversarial networks are being extensively studied for low-dose computed tomography denoising. However, due to the similar distribution of noise, artifacts, and high-frequency components of useful tissue images, it is difficult for existing generative adversarial network-based denoising networks to effectively separate the artifacts and noise in the low-dose computed tomography images. In addition, aggressive denoising may damage the edge and structural information of the computed tomography image and make the denoised image too smooth. To solve these problems, we propose a novel denoising network called artifact and detail attention generative adversarial network. First, a multi-channel generator is proposed. Based on the main feature extraction channel, an artifacts and noise attention channel and an edge feature attention channel are added to improve the denoising network’s ability to pay attention to the noise and artifacts features and edge features of the image. Additionally, a new structure called multi-scale Res2Net discriminator is proposed, and the receptive field in the module is expanded by extracting the multi-scale features in the same scale of the image to improve the discriminative ability of discriminator. The loss functions are specially designed for each sub-channel of the denoising network corresponding to its function. Through the cooperation of multiple loss functions, the convergence speed, stability, and denoising effect of the network are accelerated, improved, and guaranteed, respectively. Experimental results show that the proposed denoising network can preserve the important information of the low-dose computed tomography image and achieve better denoising effect when compared to the state-of-the-art algorithms.
3 December 2021 in IEEE Sensors Journal
One of the most important researches in wireless sensor networks is energy saving. The clustering algorithm can efficiently save energy. However, most of the existing clustering algorithms use a fixed cluster head election algorithm and perform each round of clustering, so that unsuitable nodes are continuously elected as cluster heads, leading to rapid exhaustion of node energy and short network life. In order to solve these problems, this paper proposes an Energy-saving Fuzzy Clustering Routing algorithm (EFCR) for wireless sensor networks,which designs two types of clustering, Clustering Type1 and Clustering Type2, and alternately executes them in different rounds according to the threshold. Clustering Type1 considers the parameters that affect the energy consumption of the node: the distance from the node to the base station, the number of neighbor nodes of the node, and the remaining energy of the node as fuzzy inputs, and calculates the fitness of the node as a cluster head through fuzzy inference to avoid the occurrence of unsuitable nodes being successively elected as cluster heads. Clustering Type2 performs data transmission by trusting the last round of cluster heads, which reduces the number of control data packets in each round of clustering and reduces the overall energy consumption of the network. This paper conducted simulations in four different scenarios, compared other clustering algorithms of the same type, and analyzed the remaining energy of the network, the number of surviving nodes, and the life of the network. The results show that EFCR algorithm is better than others.