Yafang Li

Yafang Li

Auto-generated profile, based on publicly available information

Yafang Li

College of Computer Science, Beijing University of Technology, Beijing, China

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
22 November 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
YLYafang Li
Yafang Li
CJCaiyan Jia
Caiyan Jia
XKXiangnan Kong
Xiangnan Kong
LYLiu Yang
Liu Yang
JYJian Yu
Jian Yu
Attributed graphs have attracted much attention in recent years. Different from conventional graphs, attributed graphs involve two different types of heterogeneous information, i.e., structural information, which represents the links between the nodes, and attribute information on each of the nodes. Clustering on attributed graphs usually requires the fusion of both types of information in order to identify meaningful clusters. However, most of existing works implement the combination of these two types of information in a ''global'' manner by treating all nodes equally and learning a global weight for the information fusion. To address this issue, this paper proposed a novel weighted K-means algorithm with ''local'' learning for attributed graph clustering, called adaptive fusion of structural and attribute information (Adapt-SA) and analyzed the convergence property of the algorithm. The key advantage of this model is to automatically balance the structural connections and attribute information of each node to learn a fusion weight, and get densely connected clusters with high attribute semantic similarity. Experimental study of weights on both synthetic and real-world data sets showed that the weights learned by Adapt-SA were reasonable, and they reflected which one of these two types of information was more important to decide the membership of a node. We also compared Adapt-SA with the state-of-the-art algorithms on the real-world networks with varieties of characteristics. The experimental results demonstrated that our method outperformed the other algorithms in partitioning an attributed graph into a community structure or other general structures.

17 May 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
BZBaokai Zu
Baokai Zu
YLYafang Li
Yafang Li
JLJianqiang Li
Jianqiang Li
ZHZiping He
Ziping He
HWHongyuan Wang
Hongyuan Wang
PWPANPAN WU
PANPAN WU
Hyperspectral image (HSI) classification attempts to classify each pixel, which is an important means of obtaining land–cover knowledge. Hyperspectral images are cubic data with spectral–spatial knowledge and can generally be considered as sequential data alongside spectral dimension. Unlike convolutional neural networks (CNNs), which mainly focus on local relationship models in images, transformers have been shown to be a powerful structure for qualifying sequence data. However, it lacks the excellent ability of CNNs in establishing local relationships in images and cannot perform good generalization in case of insufficient data. In addition, the gradient disappearance problem hinders the convergence stability of deep learning networks as the layers get deeper. To address these problems, we propose a Cascaded Convolution-based Transformer with Densely Connected Mechanism (CDCformer) for hyperspectral image classification. First, we propose a cascaded convolution feature tokenization to extract spectral–spatial information, which will introduce some inductive bias properties of CNN into the transformer. In addition, we design a simple and effective densely connected transformer to enhance feature propagation and transfer memorable information from shallow to deep layers. It efficiently improves the performance of the transformer and extracts more discriminative spectral–spatial features from the HSI. Extensive experimental evaluation of three public hyperspectral data sets shows that CDCformer achieves competitive classification results.

1 May 2018
Verified
Conference Paper
Closed access
FHFu-Jen Hsu
Fu-Jen Hsu
CYCheng-Tyng Yen
Cheng-Tyng Yen
CHChien-Chung Hung
Chien-Chung Hung
CLChwan-Ying Lee
Chwan-Ying Lee
LLLurng-Shehng Lee
Lurng-Shehng Lee
YLYa-Fang Li
Ya-Fang Li
This paper provides a method to match characteristics of SiC MOSFET by a simple SPICE model. Besides, this method not only reaches highly approximate results in an accuracy of characteristics compared to commercial SiC SPICE model but also reduces lots of quantities of parameters from modified BSIM model. This method expresses the 1 st quadrant I D -V DS and I D -V GS curve well by some additional modified equations. Also, the model development of the 3 rd quadrant characteristics, which combines a diode with a JFET model, obtains a good fitting result. Finally, compared to conventional models, the R-square value and normalized RMSD value are significantly improved.

