Changbin Shao

Dr. Changbin Shao

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
2 January 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
MLMengpan Li
Mengpan Li
WLWenhao Liu
Wenhao Liu
CSChangbin Shao
Changbin Shao
BQBin Qin
Bin Qin
ATAli Tian
Ali Tian
HYHualong Yu
Hualong Yu
With deep-learning-based object detection methods reaching industrial-level performance, underwater object detection has emerged as a significant application. However, it is often challenged by dense small instances and image blurring due to the water medium. In this paper, a Multi-Scale Feature Enhancement(MSFE) method is presented to address the challenges triggered by water bodies. In brief, MSFE attempts to achieve dual multi-scale information integration through the internal structural design of the basic C2F module in the Backbone network and the external global design of the feature pyramid network (FPN). For the internal multi-scale implementation, a LABNK module is constructed to address the vanishing or weakening phenomenon of fine-grained features during feature extraction. Specifically, it adopts a symmetrical structure to collaboratively capture two types of local receptive field information. Furthermore, to enhance the information integration ability between inter-layer features in FPN, a shallow feature branch is injected to supplement detailed features for the subsequent integration of multi-scale features. This operation is mainly supported by the fact that large-sized features from the shallow layer usually carry rich, fine-grained information. Taking the typical YOLOv8n as the benchmark model, extensive experimental comparisons on public underwater datasets (DUO and RUOD) demonstrated the effectiveness of the presented MSFE method. For example, taking the rigorous mAP (50:95) as an evaluation metric, it can achieve an accuracy improvement of about 2.8%.

1 March 2024 in Neural Networks
Verified
Journal Article
Closed access
CSChangbin Shao
Changbin Shao
WLWenbin Li
Wenbin Li
JHJing Huo
Jing Huo
ZFZhenhua Feng
Zhenhua Feng
YGYang Gao
Yang Gao

24 March 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
HCHao Chen
Hao Chen
CSChenhui Sha
Chenhui Sha
MJMingqing Jiao
Mingqing Jiao
CSChangbin Shao
Changbin Shao
SGShang Gao
Shang Gao
BQBin Qin
Bin Qin
In order to continuously adapt to dynamic data distributions, existing incremental and online learning methods adopt bagging or boosting structures, in which some sub-classifiers are abandoned when the data distribution varies significantly in the learning process. As such, these ensemble classifiers may fail to reach the global optimum. Furthermore, the training of static sub-classifiers, which are dropped when concept drift emerges, leads to unnecessary computational costs. To solve these issues, this study proposes a novel training method consisting of a single dynamic classifier—named the dynamic incremental adaptive Takagi–Sugeno–Kang fuzzy classifier (DIA-TSK)—which leverages the superior non-linear modeling capabilities and interpretability of the TSK fuzzy system. DIA-TSK utilizes a multi-dimensional incremental learning strategy that is capable of dynamically learning from new data in real time while maintaining global optimal solutions across various online application scenarios. DIA-TSK incorporates two distinct learning paradigms: online learning (O-DIA-TSK) and batch incremental learning (B-DIA-TSK). These modules can work separately or collaborate synergistically to achieve rapid, precise and resource-efficient incremental learning. With the implementation of O-DIA-TSK, we significantly reduce the computational complexity in incremental processes, effectively addressing real-time learning requirements for high-frequency dynamic data streams. Moreover, the novel incremental update mechanism of O-DIA-TSK dynamically adjusts its parameters to ensure progressive optimization, enhancing both real-time performance and learning accuracy. For large-scale data sets, DIA-TSK evolves into B-DIA-TSK, which implements batch updates for multiple samples based on the Woodbury matrix identity. This extension substantially improves computational efficiency and robustness during incremental learning, making it particularly suitable for high-dimensional and complex data sets. Extensive comparative experiments demonstrate that the DIA-TSK approaches significantly outperform existing incremental learning methods across multiple dynamic data sets, exhibiting notable advantages in terms of computational efficiency, classification accuracy and memory management. In the experimental comparison, O-DIA-TSK and B-DIA-TSK reach significant superiority in classification performance with respect to comparative methods, with up to 33.3% and 55.8% reductions in training time, respectively, demonstrating the advantage of DIA-TSK in classification tasks using dynamic data.

9 December 2024 in Electronics
Verified
Journal Article
Open access
PDF file
CQChen Quan
Chen Quan
CSChangbin Shao
Changbin Shao
ZSZhen Su
Zhen Su
Currently, detectors have made significant progress in inference speed and accuracy. However, these detectors require Non-Maximum Suppression (NMS) during the post-processing stage to eliminate redundant boxes, which limits the optimization of model inference speed. We first analyzed the reason for the dependence on NMS in the post-processing stage. The result showed that a score loss in a one-to-many label assignment leads to the presence of high-quality redundant boxes, making them difficult to remove. To realize end-to-end object detection and simplify the detection pipeline, we propose herein a mixed label assignment (MLA) training method, which uses one-to-many label assignment to provide rich supervision signals, alleviating the performance degradation, and we eliminate the need for NMS in the post-processing stage by using one-to-one label assignment. Additionally, a window feature propagation block (WFPB) is introduced, utilizing the inductive bias of images to enable feature sharing in local regions. Through these methods, we conducted experiments on the VOC and DUO datasets; our end-to-end detector MA-YOLOX achieved 66.0 mAP and 52.6 mAP, respectively, outperforming the YOLOX by 1.7 and 1.6. Additionally, our model performed faster than other real-time detectors without NMS.

22 December 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
CXChaolong Xu
Chaolong Xu
ZXZhibin Xie
Zhibin Xie
PYPeiyu Yan
Peiyu Yan
XSXin Shu
Xin Shu
CSChangbin Shao
Changbin Shao

29 March 2025 in Entropy
Verified
Journal Article
Open access
PDF file
QFQiao Fang
Qiao Fang
CXChen Xiang
Chen Xiang
JDJicong Duan
Jicong Duan
SBSoufiyan Benallal
Soufiyan Benallal
CSChangbin Shao
Changbin Shao
HYHualong Yu
Hualong Yu
With the rapid growth of digital computing, communication, and storage devices applied in various real-world scenarios, more and more data have been collected and stored to drive the development of machine learning techniques. It is also noted that the data that emerge in real-world applications tend to become more complex. In this study, we regard a complex data type, i.e., multi-label data, acquired with a time constraint in a dynamic online scenario. Under such conditions, constructing a learning model has to face two challenges: it requires dynamically adapting the variances in label correlations and imbalanced data distributions and it requires more labeling consumptions. To solve these two issues, we propose a novel online multi-label active learning (OMAL) algorithm that considers simultaneously adopting uncertainty (using the average entropy of prediction probabilities) and diversity (using the average cosine distance between feature vectors) as an active query strategy. Specifically, to focus on label correlations, we use a classifier chain (CC) as the multi-label learning model and design a label co-occurrence ranking strategy to arrange label sequence in CC. To adapt the naturally imbalanced distribution of the multi-label data, we select weight extreme learning machine (WELM) as the basic binary-class classifier in CC. The experimental results on ten benchmark multi-label datasets that were transformed into streams show that our proposed method is superior to several popular static multi-label active learning algorithms in terms of both the Macro-F1 and Micro-F1 metrics, indicating its specifical adaptions in the dynamic data stream environment.