Shangchen Zhou

Shangchen Zhou

Auto-generated profile, based on publicly available information

Shangchen Zhou

S-Lab, Nanyang Technological University

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
11 July 2024 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
JWJianyi Wang
Jianyi Wang
ZYZongsheng Yue
Zongsheng Yue
SZShangchen Zhou
Shangchen Zhou
KCKelvin C. K. Chan
Kelvin C. K. Chan
CLChen Change Loy
Chen Change Loy

5 November 2020
Verified
Book Chapter
Closed access
PDF file
HXHaozhe Xie
Haozhe Xie
HYHongxun Yao
Hongxun Yao
SZShangchen Zhou
Shangchen Zhou
JMJiageng Mao
Jiageng Mao
Shengping ZhangShengping Zhang
Shengping Zhang
WSWenxiu Sun
Wenxiu Sun

15 July 2020 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
HXHaozhe Xie
Haozhe Xie
HYHongxun Yao
Hongxun Yao
Shengping ZhangShengping Zhang
Shengping Zhang
SZShangchen Zhou
Shangchen Zhou
WSWenxiu Sun
Wenxiu Sun

11 November 2022
Verified
Book Chapter
Closed access
PDF file
SZShangchen Zhou
Shangchen Zhou
CLChongyi Li
Chongyi Li
CLChen Change Loy
Chen Change Loy

5 November 2020
Verified
Book Chapter
Closed access
PDF file
XLXiaoming Li
Xiaoming Li
CCChaofeng Chen
Chaofeng Chen
SZShangchen Zhou
Shangchen Zhou
XLXianhui Lin
Xianhui Lin
WZWangmeng Zuo
Wangmeng Zuo
LZLei Zhang
Lei Zhang

16 March 2020 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
SJSheng Jin
Sheng Jin
HYHongxun Yao
Hongxun Yao
XSXiaoshuai Sun
Xiaoshuai Sun
SZShangchen Zhou
Shangchen Zhou
LZLei Zhang
Lei Zhang
XHXiansheng Hua
Xiansheng Hua
In recent years, hashing methods have been proved to be effective and efficient for large-scale Web media search. However, the existing general hashing methods have limited discriminative power for describing fine-grained objects that share similar overall appearance but have a subtle difference. To solve this problem, we for the first time introduce the attention mechanism to the learning of fine-grained hashing codes. Specifically, we propose a novel deep hashing model, named deep saliency hashing (DSaH), which automatically mines salient regions and learns semantic-preserving hashing codes simultaneously. DSaH is a two-step end-to-end model consisting of an attention network and a hashing network. Our loss function contains three basic components, including the semantic loss, the saliency loss, and the quantization loss. As the core of DSaH, the saliency loss guides the attention network to mine discriminative regions from pairs of images.We conduct extensive experiments on both fine-grained and general retrieval datasets for performance evaluation. Experimental results on fine-grained datasets, including Oxford Flowers, Stanford Dogs, and CUB Birds demonstrate that our DSaH performs the best for the fine-grained retrieval task and beats the strongest competitor (DTQ) by approximately 10% on both Stanford Dogs and CUB Birds. DSaH is also comparable to several state-of-the-art hashing methods on CIFAR-10 and NUS-WIDE.