Wenbin Qian

Dr. Wenbin Qian


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
20 July 2022 in IEEE Geoscience and Remote Sensing Letters
Verified
Journal Article
Closed access
MZMingfeng Zha
Mingfeng Zha
WQWenbin Qian
Wenbin Qian
WYWenji Yang
Wenji Yang
YXYilu Xu
Yilu Xu
With the development of deep learning, synthetic aperture radar (SAR) image ship detection based on the convolutional neural network has made significant progress. However, there are two problems: 1) the false alarm detection rate is high due to complex background and coherent speckle noise interference and 2) for smaller ship targets, missed detection is prone to occur. In this letter, a novel ship detection model based on multifeature transformation and fusion (MFTF-Net) is proposed to address the issues. First, to avoid the randomness of initial point selection and the influence of outlier points, the anchor frame clustering approach based on the $K$ -medians++ algorithm is presented to cluster the object candidate frames. Second, the low-level feature information is passed to the high level by constructing a local enhancement network; then, an improved transformer structure is introduced to replace the last convolutional block of the backbone network to obtain rich contextual information. Finally, a four-scale residual feature fusion network is designed, which fully fuses the object’s detailed and semantic information. In addition, improved convolutional block attention module (CBAM) and squeeze and excitation (SE) attention mechanisms are applied in the lower two layers and upper two layers of the network output to reduce the interference of confusing information, respectively. The experimental results demonstrate that the proposed method is superior to the state-of-the-art 13 baseline models on SAR ship detection dataset (SSDD), high-resolution SAR images dataset (HRSID), and SAR-ship-dataset public datasets in terms of the mean average precision (mAP), recall, accuracy, and $F1$ metrics.

18 July 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
WSWenhao Shu
Wenhao Shu
ZYZhenchao Yan
Zhenchao Yan
JYJianhui Yu
Jianhui Yu
WQWenbin Qian
Wenbin Qian

30 January 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
WQWenbin Qian
Wenbin Qian
YTYanqiang Tu
Yanqiang Tu
JHJintao Huang
Jintao Huang
WSWenhao Shu
Wenhao Shu
YCYiu-ming Cheung
Yiu-ming Cheung
Partial multilabel learning (PML) addresses the issue of noisy supervision, which contains an overcomplete set of candidate labels for each instance with only a valid subset of training data. Using label enhancement techniques, researchers have computed the probability of a label being ground truth. However, enhancing labels in the noisy label space makes it impossible for the existing partial multilabel label enhancement methods to achieve satisfactory results. Besides, few methods simultaneously involve the ambiguity problem, the feature space’s redundancy, and the model’s efficiency in PML. To address these issues, this article presents a novel joint partial multilabel framework using broad learning systems (namely BLS-PML) with three innovative mechanisms: 1) a trustworthy label space is reconstructed through a novel label enhancement method to avoid the bias caused by noisy labels; 2) a low-dimensional feature space is obtained by a confidence-based dimensionality reduction method to reduce the effect of redundancy in the feature space; and 3) a noise-tolerant BLS is proposed by adding a dimensionality reduction layer and a trustworthy label layer to deal with PML problem. We evaluated it on six real-world and seven synthetic datasets, using eight state-of-the-art partial multilabel algorithms as baselines and six evaluation metrics. Out of 144 experimental scenarios, our method significantly outperforms the baselines by about 80%, demonstrating its robustness and effectiveness in handling partial multilabel tasks.

