Lei Wang

Dr. Lei Wang


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
8 November 2022 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
LKLin Ke
Lin Ke
MLMin Li
Min Li
LWLei Wang
Lei Wang
SDShaobo Deng
Shaobo Deng
JYJun Ye
Jun Ye
XYXiang Yu
Xiang Yu

10 January 2020 in PLOS ONE
Verified
Journal Article
Open access
PDF file
MLMin Li
Min Li
LWLei Wang
Lei Wang
SDShaobo Deng
Shaobo Deng
CZChunhua Zhou
Chunhua Zhou
Histogram-based thresholding is one of the widely applied techniques for conducting color image segmentation. The key to such techniques is the selection of a set of thresholds that can discriminate objects and background pixels. Many thresholding techniques have been proposed that use the shape information of histograms and identify the optimum thresholds at valleys. In this work, we introduce the novel concept of a hierarchical-histogram, which corresponds to a multigranularity abstraction of the color image. Based on this, we present a new histogram thresholding—Adaptive Hierarchical-Histogram Thresholding (AHHT) algorithm, which can adaptively identify the thresholds from valleys. The experimental results have demonstrated that the AHHT algorithm can obtain better segmentation results compared with the histon-based and the roughness-index-based techniques with drastically reduced time complexity.

14 March 2025 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
MLMin Li
Min Li
CJChen Jin
Chen Jin
YCYuheng Cai
Yuheng Cai
SDShaobo Deng
Shaobo Deng
LWLei Wang
Lei Wang

1 September 2025 in Computational Biology and Chemistry
Verified
Journal Article
Closed access
MLMin Li
Min Li
MJMing Jin
Ming Jin
MLMingzhu Lou
Mingzhu Lou
SDShaobo Deng
Shaobo Deng
LWLei Wang
Lei Wang
HRHua Rao
Hua Rao

1 January 2019 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
LWLei Wang
Lei Wang
MLMin Li
Min Li
JYJun Ye
Jun Ye
XYXiang Yu
Xiang Yu
ZWZiqi Wang
Ziqi Wang
SDShaobo Deng
Shaobo Deng
Dominance-based rough set approach is the extension of classical Pawlak rough set theories and methodologies, in which the information with preference-ordered relation on the domain of attribute value is fully considered. In the dominance-based information system, upper and lower approximations will be changed while the object set varies over time and the approximations need to be updated correspondingly for their variations result in changes of knowledge and rules. Considering that three-way decisions is a special class of general and effective human ways of problem solving and information processing, a new incremental maintenance mechanism using three-way decisions is proposed in this paper, namely, the universe is divided into three pair-wise disjoint subsets firstly, then appropriate strategies are developed and acted on each subsets. Furthermore, the corresponding methods for updating the approximations of upward unions and downward unions of decision classes are analyzed systematically under the variations of object set in the dominance-based information system from the perspective of three-way decisions. Moreover, considering vector representation and calculation is intuitive and concise, two incremental update algorithms of approximations are suggested and implemented in the MATLAB platform. Finally, some tests on UCI data sets are undertaken to verify the effectiveness of the proposed methods. Compared with the non-incremental updating methods, the proposed incremental updating method with three-way decisions generally exhibits a better performance.

1 September 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
WYWen Yang
Wen Yang
LWLei Wang
Lei Wang
CLChao Liu
Chao Liu
QZQiangqiang Zhong
Qiangqiang Zhong
The classical attribute reduction algorithm is not suitable for the neighborhood decision information system of numerical attribute. Since any feature subset in real feature space can be approximated by neighborhood information particles, the concept of knowledge granularity is extended to neighborhood rough set from the perspective of the granularity computation. In this paper, knowledge granularity, attribute importance and heuristic algorithm based on the granularity of knowledge in neighborhood rough set are studied from the point of view of neighborhood relation matrix. The feasibility of heuristic algorithm is analyzed on UCI data sets. Experiments achieve better classification accuracy and lower attribute reduction results than the existing algorithms.