24 January 2019 in Sensors
Verified
Journal Article
Open access
PDF file
BZBaokai Zu
Baokai Zu
Kewen XiaKewen Xia
Kewen Xia
Tiejun LiTiejun Li
Tiejun Li
ZHZiping He
Ziping He
YLYafang Li
Yafang Li
WDWei Du
Wei Du
Hyperspectral Images (HSIs) contain enriched information due to the presence of various bands, which have gained attention for the past few decades. However, explosive growth in HSIs’ scale and dimensions causes “Curse of dimensionality” and “Hughes phenomenon”. Dimensionality reduction has become an important means to overcome the “Curse of dimensionality”. In hyperspectral images, labeled samples are more difficult to collect because they require many labor and material resources. Semi-supervised dimensionality reduction is very important in mining high-dimensional data due to the lack of costly-labeled samples. The promotion of the supervised dimensionality reduction method to the semi-supervised method is mostly done by graph, which is a powerful tool for characterizing data relationships and manifold exploration. To take advantage of the spatial information of data, we put forward a novel graph construction method for semi-supervised learning, called SLIC Superpixel-based l 2 , 1 -norm Robust Principal Component Analysis (SURPCA2,1), which integrates superpixel segmentation method Simple Linear Iterative Clustering (SLIC) into Low-rank Decomposition. First, the SLIC algorithm is adopted to obtain the spatial homogeneous regions of HSI. Then, the l 2 , 1 -norm RPCA is exploited in each superpixel area, which captures the global information of homogeneous regions and preserves spectral subspace segmentation of HSIs very well. Therefore, we have explored the spatial and spectral information of hyperspectral image simultaneously by combining superpixel segmentation with RPCA. Finally, a semi-supervised dimensionality reduction framework based on SURPCA2,1 graph is used for feature extraction task. Extensive experiments on multiple HSIs showed that the proposed spectral-spatial SURPCA2,1 is always comparable to other compared graphs with few labeled samples.

1 January 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
XLXiumin Lin
Xiumin Lin
YLYafang Li
Yafang Li
CJCaiyan Jia
Caiyan Jia
BZBaokai Zu
Baokai Zu
WZWanting Zhu
Wanting Zhu

24 May 2018 in Remote Sensing
Verified
Journal Article
Open access
PDF file
BZBaokai Zu
Baokai Zu
Kewen XiaKewen Xia
Kewen Xia
WDWei Du
Wei Du
YLYafang Li
Yafang Li
AAAhmad Ali
Ahmad Ali
SCSagnik Chakraborty
Sagnik Chakraborty
Classification of Hyperspectral Images (HSIs) has gained attention for the past few decades. In remote sensing image classification, the labeled samples are insufficient or hard to obtain; however, the unlabeled ones are frequently rich and of a vast number. When there are no sufficient labeled samples, overfitting may occur. To resolve the overfitting issue, in this present work, we proposed a novel approach for HSI feature extraction, called robust regularized Block Low-Rank Discriminant Analysis (BLRDA), which is a robust and efficient feature extraction method to improve the HSIs’ classification accuracy with few labeled samples. To reduce the exponentially growing computational complexity of the low-rank method, we divide the entire image into blocks and implement the low-rank representation for each block respectively. Due to the symmetric matrix requirements for the regularized graph of discriminant analysis, the k-nearest neighbor is applied to handle the whole low-rank graph integrally. The low-rank representation and the kNN can maximally capture and preserve the global and local geometry of the data, respectively, and the performance of regularized discriminant analysis feature extraction can be apparently improved. Extensive experiments on multi-class hyperspectral images show that the proposed BLRDA is a very robust and efficient feature extraction method. Even with simple supervised and semi-supervised classifiers (nearest neighbor and SVM) and randomly given parameters, the feature extraction method achieves significant results with few labeled samples, which shows better performance than similar feature extraction methods.