Lin Jiang

Dr. Lin Jiang


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 January 2024 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
JLJiaxing Li
Jiaxing Li
WWWai Keung Wong
Wai Keung Wong
LJLin Jiang
Lin Jiang
XFXiaozhao Fang
Xiaozhao Fang
SXShengli Xie
Shengli Xie
YXYong Xu
Yong Xu
Recently, deep hashing-based cross-modal retrieval has attracted much attention of researchers, due to its advantages of fast retrieval efficiency and low storage overhead, etc. However, the existing deep hashing-based cross-modal retrieval methods typically 1) suffer from inadequately capturing the semantic relevance and coexistent information for cross-modal data, which may result in sub-optimal retrieval performance, 2) require a more comprehensive similarity measurement for cross-modal features to ensure high retrieval accuracy, 3) lack of scalability for lightweight deployment framework. To handle the issues mentioned above, we propose a CLIP-based knowledge distillation hashing (CKDH) for cross-modal retrieval, by referring the research trend of combining traditional methods and modern neural architecture to design lightweight networks based on large language models. Specifically, to effectively help capture the semantic relevance and coexistent information, CLIP is fine-tuned to extract visual features, while a graph attention network is used to enhance textual features extracted by bag-of-words model in the teacher model. Then, for better supervising the training of student model, a more comprehensive similarity measurement is introduced to represent distilled knowledge by jointly preserving the log-likelihood, intra and inter modality similarities. Finally, the student model extracts deep features by a lightweight networks, and generates the hash codes under the supervision of the similarity matrix produced by the teacher model. Experimental results on three widely used datasets demonstrate that CKDH can outperform some state-of-the-art methods, by delivering the best result consistently.

31 January 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJiaxing Li
Jiaxing Li
WWWai Keung Wong
Wai Keung Wong
LJLin Jiang
Lin Jiang
KJKaihang Jiang
Kaihang Jiang
XFXiaozhao Fang
Xiaozhao Fang
Jie WenJie Wen
Jie Wen
Cross-modal retrieval is a promising technique nowadays to find semantically similar instances in other modalities while a query instance is given from one modality. However, there still exists many challenges for reducing heterogeneous modality gap by embedding label information to discrete hash codes effectively, solving the binary optimization when generating unified hash codes and reducing the discrepancy of data distribution efficiently during common space learning. In order to overcome the above-mentioned challenges, we propose a Collaboratively Semantic alignment and Metric learning for cross-modal Hashing (CSMH) in this paper. Specifically, by a kernelization operation, CSMH firstly extracts the non-linear data features for each modality, which are projected into a latent subspace to align both marginal and conditional distributions simultaneously. Then, a maximum mean discrepancy-based metric strategy is customized to mitigate the distribution discrepancies among features from different modalities. Finally, semantic information obtained from the label similarity matrix, is further incorporated to embed the latent semantic structure into the discriminant subspace. Experimental results of CSMH and baseline methods on four widely-used datasets show that CSMH outperforms some state-of-the-art hashing baseline methods for cross-modal retrieval on efficiency and precision.

26 February 2024 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
LJLin Jiang
Lin Jiang
JWJigang Wu
Jigang Wu
Shuping ZhaoShuping Zhao
Shuping Zhao
JLJiaxing Li
Jiaxing Li
SMSiyuan Ma
Siyuan Ma
In cross-domain classification, the conventional methods typically focus on enhancing sample correlation to address domain shift. However, these methods often overlook a critical factor influencing classifier decisions, i.e., the discrimination between the nearest instances from different categories. To address this issue, this paper proposes a novel joint category compactness and disturbance reduction (CCDR) method for cross-domain classification. CCDR aims to enhance the discriminative capability of transformed features by addressing two fundamental aspects, which are the reinforcement of intra-class compactness and the reduction of irrelevant feature interference, respectively. To enhance intra-class compactness, CCDR introduces two metrics, a locality metric and a cluster metric within categories. These metrics can facilitate a shift in the data distribution perspective from domain-centric to category-centric, thereby augmenting the tightness of intra-class data clusters. To reduce the influence of irrelevant information, CCDR proposes a nearest-class discriminant strategy. This strategy widens the margin between the nearest instances from different categories, thereby effectively minimizing classifier misjudgments. Additionally, CCDR adopts Mahalanobis distance metric instead of Euclidean distance matric to capture feature correlations more effectively. Experimental results on five datasets demonstrate that CCDR outperforms some state-of-the-art methods in terms of cross-domain classification accuracy. Additionally, t-test results reveal a significant difference between the experimental results of CCDR and those of most comparison methods.

24 August 2024 in Pattern Recognition Letters
Verified
Journal Article
Closed access
LJLin Jiang
Lin Jiang
JWJigang Wu
Jigang Wu
SZShuping Zhao
Shuping Zhao
JLJiaxing Li
Jiaxing Li

24 April 2024 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
LJLin Jiang
Lin Jiang
JWJigang Wu
Jigang Wu
Shuping ZhaoShuping Zhao
Shuping Zhao
JLJiaxing Li
Jiaxing Li

13 January 2025 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
LJLin Jiang
Lin Jiang
JWJigang Wu
Jigang Wu
Shuping ZhaoShuping Zhao
Shuping Zhao
JLJiaxing Li
Jiaxing Li
In cross-domain recognition tasks, the divergent distributions of data acquired from various domains degrade the effectiveness of knowledge transfer. Additionally, in practice, cross-domain data also contain a massive amount of redundant information, usually disturbing the training processes of cross-domain classifiers. Seeking to address these issues and obtain efficient domain-invariant knowledge, this paper proposes a novel cross-domain classification method, named cross-scatter sparse dictionary pair learning (CSSDL). Firstly, a pair of dictionaries is learned in a common subspace, in which the marginal distribution divergence between the cross-domain data is mitigated, and domain-invariant information can be efficiently extracted. Then, a cross-scatter discriminant term is proposed to decrease the distance between cross-domain data belonging to the same class. As such, this term guarantees that the data derived from same class can be aligned and that the conditional distribution divergence is mitigated. In addition, a flexible label regression method is introduced to match the feature representation and label information in the label space. Thereafter, a discriminative and transferable feature representation can be obtained. Moreover, two sparse constraints are introduced to maintain the sparse characteristics of the feature representation. Extensive experimental results obtained on public datasets demonstrate the effectiveness of the proposed CSSDL approach.