5 January 2023 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
JHJintao Huang
Jintao Huang
WQWenbin Qian
Wenbin Qian
CVChi-Man Vong
Chi-Man Vong
Weiping DingWeiping Ding
Weiping Ding
WSWenhao Shu
Wenhao Shu
QHQin Huang
Qin Huang
Multi-label feature selection can effectively resolve the challenges of high or even ultra-high dimensionality in multi-label data. However, most existing multi-label feature selection algorithms can only handle a single data type, assume all labels are equally significant and utilize heuristic search strategies, which results in inefficient and relatively unsatisfactory classification accuracy. In view of the above shortcomings, this paper proposes a new multi-label feature selection algorithm that effectively resolves existing algorithms' issues through three innovative procedures. First, a new similarity relation metric is proposed to deal with hybrid data types effectively. Second, a label enhancement algorithm is designed to enhance and transform the logical labels into a label distribution by fully considering the analytic hierarchy process (AHP) embedded with label correlation, which can automatically identify the significance of different labels. Third, a feature weighting evaluation is redesigned in the feature selection process to obtain the optimal feature subset through feature ranking directly. Under these proposed procedures, multi-label feature selection can effectively utilize the abundant semantic information of the label significance and can significantly improve the operating accuracy and efficiency simultaneously. Comparative experiments are conducted on 20 real multi-label datasets with seven state-of-the-art multi-label feature selection algorithms. Experimental results show that the proposed multi-label feature selection algorithm in this paper is about 5–10% better than the algorithms in 80% of the compared datasets.

29 March 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
JHJintao Huang
Jintao Huang
CVChi-Man Vong
Chi-Man Vong
GWGuangtai Wang
Guangtai Wang
WQWenbin Qian
Wenbin Qian
Yimin ZhouYimin Zhou
Yimin Zhou
CCC.L. Philip Chen
C.L. Philip Chen
Label distribution learning (LDL), leveraging the label significance (LS), is more appropriate for solving label ambiguity problems than multi-label learning (MLL). However, directly obtaining the LS of LDL is extremely expensive and challenging. Thus, label enhancement (LE) algorithms are effectively proposed to acquire inherent LS from MLL for training the LDL models. Nevertheless, most existing LE models will suffer from low accuracy and low efficiency with following issues: i) ignoring mapping relationship between feature and label space, resulting in inaccurate enhanced data; ii) designing independently apart from LDL models, resulting in an inability of unified LE-LDL learning; iii) requiring to optimize numerous parameters iteratively, resulting in worse training efficiency. Consequently, a novel unified LE-LDL learning framework, namely Stacked Graph-regularized Polynomial-based Fuzzy Broad Learning System (SGP-FBLS), is proposed by following three innovations: 1) Polynomial-based fuzzy system is introduced to enhance feature mapping ability while improving learning performance effectively; 2) Graph regularized-based optimization objective function (GP-FBLS) is presented by considering inter-instance correlation and label correlation to mine potential LS, thereby improving the accuracy of subsequent LDL tasks; 3) A weight stacked strategy is innovatively proposed to directly transmit LS and weighted parameters from GP-FBLS to SGP-FBLS without retraining, achieving the most satisfactory performance while significantly improving training efficiency. Finally, comparative studies on 19 practical datasets demonstrate the effectiveness and superiority of proposed methods.

24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
MZMingfeng Zha
Mingfeng Zha
YPYunqiang Pei
Yunqiang Pei
Guoqing WangGuoqing Wang
Guoqing Wang
TLTianyu Li
Tianyu Li
YYYang Yang
Yang Yang
HSHeng Tao Shen
Heng Tao Shen
Mirror detection is of great significance for avoiding false recognition of reflected objects in computer vision tasks. Existing mirror detection frameworks usually follow a supervised setting, which relies heavily on high quality labels and suffers from poor generalization. To resolve this, we instead propose the first weakly-supervised mirror detection framework and also provide the first scribble-based mirror dataset. Specifically, we relabel 10,158 images, most of which have a labeled pixel ratio of less than 0.01 and take only about 8 seconds to label. Considering that the mirror regions usually show great scale variation, and also irregular and occluded, thus leading to issues of incomplete or over detection, we propose a local-global feature enhancement (LGFE) module to fully capture the context and details. Moreover, it is difficult to obtain basic mirror structure using scribble annotation, and the distinction between foreground (mirror) and background (non-mirror) features is not emphasized caused by mirror reflections. Therefore, we propose a foreground-aware mask attention (FAMA), integrating mirror edges and semantic features to complete mirror regions and suppressing the influence of backgrounds. Finally, to improve the robustness of the network, we propose a prototype contrast loss (PCL) to learn more general foreground features across images. Extensive experiments show that our network outperforms relevant state-of-the-art weakly supervised methods, and even some fully supervised methods. The dataset and codes are available at https://github.com/winter-flow/WSMD.