Shanmin Pang

Dr. Shanmin Pang

Xi'an Jiaotong University, Xi'an, China
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2020 in Neurocomputing
Verified
Journal Article
Closed access
QZQinghai Zheng
Qinghai Zheng
JZJihua Zhu
Jihua Zhu
ZLZhongyu Li
Zhongyu Li
SPShanmin Pang
Shanmin Pang
JWJun Wang
Jun Wang
YLYaochen Li
Yaochen Li

18 October 2018 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
SPShanmin Pang
Shanmin Pang
JMJin Ma
Jin Ma
JXJianru Xue
Jianru Xue
Jihua ZhuJihua Zhu
Jihua Zhu
VOVicente Ordonez
Vicente Ordonez
Image retrieval based on deep convolutional features has demonstrated state-of-the-art performance in popular benchmarks. In this paper, we present a unified solution to address deep convolutional feature aggregation and image re-ranking by simulating the dynamics of heat diffusion. A distinctive problem in image retrieval is that repetitive or bursty features tend to dominate final image representations, resulting in representations less distinguishable. We show that by considering each deep feature as a heat source, our unsupervised aggregation method is able to avoid over-representation of bursty features. We additionally provide a practical solution for the proposed aggregation method and further show the efficiency of our method in experimental evaluation. Inspired by the aforementioned deep feature aggregation method, we also propose a method to re-rank a number of top ranked images for a given query image by considering the query as the heat source. Finally, we extensively evaluate the proposed approach with pre-trained and fine-tuned deep networks on common public benchmarks and show superior performance compared to previous work.

1 November 2018 in Pattern Recognition
Verified
Journal Article
Closed access
SPShanmin Pang
Shanmin Pang
JZJihua Zhu
Jihua Zhu
JWJiaxing Wang
Jiaxing Wang
VOVicente Ordonez
Vicente Ordonez
JXJianru Xue
Jianru Xue

29 June 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
WHWenyu Hao
Wenyu Hao
SPShanmin Pang
Shanmin Pang
BYBo Yang
Bo Yang
JXJianru Xue
Jianru Xue

23 December 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
QGQi Guo
Qi Guo
SPShanmin Pang
Shanmin Pang
XJXiaojun Jia
Xiaojun Jia
YLYang Liu
Yang Liu
Qing GuoQing Guo
Qing Guo
Adversarial attacks, particularly targeted transfer-based attacks, can be used to assess the adversarial robustness of large visual-language models (VLMs), allowing for a more thorough examination of potential security flaws before deployment. However, previous transfer-based adversarial attacks incur high costs due to high iteration counts and complex method structure. Furthermore, due to the unnaturalness of adversarial semantics, the generated adversarial examples have low transferability. These issues limit the utility of existing methods for assessing robustness. To address these issues, we propose AdvDiffVLM, which uses diffusion models to generate natural, unrestricted and targeted adversarial examples via score matching. Specifically, AdvDiffVLM uses Adaptive Ensemble Gradient Estimation (AEGE) to modify the score during the diffusion model’s reverse generation process, ensuring that the produced adversarial examples have natural adversarial targeted semantics, which improves their transferability. Simultaneously, to improve the quality of adversarial examples, we use the GradCAM-guided Mask Generation (GCMG) to disperse adversarial semantics throughout the image rather than concentrating them in a single area. Finally, AdvDiffVLM embeds more target semantics into adversarial examples after multiple iterations. Experimental results show that our method generates adversarial examples 5x to 10x faster than state-of-the-art (SOTA) transfer-based adversarial attacks while maintaining higher quality adversarial examples. Furthermore, compared to previous transfer-based adversarial attacks, the adversarial examples generated by our method have better transferability. Notably, AdvDiffVLM can successfully attack a variety of commercial VLMs in a black-box environment, including GPT-4V. The code is available at https://github.com/gq-max/AdvDiffVLM.

3 September 2021 in Bioinformatics
Verified
Journal Article
Open access
PDF file
BYBo Yang
Bo Yang
TXTing-Ting Xin
Ting-Ting Xin
SPShanmin Pang
Shanmin Pang
MWMeng Wang
Meng Wang
YWYijie Wang
Yijie Wang
Motivation: Precise prediction of cancer subtypes is of significant importance in cancer diagnosis and treatment. Disease etiology is complicated existing at different omics levels; hence integrative analysis provides a very effective way to improve our understanding of cancer. Results: We propose a novel computational framework, named Deep Subspace Mutual Learning (DSML). DSML has the capability to simultaneously learn the subspace structures in each available omics data and in overall multi-omics data by adopting deep neural networks, which thereby facilitates the subtype’s prediction via clustering on multi-level, single-level and partial-level omics data. Extensive experiments are performed in five different cancers on three levels of omics data from The Cancer Genome Atlas. The experimental analysis demonstrates that DSML delivers comparable or even better results than many state-of-the-art integrative methods. Availability and implementation: An implementation and documentation of the DSML is publicly available at https://github.com/polytechnicXTT/Deep-Subspace-Mutual-Learning.git.