Lin Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lin Jiang has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jiaxing Li
School of Artificial Intelligence, Guangzhou University, Guangzhou, China
9 shared publications - Xiaozhao Fang
School of Automation, Guangdong University of Technology, Guangzhou, China
5 shared publications - Shengli Xie
Guangdong University of Technology
4 shared publications - Jigang Wu
School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China
3 shared publications - Shuping Zhao
Guangdong University of Technology, Guangzhou, China
3 shared publications - Yong Xu
Harbin Institute of Technology, Shenzhen, China
3 shared publications
Latest Publications
- 11 February 2026
- Published by Elsevier in Vehicular Communications
- Vol. 59
A blockchain-empowered decentralized and secure spectrum allocation for wireless vehicular communications
- 11 February 2026
- Published by Elsevier in Vehicular Communications
- Vol. 59
A blockchain-empowered decentralized and secure spectrum allocation for wireless vehicular communications
- 28 January 2026
- Published by Elsevier in Pattern Recognition
- Vol. 176
Joint asymmetric discrete hashing for cross-modal retrieval
- 28 January 2026
- Published by Elsevier in Pattern Recognition
- Vol. 176
Joint asymmetric discrete hashing for cross-modal retrieval
- Open Access
Block-CITE: A Blockchain-Based Crowdsourcing Interactive Trust Evaluation
Industrial trademark examination enables users to apply for and manage their trademarks efficiently, promoting industrial and commercial economic development. However, there still exist many challenges, e.g., how to customize a blockchain-based crowdsourcing method for interactive trust evaluation, how to decentralize the functionalities of a centralized entity to nodes in a blockchain network instead of removing the entity directly, how to design a protocol for the method and prove its security, etc. In order to overcome these challenges, in this paper, we propose the Blockchain-based Crowdsourcing Interactive Trust Evaluation (Block-CITE for short) method to improve the efficiency and security of the current industrial trademark management schemes. Specifically, Block-CITE adopts a dual-blockchain structure and a crowdsourcing technique to record operations and store relevant data in a decentralized way. Furthermore, Block-CITE customizes a protocol for blockchain-based crowdsourced industrial trademark examination and algorithms of smart contracts to run the protocol automatically. In addition, Block-CITE analyzes the threat model and proves the security of the protocol. Security analysis shows that Block-CITE is able to defend against the malicious entities and attacks in the blockchain network. Experimental analysis shows that Block-CITE has a higher transaction throughput and lower network latency and storage overhead than the baseline methods.
Open AccessBlock-CITE: A Blockchain-Based Crowdsourcing Interactive Trust Evaluation
Industrial trademark examination enables users to apply for and manage their trademarks efficiently, promoting industrial and commercial economic development. However, there still exist many challenges, e.g., how to customize a blockchain-based crowdsourcing method for interactive trust evaluation, how to decentralize the functionalities of a centralized entity to nodes in a blockchain network instead of removing the entity directly, how to design a protocol for the method and prove its security, etc. In order to overcome these challenges, in this paper, we propose the Blockchain-based Crowdsourcing Interactive Trust Evaluation (Block-CITE for short) method to improve the efficiency and security of the current industrial trademark management schemes. Specifically, Block-CITE adopts a dual-blockchain structure and a crowdsourcing technique to record operations and store relevant data in a decentralized way. Furthermore, Block-CITE customizes a protocol for blockchain-based crowdsourced industrial trademark examination and algorithms of smart contracts to run the protocol automatically. In addition, Block-CITE analyzes the threat model and proves the security of the protocol. Security analysis shows that Block-CITE is able to defend against the malicious entities and attacks in the blockchain network. Experimental analysis shows that Block-CITE has a higher transaction throughput and lower network latency and storage overhead than the baseline methods.
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 34 (10577149) , 5158-5171
Asymmetric and Discrete Self-Representation Enhancement Hashing for Cross-Domain Retrieval
Due to the characteristics of low storage requirement and high retrieval efficiency, hashing-based retrieval has shown its great potential and has been widely applied for information retrieval. However, retrieval tasks in real-world applications are usually required to handle the data from various domains, leading to the unsatisfactory performances of existing hashing-based methods, as most of them assuming that the retrieval pool and the querying set are similar. Most of the existing works overlooked the self-representation that containing the modality-specific semantic information, in the cross-modal data. To cope with the challenges mentioned above, this paper proposes an asymmetric and discrete self-representation enhancement hashing (ADSEH) for cross-domain retrieval. Specifically, ADSEH aligns the mathematical distribution with domain adaptation for cross-domain data, by exploiting the correlation of minimizing the distribution mismatch to reduce the heterogeneous semantic gaps. Then, ADSEH learns the self-representation which is embedded into the generated hash codes, for enhancing the semantic relevance, improving the quality of hash codes, and boosting the generalization ability of ADSEH. Finally, the heterogeneous semantic gaps are further reduced by the log-likelihood similarity preserving for the cross-domain data. Experimental results demonstrate that ADSEH can outperform some SOTA baseline methods on four widely used datasets.
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 34 (10577149) , 5158-5171
Asymmetric and Discrete Self-Representation Enhancement Hashing for Cross-Domain Retrieval
Due to the characteristics of low storage requirement and high retrieval efficiency, hashing-based retrieval has shown its great potential and has been widely applied for information retrieval. However, retrieval tasks in real-world applications are usually required to handle the data from various domains, leading to the unsatisfactory performances of existing hashing-based methods, as most of them assuming that the retrieval pool and the querying set are similar. Most of the existing works overlooked the self-representation that containing the modality-specific semantic information, in the cross-modal data. To cope with the challenges mentioned above, this paper proposes an asymmetric and discrete self-representation enhancement hashing (ADSEH) for cross-domain retrieval. Specifically, ADSEH aligns the mathematical distribution with domain adaptation for cross-domain data, by exploiting the correlation of minimizing the distribution mismatch to reduce the heterogeneous semantic gaps. Then, ADSEH learns the self-representation which is embedded into the generated hash codes, for enhancing the semantic relevance, improving the quality of hash codes, and boosting the generalization ability of ADSEH. Finally, the heterogeneous semantic gaps are further reduced by the log-likelihood similarity preserving for the cross-domain data. Experimental results demonstrate that ADSEH can outperform some SOTA baseline methods on four widely used datasets.
- 31 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (5) , 2311-2328
Collaboratively Semantic Alignment and Metric Learning for Cross-Modal Hashing
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.
- 31 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (5) , 2311-2328
Collaboratively Semantic Alignment and Metric Learning for Cross-Modal Hashing
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.
- 13 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27 (15209210) , 371-384
Cross-Scatter Sparse Dictionary Pair Learning for Cross-Domain Classification
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.
- 13 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27 (15209210) , 371-384
Cross-Scatter Sparse Dictionary Pair Learning for Cross-Domain Classification
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.
- 24 August 2024
- Published by Elsevier in Pattern Recognition Letters
- Vol. 185, 264-270
Coding self-representative and label-relaxed hashing for cross-modal retrieval
- 24 August 2024
- Published by Elsevier in Pattern Recognition Letters
- Vol. 185, 264-270
Coding self-representative and label-relaxed hashing for cross-modal retrieval
- 24 April 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (21) , 13107-13126
Domain-invariant feature learning with label information integration for cross-domain classification
- 24 April 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (21) , 13107-13126
Domain-invariant feature learning with label information integration for cross-domain classification
- 26 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-14
Joint Category Compactness and Disturbance Reduction for Cross-Domain Classification
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.
- 26 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 73 (00189456) , 1-14
Joint Category Compactness and Disturbance Reduction for Cross-Domain Classification
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.
- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (7) , 6530-6541
CKDH: CLIP-Based Knowledge Distillation Hashing for Cross-Modal Retrieval
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.
- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (7) , 6530-6541
CKDH: CLIP-Based Knowledge Distillation Hashing for Cross-Modal Retrieval
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.