Sun Jun

Prof. Sun Jun

jiangnan university
+1
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2012 in Evolutionary Computation
Verified
Journal Article
Closed access
SJSun Jun
Sun Jun
WFWei Fang
Wei Fang
XWXiaojun Wu
Xiaojun Wu
Vasile PaladeVasile Palade
Vasile Palade
WXWenbo Xu
Wenbo Xu
Quantum-behaved particle swarm optimization (QPSO), motivated by concepts from quantum mechanics and particle swarm optimization (PSO), is a probabilistic optimization algorithm belonging to the bare-bones PSO family. Although it has been shown to perform well in finding the optimal solutions for many optimization problems, there has so far been little analysis on how it works in detail. This paper presents a comprehensive analysis of the QPSO algorithm. In the theoretical analysis, we analyze the behavior of a single particle in QPSO in terms of probability measure. Since the particle's behavior is influenced by the contraction-expansion (CE) coefficient, which is the most important parameter of the algorithm, the goal of the theoretical analysis is to find out the upper bound of the CE coefficient, within which the value of the CE coefficient selected can guarantee the convergence or boundedness of the particle's position. In the experimental analysis, the theoretical results are first validated by stochastic simulations for the particle's behavior. Then, based on the derived upper bound of the CE coefficient, we perform empirical studies on a suite of well-known benchmark functions to show how to control and select the value of the CE coefficient, in order to obtain generally good algorithmic performance in real world applications. Finally, a further performance comparison between QPSO and other variants of PSO on the benchmarks is made to show the efficiency of the QPSO algorithm with the proposed parameter control and selection methods.

30 January 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SJSun Jun
Sun Jun
CLChao Li
Chao Li
XWXiao-Jun Wu
Xiao-Jun Wu
Vasile PaladeVasile Palade
Vasile Palade
WFWei Fang
Wei Fang
In order to effectively identify and classify weld defects of thin-walled metal canisters, a weld defect detection and classification algorithm based on machine vision is proposed in this paper. With the weld defects categorized, a modified background subtraction method based on Gaussian mixture models, is proposed to extract the feature areas of the weld defects. Then, we design an algorithm for weld detection and classification according to the extracted features. Next, by using the weld images sampled by the constructed weld defect detection system on a real-world production line, the parameters of the weld defect classifiers are determined empirically. Experimental results show that the proposed methods can identify and classify the weld defects with more than 95% accuracy rate. Moreover, the weld detection results obtained in the actual production line show that the detection and classification accuracy can reach more than 99%, which means that the system enhanced with our proposed method can meet the requirements for the best real-time and continuous weld defect detection systems available nowadays.

21 January 2022 in Biomedicines
Verified
Journal Article
Open access
PDF file
BABilal Ahmad
Bilal Ahmad
SJSun Jun
Sun Jun
Qi YouQi You
Qi You
Vasile PaladeVasile Palade
Vasile Palade
ZMZhongjie Mao
Zhongjie Mao
Brain tumors are a pernicious cancer with one of the lowest five-year survival rates. Neurologists often use magnetic resonance imaging (MRI) to diagnose the type of brain tumor. Automated computer-assisted tools can help them speed up the diagnosis process and reduce the burden on the health care systems. Recent advances in deep learning for medical imaging have shown remarkable results, especially in the automatic and instant diagnosis of various cancers. However, we need a large amount of data (images) to train the deep learning models in order to obtain good results. Large public datasets are rare in medicine. This paper proposes a framework based on unsupervised deep generative neural networks to solve this limitation. We combine two generative models in the proposed framework: variational autoencoders (VAEs) and generative adversarial networks (GANs). We swap the encoder–decoder network after initially training it on the training set of available MR images. The output of this swapped network is a noise vector that has information of the image manifold, and the cascaded generative adversarial network samples the input from this informative noise vector instead of random Gaussian noise. The proposed method helps the GAN to avoid mode collapse and generate realistic-looking brain tumor magnetic resonance images. These artificially generated images could solve the limitation of small medical datasets up to a reasonable extent and help the deep learning models perform acceptably. We used the ResNet50 as a classifier, and the artificially generated brain tumor images are used to augment the real and available images during the classifier training. We compared the classification results with several existing studies and state-of-the-art machine learning models. Our proposed methodology noticeably achieved better results. By using brain tumor images generated artificially by our proposed method, the classification average accuracy improved from 72.63% to 96.25%. For the most severe class of brain tumor, glioma, we achieved 0.769, 0.837, 0.833, and 0.80 values for recall, specificity, precision, and F1-score, respectively. The proposed generative model framework could be used to generate medical images in any domain, including PET (positron emission tomography) and MRI scans of various parts of the body, and the results show that it could be a useful clinical tool for medical experts.

