Jun Sun

Jun Sun


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
12 March 2021
Verified
Conference Paper
Closed access
LWLeipu Wang
Leipu Wang
JSJun Sun
Jun Sun
JSJingming Sun
Jingming Sun
JYJunpeng Yu
Junpeng Yu
In radar automatic target recognition, high resolution range profile (HRRP) can promise satisfactory performance by deep learning when the training samples are affluent. Actually, it is difficult to acquire HRRP samples in battlefield environment. An approach using generative adversarial network (GAN) to augment HRRP data is proposed to deal with the lack of data. There are four GAN models adopted to explore the effect of data augmentation: deep convolutional GAN (DCGAN), Auxiliary Classifier GAN (ACGAN), Least Squares Conditional GAN (LSCGAN) and Wasserstein Conditional GAN (WCGAN). The experimental results show that ACGAN is more suitable than other models in HRRP data augmentation.

1 August 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
JSJun Sun
Jun Sun
WQWentao Qu
Wentao Qu
With the development of science and technology, more and more data have been produced. For many of these datasets, only some of the data have labels. In order to make full use of the information in these data, it is necessary to classify them. In this paper, we propose a strong sparse quadratic kernel-free least squares semi-supervised support vector machine (SSQLSS3VM), in which we add a ℓ0norm regularization term to make it sparse. An NP-hard problem arises since the proposed model contains the ℓ0 norm and another nonconvex term. One important method for solving the nonconvex problem is the DC (difference of convex function) programming. Therefore, we first approximate the ℓ0 norm by a polyhedral DC function. Moreover, due to the existence of the nonsmooth terms, we use the sGS-ADMM to solve the subproblem. Finally, empirical numerical experiments show the efficiency of the proposed algorithm.

5 February 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
JSJun Sun
Jun Sun
LKLingchen Kong
Lingchen Kong
BQBiao QU
Biao QU
In the past decade, the scientific community has become increasingly interested in the re-identification of people. It is still a challenging problem due to its low-quality images; occlusion between objects; and huge changes in lighting, viewpoint and posture (even for the same person). Therefore, we propose a dictionary learning method that divides the appearance characteristics of pedestrians into a shared part, which comprises the similarity between different pedestrians, and a specific part, which reflects unique identity information. In the process of re-identification, by removing the shared part of a pedestrian’s visual characteristics and considering the unique part of each person, the ambiguity of the pedestrian’s visual characteristics can be reduced. In addition, considering the structural characteristics of the shared dictionary and special dictionary, low-rank, l0 norm and row sparsity constraints instead of their convex-relaxed forms are introduced into the dictionary learning framework to improve its representation and recognition capabilities. Therefore, we adopt the method of alternating directions to solve it. The experimental results of several commonly used datasets show the effectiveness of our proposed method.

1 August 2021 in Mathematical Foundations of Computing
Verified
Journal Article
Closed access
PDF file
NXNana Xu
Nana Xu
JSJun Sun
Jun Sun
Jingjing LiuJingjing Liu
Jingjing Liu
XXXianchao Xiu
Xianchao Xiu
Canonical correlation analysis (CCA) has gained great success for fault detection (FD) in recent years. However, it cannot preserve the prior information of the underlying process. To cope with these difficulties, this paper proposes an improved CCA-based ED scheme using a novel multivariate statistical technique, called sparse collaborative regression (SCR.). The core of the proposed method is to take the prior information as a supervisor, and then integrate it with CCA. Further, the l(2,1)-norm is employed to reduce redundancy and avoid overfitting, which facilitates its interpretability. In order to solve the proposed SCR, an efficient alternating optimization algorithm is developed with convergence analysis. Finally, some experimental studies on a simulated example and the benchmark Tennessee Eastman process are conducted to demonstrate the superiority over the classical CCA in terms of the false alarm rate and fault detection rate. The detection results indicate that the proposed method is promising.

1 January 2017
Verified
Conference Paper
Closed access
CLChunxiao Li
Chunxiao Li
DHDawei He
Dawei He
AZAnran Zhen
Anran Zhen
JSJun Sun
Jun Sun
XHXueLong Hu
XueLong Hu
In vehicular ad-hoc networks(VANETs), road services related messages are propagated by vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communications. So the connectivity of VANETs is one key factor to ensure the successfully message dissemination. However, due to the dynamic changing topology of VANETs, the lifetime of the links between vehicles is short. Therefore, it is necessary to enhance the network connectivity for efficient message dissemination. In this paper, we propose a connectivity probability enhancing scheme by platoons, which also has considered the minimum safety distance between adjacent vehicles. The simulation results indicate the connectivity probability is always higher than those without platoons.

26 August 2020 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
YLye Li
ye Li
JSJun Sun
Jun Sun
BQBiao QU
Biao QU
Nonnegative sparsity-constrained optimization problem arises in many fields, such as the linear compressing sensing problem and the regularized logistic regression cost function. In this paper, we introduce a new stepsize rule and establish a gradient projection algorithm. We also obtain some convergence results under milder conditions.