Jun Wang

Jun Wang

Auto-generated profile, based on publicly available information

Jun Wang

National University of Defense Technology

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
5 May 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CTChang Tang
Chang Tang
ZLZhenglai Li
Zhenglai Li
JWJun Wang
Jun Wang
XLXinwang Liu
Xinwang Liu
WZWei Zhang
Wei Zhang
EZEn Zhu
En Zhu
Multi-view spectral clustering, which exploits the complementary information among graphs of diverse views to obtain superior clustering results, has attracted intensive attention recently. However, most existing multi-view spectral clustering methods obtain the clustering partitions in a two-step scheme, i.e., spectral embedding and subsequent $k$ -means. This two-step scheme inevitably seeks sub-optimal clustering results due to the information loss during the two-steps processes. Besides, existing multi-view spectral clustering methods do not jointly utilize the information of graphs and embedding matrices, which also degrades final clustering results. To solve these issues, we propose a unified one-step multi-view spectral clustering method, which integrates the spectral embedding and $k$ -means into a unified framework to obtain discrete clustering labels with a one-step strategy. Under the observation that the inner product of the embedding matrix is a low-rank approximation of the graph, we combine graphs and embedding matrices of different views to obtain a unified graph. Then, we directly capture the discrete clustering indicator matrix from the unified graph. Furthermore, we design an effective optimization algorithm to solve the resultant problem. Finally, a set of experiments on various datasets are conducted to verify the effectiveness of the proposed method. The demo code of this work is publicly available at r gb]0,0,1 https://github.com/guanyuezhen/UOMvSC .

26 February 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
RGRenxiang Guan
Renxiang Guan
ZLZihao Li
Zihao Li
WTWenxuan Tu
Wenxuan Tu
JWJun Wang
Jun Wang
YLYue Liu
Yue Liu
RFRuyi Feng
Ruyi Feng
High-dimensional and complex spectral structures make the clustering of hyperspectral images (HSI) a challenging task. Subspace clustering is an effective approach for addressing this problem. However, current subspace clustering algorithms are primarily designed for a single view and do not fully exploit the spatial or textural feature information in HSI. In this study, contrastive multi-view subspace clustering of HSI was proposed based on graph convolutional networks. Pixel neighbor textural and spatial-spectral information were sent to construct two graph convolutional subspaces to learn their affinity matrices. To maximize the interaction between different views, a contrastive learning algorithm was introduced to promote the consistency of positive samples and assist the model in extracting robust features. An attention-based fusion module was used to adaptively integrate these affinity matrices, constructing a more discriminative affinity matrix. The model was evaluated using four popular HSI datasets: Indian Pines, Pavia University, Houston, and Xu Zhou. It achieved overall accuracies of 97.61%, 96.69%, 87.21%, and 97.65%, respectively, and significantly outperformed state-of-the-art clustering methods. In conclusion, the proposed model effectively improves the clustering accuracy of HSI. Our implementation is available at https://github.com/GuanRX/CMSCGC.
1

14 March 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
JWJun Wang
Jun Wang
CTChang Tang
Chang Tang
ZWZhiguo Wan
Zhiguo Wan
WZWei Zhang
Wei Zhang
Kun SunKun Sun
Kun Sun
Albert ZomayaAlbert Zomaya
Albert Zomaya
Multiview clustering algorithms have attracted intensive attention and achieved superior performance in various fields recently. Despite the great success of multiview clustering methods in realistic applications, we observe that most of them are difficult to apply to large-scale datasets due to their cubic complexity. Moreover, they usually use a two-stage scheme to obtain the discrete clustering labels, which inevitably causes a suboptimal solution. In light of this, an efficient and effective one-step multiview clustering (E $ ^2 $ OMVC) method is proposed to directly obtain clustering indicators with a small-time burden. Specifically, according to the anchor graphs, the smaller similarity graph of each view is constructed, from which the low-dimensional latent features are generated to form the latent partition representation. By introducing a label discretization mechanism, the binary indicator matrix can be directly obtained from the unified partition representation which is formed by fusing all latent partition representations from different views. In addition, by coupling the fusion of all latent information and the clustering task into a joint framework, the two processes can help each other and obtain a better clustering result. Extensive experimental results demonstrate that the proposed method can achieve comparable or better performance than the state-of-the-art methods. The demo code of this work is publicly available at https://github.com/WangJun2023/EEOMVC.

1 March 2022 in Information Fusion
Verified
Journal Article
Closed access
JWJun Wang
Jun Wang
CTChang Tang
Chang Tang
ZLZhenglai Li
Zhenglai Li
XLXinwang Liu
Xinwang Liu
WZWei Zhang
Wei Zhang
Lizhe WangLizhe Wang
Lizhe Wang

22 August 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
JWJun Wang
Jun Wang
CTChang Tang
Chang Tang
XLXinwang Liu
Xinwang Liu
WZWei Zhang
Wei Zhang
WLWanqing Li
Wanqing Li
Albert ZomayaAlbert Zomaya
Albert Zomaya
Hyperspectral band selection aims to identify an optimal subset of bands for hyperspectral images (HSIs). For most existing clustering-based band selection methods, they directly stretch each band into a single feature vector and employ the pixelwise features to address band redundancy. In this way, they do not take full consideration of the spatial information and deal with the importance of different regions in HSIs, which leads to a nonoptimal selection. To address these issues, a region-aware hierarchical latent feature representation learning-guided clustering (HLFC) method is proposed. Specifically, in order to fully preserve the spatial information of HSIs, the superpixel segmentation algorithm is adopted to segment HSIs into multiple regions first. For each segmented region, the similarity graph is constructed to reflect the bands-wise similarity, and its corresponding Laplacian matrix is generated for learning low-dimensional latent features in a hierarchical way. All latent features are then fused to form a unified feature representation of HSIs. Finally, $k$ -means clustering is utilized on the unified feature representation matrix to generate multiple clusters from which the band with maximum information entropy is selected to form the final subset of bands. Extensive experimental results demonstrate that the proposed clustering method can achieve superior performance than the state-of-the-art representative methods on the band selection. The demo code of this work is publicly available at https://github.com/WangJun2023/HLFC .

16 June 2022 in Neural Networks
Verified
Journal Article
Closed access
JWJun Wang
Jun Wang
CTChang Tang
Chang Tang
XZXiao Zheng
Xiao Zheng
XLXinwang Liu
Xinwang Liu
WZWei Zhang
Wei Zhang
EZEn Zhu
En Zhu