24 July 2020 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
JLJianjun Liu
Jianjun Liu
ZWZebin Wu
Zebin Wu
LXLiang Xiao
Liang Xiao
SJSun Jun
Sun Jun
HYHong Yan
Hong Yan
Hyperspectral image super-resolution addresses the problem of fusing a low-resolution hyperspectral image (LR-HSI) and a high-resolution multispectral image (HR-MSI) to produce a high-resolution hyperspectral image (HR-HSI). In this paper, we propose a novel fusion approach for hyperspectral image super-resolution by exploiting the specific properties of matrix decomposition, which consists of four main steps. First, an endmember extraction algorithm is used to extract an initial spectral matrix from LR-HSI. Then, with the initial spectral matrix, we estimate the spatial matrix, i.e., the spatial-contextual information, from the degraded observations of HR-HSI. Third, the spatial matrix is further utilized to estimate the spectral matrix from LR-HSI by solving a least squares (LS)-based problem. Finally, the target HR-HSI is constructed by combing the estimated spectral and spatial matrixes. In particular, two models are proposed to estimate the spatial matrix. One is a simple case that involves a LS-based problem, and the other is an elaborate case that consists of two fidelity terms and a spatial regularizer, where the spatial regularizer aiming to restrain the range of solutions is achieved by exploiting the superpixel-level low-rank characteristics of HR-HSI. Experiment results conducted on both synthetic and real data sets demonstrate the effectiveness of the proposed approach as compared to other hyperspectral image super-resolution methods.

15 August 2015 in Machine Learning
Verified
Journal Article
Open access
PDF file
SJSun Jun
Sun Jun
XWXiaojun Wu
Xiaojun Wu
Vasile PaladeVasile Palade
Vasile Palade
WFWei Fang
Wei Fang
YSYuhui Shi
Yuhui Shi
The random drift particle swarm optimization (RDPSO) algorithm is a PSO variant inspired by the free electron model in metal conductors placed in an external electric field. Based on the preliminary work on the RDPSO algorithm, this paper makes systematical analyses and empirical studies of the algorithm. Firstly, the motivation of the RDPSO algorithm is presented and the design of the particle’s velocity equation is described in detail. Secondly, a comprehensive analysis of the algorithm is made in order to gain a deep insight into how the RDPSO algorithm works. It involves a theoretical analysis and the simulation of the stochastic dynamical behavior of a single particle in the RDPSO algorithm. The search behavior of the algorithm itself is also investigated in detail, by analyzing the interaction among the particles. Then, some variants of the RDPSO algorithm are presented by incorporating different random velocity components with different neighborhood topologies. Finally, empirical studies of the RDPSO algorithm are performed by using a set of benchmark functions from the CEC2005 benchmark suite. Based on the theoretical analysis of the particle’s behavior, two methods of controlling the algorithmic parameters are employed, followed by an experimental analysis on how to select the parameter values, in order to obtain a satisfactory overall performance of the RDPSO algorithm and its variants in real-world applications. A further performance comparison between the RDPSO algorithm and other variants of PSO is made to prove the effectiveness of the RDPSO.

19 November 2021 in Diagnostics
Verified
Journal Article
Open access
PDF file
BABilal Ahmad
Bilal Ahmad
SJSun Jun
Sun Jun
Vasile PaladeVasile Palade
Vasile Palade
Qi YouQi You
Qi You
LMLi Mao
Li Mao
MZMao Zhongjie
Mao Zhongjie
Deep learning has gained immense attention from researchers in medicine, especially in medical imaging. The main bottleneck is the unavailability of sufficiently large medical datasets required for the good performance of deep learning models. This paper proposes a new framework consisting of one variational autoencoder (VAE), two generative adversarial networks, and one auxiliary classifier to artificially generate realistic-looking skin lesion images and improve classification performance. We first train the encoder-decoder network to obtain the latent noise vector with the image manifold’s information and let the generative adversarial network sample the input from this informative noise vector in order to generate the skin lesion images. The use of informative noise allows the GAN to avoid mode collapse and creates faster convergence. To improve the diversity in the generated images, we use another GAN with an auxiliary classifier, which samples the noise vector from a heavy-tailed student t-distribution instead of a random noise Gaussian distribution. The proposed framework was named TED-GAN, with T from the t-distribution and ED from the encoder-decoder network which is part of the solution. The proposed framework could be used in a broad range of areas in medical imaging. We used it here to generate skin lesion images and have obtained an improved classification performance on the skin lesion classification task, rising from 66% average accuracy to 92.5%. The results show that TED-GAN has a better impact on the classification task because of its diverse range of generated images due to the use of a heavy-tailed t-distribution.