Yunquan Song

Dr. Yunquan Song


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
20 November 2018 in Remote Sensing
Verified
Journal Article
Open access
PDF file
LJLing Jian
Ling Jian
FGFuhao Gao
Fuhao Gao
Peng RenPeng Ren
Peng Ren
YSYunquan Song
Yunquan Song
SLShihua Luo
Shihua Luo
The proliferation of remote sensing imagery motivates a surge of research interest in image processing such as feature extraction and scene recognition, etc. Among them, scene recognition (classification) is a typical learning task that focuses on exploiting annotated images to infer the category of an unlabeled image. Existing scene classification algorithms predominantly focus on static data and are designed to learn discriminant information from clean data. They, however, suffer from two major shortcomings, i.e., the noisy label may negatively affect the learning procedure and learning from scratch may lead to a huge computational burden. Thus, they are not able to handle large-scale remote sensing images, in terms of both recognition accuracy and computational cost. To address this problem, in the paper, we propose a noise-resilient online classification algorithm, which is scalable and robust to noisy labels. Specifically, ramp loss is employed as loss function to alleviate the negative affect of noisy labels, and we iteratively optimize the decision function in Reproducing Kernel Hilbert Space under the framework of Online Gradient Descent (OGD). Experiments on both synthetic and real-world data sets demonstrate that the proposed noise-resilient online classification algorithm is more robust and sparser than state-of-the-art online classification algorithms.

18 August 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
WWWentao Wang
Wentao Wang
JLJiaxuan Liang
Jiaxuan Liang
RLRong Liu
Rong Liu
YSYunquan Song
Yunquan Song
MZMin Zhang
Min Zhang
Variable selection has been a hot topic, with various popular methods including lasso, SCAD, and elastic net. These penalized regression algorithms remain sensitive to noisy data. Furthermore, “concept drift” fundamentally distinguishes streaming data learning from batch learning. This article presents a method for noise-resistant regularization and variable selection in noisy data streams with multicollinearity, dubbed canal-adaptive elastic net, which is similar to elastic net and encourages grouping effects. In comparison to lasso, the canal adaptive elastic net is especially advantageous when the number of predictions (p) is significantly larger than the number of observations (n), and the data are multi-collinear. Numerous simulation experiments have confirmed that canal-adaptive elastic net has higher prediction accuracy than lasso, ridge regression, and elastic net in data with multicollinearity and noise.

27 April 2024 in Spatial Statistics
Verified
Journal Article
Closed access
JLJie Li
Jie Li
YSYunquan Song
Yunquan Song

13 February 2024 in Environmental and Ecological Statistics
Verified
Journal Article
Closed access
PDF file
JYJialei Yu
Jialei Yu
YSYunquan Song
Yunquan Song
JDJiang Du
Jiang Du

3 January 2024 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
LCLongjie Cao
Longjie Cao
YSYunquan Song
Yunquan Song

10 April 2022 in TEST
Verified
Journal Article
Closed access
PDF file
JHJiawei Hou
Jiawei Hou
YSYunquan Song
Yunquan Song