Lin Zhang

Lin Zhang

Auto-generated profile, based on publicly available information

Lin Zhang

School of Control Science and Engineering, Shandong University, Jinan, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
8 August 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
QZQian Zhang
Qian Zhang
LZLin Zhang
Lin Zhang
RSRan Song
Ran Song
RCRunmin Cong
Runmin Cong
YLYonghuai Liu
Yonghuai Liu
Wei ZhangWei Zhang
Wei Zhang
Multi-view clustering aims to learn discriminative representations from multi-view data. Although existing methods show impressive performance by leveraging contrastive learning to tackle the representation gap between every two views, they share the common limitation of not performing semantic alignment from a global perspective, resulting in the undermining of semantic patterns in multi-view data. This paper presents CSOT, namely Common Semantics via Optimal Transport, to boost contrastive multi-view clustering via semantic learning in a common space that integrates all views. Through optimal transport, the samples in multiple views are mapped to the joint clusters which represent the multi-view semantic patterns in the common space. With the semantic assignment derived from the optimal transport plan, we design a semantic learning module where the soft assignment vector works as a global supervision to enforce the model to learn consistent semantics among all views. Moreover, we propose a semantic-aware re-weighting strategy to treat samples differently according to their semantic significance, which improves the effectiveness of cross-view contrastive representation learning. Extensive experimental results demonstrate that CSOT achieves the state-of-the-art clustering performance.

8 December 2023 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
YWYifan Wang
Yifan Wang
LZLin Zhang
Lin Zhang
RSRan Song
Ran Song
HLHongliang Li
Hongliang Li
Paul L. RosinPaul L. Rosin
Paul L. Rosin
Wei ZhangWei Zhang
Wei Zhang

23 May 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
LZLin Zhang
Lin Zhang
RSRan Song
Ran Song
WTWenhao Tan
Wenhao Tan
LMLin Ma
Lin Ma
Wei ZhangWei Zhang
Wei Zhang
Graph Neural Networks (GNNs) have gained much more attention in the representation learning for the graph-structured data. However, the labels are always limited in the graph, which easily leads to the overfitting problem and causes the poor performance. To solve this problem, we propose a new framework called IGCN, short for Informative Graph Convolutional Network, where the objective of IGCN is designed to obtain the informative embeddings via discarding the task-irrelevant information of the graph data based on the mutual information. As the mutual information for irregular data is intractable to compute, our framework is optimized via a surrogate objective, where two terms are derived to approximate the original objective. For the former term, it demonstrates that the mutual information between the learned embeddings and the ground truth should be high, where we utilize the semi-supervised classification loss and the prototype based supervised contrastive learning loss for optimizing it. For the latter term, it requires that the mutual information between the learned node embeddings and the initial embeddings should be high and we propose to minimize the reconstruction loss between them to achieve the goal of maximizing the latter term from the feature level and the layer level, which contains the graph encoder-decoder module and a novel architecture GCN $_{Info}$ . Moreover, we provably show that the designed GCN $_{Info}$ can better alleviate the information loss and preserve as much useful information of the initial embeddings as possible. Experimental results show that the IGCN outperforms the state-of-the-art methods on 7 popular datasets.

30 April 2024 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
LZLin Zhang
Lin Zhang
YWYifan Wang
Yifan Wang
RSRan Song
Ran Song
MZMingxin Zhang
Mingxin Zhang
XLXiaolei Li
Xiaolei Li
Wei ZhangWei Zhang
Wei Zhang
Recently, the source-free domain adaptation (SFDA) problem has attracted much attention, where the pre-trained model for the source domain is adapted to the target domain in the absence of source data. However, due to domain shift, the negative alignment usually exists between samples from the same class, which may lower intra-class feature similarity. To address this issue, we present a self-supervised representation learning strategy for SFDA, named as neighborhood-aware mutual information (NAMI), which maximizes the mutual information (MI) between the representations of target samples and their corresponding neighbors. Moreover, we theoretically demonstrate that NAMI can be decomposed into a weighted sum of local MI, which suggests that the weighted terms can better estimate NAMI. To this end, we introduce neighborhood consensus score over the set of weakly and strongly augmented views and point-wise density based on neighborhood, both of which determine the weights of local MI for NAMI by leveraging the neighborhood information of samples. The proposed method can significantly handle domain shift and adaptively reduce the noise in the neighborhood of each target sample. In combination with the consistency loss over views, NAMI leads to consistent improvement over existing state-of-the-art methods on three popular SFDA benchmarks.

3 January 2024 in IEEE Transactions on Cognitive and Developmental Systems
Verified
Journal Article
Closed access
LZLin Zhang
Lin Zhang
RSRan Song
Ran Song
YWYifan Wang
Yifan Wang
QZQian Zhang
Qian Zhang
Wei ZhangWei Zhang
Wei Zhang
Unsupervised person re-identification (re-ID) aims to perform person retrieval in an unsupervised manner across multiple cameras. Most recent works usually adopted contrastive learning with clustering strategy to guide learning process. However, the domain gap between cameras easily causes the high intra-class variance and prohibits an effective contrastive learning. To overcome this problem, we propose dual-graph contrastive learning (Dual-GCL) to fully utilize the structures between the instances as well as the relationship between the instances and the centroids generated by the clustering strategy. Firstly, a dual-graph is constructed by utilizing the affinities of instances in the feature space and the pseudo-label space derived from clustering strategy with the node-to-node contrastive learning. Then, to capture the relations between the dual-graph and the centroids, we perform dual-graph contrastive learning at both the node level and the super-node level. The contrastive learning based on the two levels can encode multi-level structural representations between the instances corresponding to the nodes in dual-graph and align the centroids between different cameras in the shared embedding space. Moreover, a camera-aware augmentation scheme that exploits the semantic relationship is proposed to alleviate the domain discrepancy between cameras. Experimental results demonstrate that our approach outperforms the state-of-the-art methods.

18 December 2025 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
MZMingxin Zhang
Mingxin Zhang
FFFuxiang Feng
Fuxiang Feng
XFXing Fang
Xing Fang
LZLin Zhang
Lin Zhang
YZYoumei Zhang
Youmei Zhang
Wei ZhangWei Zhang
Wei Zhang
Vessel re-identification (ReID) serves as a foundational task for intelligent maritime transportation systems. To enhance maritime surveillance capabilities, this study investigates video-based vessel ReID, a critical yet underexplored task in intelligent transportation systems. The lack of relevant datasets has limited the progress of Video-based vessel ReID research work. We established ViV-ReID, the first publicly available large-scale video-based vessel ReID dataset, comprising 480 vessel identities captured from 20 cross-port camera views (7,165 tracklets and 1.14 million frames), establishing a benchmark for advancing vessel ReID from image to video processing. Videos offer significantly richer information than single-frame images. The dynamic nature of video often leads to fragmented spatio-temporal features causing disrupted contextual understanding, and to address this problem, we further propose a Bidirectional Structural-Aware Spatial-Temporal Graph Network (Bi-SSTN) that explicitly aligns spatio-temporal features using vessel structural priors. Extensive experiments on the ViV-ReID dataset demonstrate that image-based ReID methods often show suboptimal performance when applied to video data. Meanwhile, it is crucial to validate the effectiveness of spatio-temporal information and establish performance benchmarks for different methods. The Bidirectional Structural-Aware Spatial-Temporal Graph Network (Bi-SSTN) significantly outperforms state-of-the-art methods on ViV-ReID, confirming its efficacy in modeling vessel-specific spatio-temporal patterns. Project web page: https://vsislab.github.io/ViV_ReID/.