Xuening Zhang

Xuening Zhang

Auto-generated profile, based on publicly available information

Xuening Zhang

Harbin Institute of Technology, Shenzhen, 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
6 September 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
XZXuening Zhang
Xuening Zhang
XLXingbo Liu
Xingbo Liu
XNXiushan Nie
Xiushan Nie
XKXiao Kang
Xiao Kang
YYYilong Yin
Yilong Yin
Large-scale cross-modal hashing has drawn extensive attention due to its attractive efficiency in both storage and retrieval. Existing methods exhibit poor performance when exploiting the semantic correlations implied in unsupervised and unpaired data during training process. To deal with this issue, we propose a novel hashing method, named Semi-supervised Semi-paired Cross-modal Hashing (SSCH). By leveraging a general and flexible two-step scheme, the proposed method can handle the complex training data effectively and efficiently, where both the common semantics and the modality-specific optimal pseudo semantics are well captured. Specifically, the proposed SSCH performs an alignment-free pseudo-labeling process to get strengthened semantic information. Furthermore, hash representations for various data are learned via a label-enhanced strategy, through which the cross-modal correlations are strengthened and preserved with considering efficiency. The semantic-preserving proof of SSCH is given based on statistical analysis. Also, we prove the stability of the proposed time-saving algorithm using properties of Bregman divergence. Experimental results on three benchmark datasets show that SSCH can obtain satisfactory precision and scalability in various scenarios.

8 January 2024 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
XLXingbo Liu
Xingbo Liu
JLJiamin Li
Jiamin Li
XNXiushan Nie
Xiushan Nie
XZXuening Zhang
Xuening Zhang
SWShaohua Wang
Shaohua Wang
YYYilong Yin
Yilong Yin
Unsupervised cross-modal hashing has received increasing attention because of its efficiency and scalability for large-scale data retrieval and analysis. However, existing unsupervised cross-modal hashing methods primarily focus on learning shared feature embedding, ignoring robustness and consistency across different modalities. To this end, this study proposes a novel method called scalable unsupervised hashing (SUH) for large-scale cross-modal retrieval. In the proposed method, latent semantic information and common semantic embedding within heterogeneous data are simultaneously exploited using multimodal clustering and collective matrix factorization, respectively. Furthermore, the robust norm is seamlessly integrated into the two processes, making SUH insensitive to outliers. Based on the robust consistency exploited from the latent semantic information and feature embedding, hash codes can be learned discretely to avoid cumulative quantitation loss. The experimental results on five benchmark datasets demonstrate the effectiveness of the proposed method under various scenarios.

13 December 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
XKXiao Kang
Xiao Kang
XLXingbo Liu
Xingbo Liu
XZXuening Zhang
Xuening Zhang
XNXiushan Nie
Xiushan Nie
YYYilong Yin
Yilong Yin
Online cross-modal hashing has received increasing research attention due to its capability of encoding streaming data and updating hash functions simultaneously. Despite significant progress, there is still room for further improving accuracy from two aspects, i.e ., 1) enhancing discrimination of hash codes with an efficient training process; 2) elevating generalization performance by harmonizing the training and retrieval process. Inspired by this, we propose an Online Discriminative Cross-modal Hashing method, called ODCH. To enlarge the inter-class margin and magnify the intra-class similarity, ODCH skillfully constructs a discriminative semantic space and seamlessly integrates bit balance and uncorrelation constraints, discrete optimization, and asymmetric strategy for embedding the discriminative semantic information into hamming space. Furthermore, ODCH attempts to boost the generalization process by bridging the gap between learning and generalization. It develops adaptive bit-wise weights to reflect different learning conditions among bits and transmits them into the generalization process. Besides, the proposed discriminative embedding and adaptive weighting can be adopted by existing supervised cross-modal hashing methods, achieving more precise performance than the original versions. Extensive experiments on three benchmarked datasets show that ODCH achieves up to an average of 4.17% mAP score gains compared to state-of-the-art online cross-modal hashing methods, indicating its superiority.

15 June 2024 in Pattern Recognition
Verified
Journal Article
Closed access
XKXiao Kang
Xiao Kang
XLXingbo Liu
Xingbo Liu
WXWen Xue
Wen Xue
XZXuening Zhang
Xuening Zhang
XNXiushan Nie
Xiushan Nie
YYYilong Yin
Yilong Yin

30 April 2026 in Information Processing & Management
Verified
Journal Article
Closed access
WPWeichao Pan
Weichao Pan
JKJiaju Kang
Jiaju Kang
XWXu Wang
Xu Wang
CLChengze Lv
Chengze Lv
XZXuening Zhang
Xuening Zhang
XLXingbo Liu
Xingbo Liu

26 November 2024 in ACM Transactions on Multimedia Computing, Communications, and Applications
Verified
Journal Article
Open access
XLXingbo Liu
Xingbo Liu
JLJiamin Li
Jiamin Li
XNXiushan Nie
Xiushan Nie
XZXuening Zhang
Xuening Zhang
YYYilong Yin
Yilong Yin
Unsupervised hashing has attracted extensive attention in effectively and efficiently tackling large-scale cross-modal retrieval task. Existing methods typically try to mine the latent common subspace across multimodal data without any category annotation. Despite the exciting progress, there are still three challenges that need to be further addressed: (1) efficiently improving the robustness during latent common subspace learning; (2) harmoniously embedding the intra-modal inherence and inter-modal relevance of multimodal data into Hamming space; and (3) effectively reducing the training time complexity and making the model scalable for large-scale datasets. To well address the above challenges, this study proposes a method named Fast Unsupervised Cross-Modal Hashing (FUCH). Specifically, FUCH proposes a semantic-aware collective matrix factorization to learn robust representation via exploiting latent category-specific attributes, and introduces Cauchy loss to measure the factorization process. Accordingly, the above process can effectively embed potential discriminative information into common space, while making the model insensitive for outliers. Moreover, FUCH designs a dual projection learning scheme, which not only learns modality-unique hash functions to excavate individual properties but also learns modality-mutual hash functions to multimodal correlational properties. Experimental results on three benchmark datasets verify the effectiveness of FUCH under various scenarios.