Ruifan Zuo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ruifan Zuo has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Chaoqun Zheng
Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan, China
5 shared publications - Wenpeng Lu
Qilu University of Technology (Shandong Academy of Sciences)
4 shared publications - Fengling Li
Faculty of Engineering and Information Technology, University of Technology Sydney, Sydney, NSW, Australia
3 shared publications - Fengling Li
Mohamed bin Zayed University of Artificial Intelligence, Abu Dhabi, United Arab Emirates
2 shared publications - Lei Zhu
Tongji University, Shanghai, China
2 shared publications - Tian Gan
Shandong University, Qingdao, China
2 shared publications
Latest Publications
- Open Access
- 19 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
SSMH: Semantic Self-refinement Multi-modal Hashing for Multi-modal Retrieval
Multi-modal hashing converts high-dimensional features into compact binary codes while preserving semantic similarity, thereby achieving high performance with lower storage and computational costs. However, existing methods generally overly depend on discrete supervisory information, ignoring the ambiguity of labels and intra-class diversity. To address these challenges, we propose a novel S emantic S elf-refinement M ulti-modal H ashing (SSMH), which adaptively learns stable semantic representations through a unified end-to-end semantic learning. First, we dynamically integrate inter- and intra- modal correlations to achieve semantically consistent multi-modal integrated representation. Then, we generate prototype-guided binary codes to explicitly align multi-modal representations with label semantics, thereby strengthening supervision and mitigating the effect of ambiguous labels. Extensive experiments show SSMH outperforms state-of-the-art methods in multi-modal retrieval. The source code can be found at https://github.com/vindahi/SSMH.
- 19 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
Open AccessSSMH: Semantic Self-refinement Multi-modal Hashing for Multi-modal Retrieval
Multi-modal hashing converts high-dimensional features into compact binary codes while preserving semantic similarity, thereby achieving high performance with lower storage and computational costs. However, existing methods generally overly depend on discrete supervisory information, ignoring the ambiguity of labels and intra-class diversity. To address these challenges, we propose a novel S emantic S elf-refinement M ulti-modal H ashing (SSMH), which adaptively learns stable semantic representations through a unified end-to-end semantic learning. First, we dynamically integrate inter- and intra- modal correlations to achieve semantically consistent multi-modal integrated representation. Then, we generate prototype-guided binary codes to explicitly align multi-modal representations with label semantics, thereby strengthening supervision and mitigating the effect of ambiguous labels. Extensive experiments show SSMH outperforms state-of-the-art methods in multi-modal retrieval. The source code can be found at https://github.com/vindahi/SSMH.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-578
Depression Detection from Social Media: A Mutual Guidance Multi-modal Network with Complementary Graph Learning
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-578
Open AccessDepression Detection from Social Media: A Mutual Guidance Multi-modal Network with Complementary Graph Learning
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 12170-12181
From Incomplete to Valuable: Partial Cross-Modal Hashing via Coarse-to-Fine Semantic Completion
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 12170-12181
From Incomplete to Valuable: Partial Cross-Modal Hashing via Coarse-to-Fine Semantic Completion
- Open Access
- 23 September 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 20 (9) , 1-19
Privacy-Enhanced Prototype-Based Federated Cross-Modal Hashing for Cross-Modal Retrieval
Cross-modal hashing is widely used for efficient similarity searches, improving data processing efficiency, and reducing storage costs. Existing cross-modal hashing methods primarily focus on centralized training scenarios, where fixed-scale and fixed-category multi-modal data is collected beforehand. However, these methods often face challenges associated with the potential risk of privacy breaches and high data communication costs during data transmission in real-world multimedia retrieval tasks. To tackle these challenges, in this article, we propose an efficient privacy-enhanced prototype-based federated cross-modal hashing (PEPFCH). In PEPFCH, we integrate local and global prototypes in order to effectively capture the distinctive traits of individual clients, while also harnessing the collective intelligence of the entire federated learning system. Moreover, to ensure the security of prototype information and prevent its disclosure during the aggregation process, we use a prototype encryption transmission mechanism to encrypt the prototype information before transmission, making it challenging for attackers to gain access to sensitive data. Additionally, to facilitate personalized federated learning and alleviate the issue of parametric catastrophic forgetting, we establish the image and text hyper-networks for each client and adopt a hyper-network extension strategy to selectively preserve and update previously acquired knowledge when acquiring new concepts or categories. Comprehensive experiments highlight the efficiency and superiority of our proposed method. To enhance research and accessibility, we have publicly released our source codes at: https://github.com/vindahi/PEPFCH .
- 23 September 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 20 (9) , 1-19
Open AccessPrivacy-Enhanced Prototype-Based Federated Cross-Modal Hashing for Cross-Modal Retrieval
Cross-modal hashing is widely used for efficient similarity searches, improving data processing efficiency, and reducing storage costs. Existing cross-modal hashing methods primarily focus on centralized training scenarios, where fixed-scale and fixed-category multi-modal data is collected beforehand. However, these methods often face challenges associated with the potential risk of privacy breaches and high data communication costs during data transmission in real-world multimedia retrieval tasks. To tackle these challenges, in this article, we propose an efficient privacy-enhanced prototype-based federated cross-modal hashing (PEPFCH). In PEPFCH, we integrate local and global prototypes in order to effectively capture the distinctive traits of individual clients, while also harnessing the collective intelligence of the entire federated learning system. Moreover, to ensure the security of prototype information and prevent its disclosure during the aggregation process, we use a prototype encryption transmission mechanism to encrypt the prototype information before transmission, making it challenging for attackers to gain access to sensitive data. Additionally, to facilitate personalized federated learning and alleviate the issue of parametric catastrophic forgetting, we establish the image and text hyper-networks for each client and adopt a hyper-network extension strategy to selectively preserve and update previously acquired knowledge when acquiring new concepts or categories. Comprehensive experiments highlight the efficiency and superiority of our proposed method. To enhance research and accessibility, we have publicly released our source codes at: https://github.com/vindahi/PEPFCH .