Yan Zhang 0104

dblp:04/3348-104 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2026
0000-0002-2428-9211ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 An Energy-Efficient Multimodal Retrieval Framework for Inference on Heterogeneous Edge Nodes
abstract
Large-model-driven multimodal retrieval on mobile and edge devices must balance retrieval accuracy, inference latency, and energy efficiency under heterogeneous hardware constraints. This paper proposes an energy-efficiency-aware multimodal retrieval framework for heterogeneous edge environments. The framework first decomposes the end-to-end model into retrieval-aware functional submodules to preserve cross-modal embedding discriminability under low-precision execution. It then introduces a CPU–NPU–DSP collaborative scheduling mechanism to reduce latency and energy consumption, together with an energy-adaptive control strategy that dynamically adjusts execution paths and inference precision under varying energy budgets. Experiments on MS-COCO image–text retrieval show that the proposed method achieves an mAP of \(68.2\%\) and Recall@5 of \(90.0\%\), while reducing end-to-end latency to 118.5 ms and per-query energy consumption to 145.6 mJ. These results demonstrate an improved balance between retrieval effectiveness and edge-side efficiency.
Junfeng Fang, Yan Zhang 0104, Zhaoxi Feng, Manzhou Li
ICMR2
2026 Privacy-Constrained Low-Bit Representation Learning for Person Image Retrieval
abstract
Efficient storage and fast search with high retrieval accuracy remain key challenges for person image retrieval at large image scales. Low-bit visual representations can reduce storage and computation costs, but existing methods often overlook privacy leakage from residual sensitive information in hash codes, allowing attackers to infer attributes such as identity, gender, or age. To address this problem, we propose a privacy-constrained low-bit representation learning framework for person image retrieval. The framework includes a semantic-consistent low-bit retrieval encoder that preserves ranking structures under extremely low-bit budgets, a privacy-utility decoupling encoder that separates retrieval semantics from privacy information, and a balancing strategy that controls the trade-off between utility and privacy through sample-level weighting and bit-level gating. Experiments show that our method achieves an mAP of \(85.6\%\) and Rank-1 accuracy of \(92.5\%\), while reducing the Attack Success Rate under deep inversion attacks from over \(90\%\) to \(53.2\%\). It also maintains low retrieval latency, requiring only 0.02 ms per query, demonstrating a favorable balance between retrieval utility, privacy protection, and efficiency.
Junfeng Fang, Yan Zhang 0104, Manzhou Li, Xinjin Ge, Weiyuan Cui
ICMR2
2026 PeriNet: Periodic Deep Learning Framework for Modality-Agnostic Privacy Preserving
Yan Zhang 0104, Yihong Song, Manzhou Li, Qiushi Li 0002, Qi Li 0002, Ju Ren 0001
WWW1
2024 You Can Use But Cannot Recognize: Preserving Visual Privacy in Deep Neural Networks
Qiushi Li 0002, Yan Zhang 0104, Ju Ren 0001, Qi Li 0002, Yaoxue Zhang
NDSS2
2023 Privacy-Preserving DNN Training with Prefetched Meta-Keys on Heterogeneous Neural Network Accelerators
abstract
The embedded software may migrate the collected data to the server for DNN computation acceleration, which may compromise privacy. We propose a DNN computation framework that combines TEE and NNA to address the privacy leakage problem. We design an NNA-friendly encryption method that enables NNA to correctly compute the encrypted linear input. Facing the overhead of TEE-NNA interaction, we design a pipeline-based prefetch mechanism that can reduce the TEE interaction overhead. Experimentally, our approach proves to be compatible with a wide range of NPUs and TPUs, and improves the performance by 8-19 times over the TEE scheme.
Qiushi Li 0002, Ju Ren 0001, Yan Zhang 0104, Chengru Song, Yiqiao Liao, Yaoxue Zhang
DAC3