Hailang Hu

Hailang Hu

Auto-generated profile, based on publicly available information

Hailang Hu

School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
23 January 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
LXLingyun Xiang
Lingyun Xiang
HHHailang Hu
Hailang Hu
QLQian Li
Qian Li
HYHao Yu
Hao Yu
XSXiaobo Shen
Xiaobo Shen
Recently, numerous degraded images have flooded search engines and social networks, finding extensive and practical applications in the real world. However, these images have also posed new challenges to conventional image retrieval tasks. To this end, we introduce a new task of retrieving degraded images through deep hashing from large-scale databases, and further present the Locality-Sensitive Hashing Network (LSHNet) to tackle it in a self-supervised manner. More specifically, we first propose a triplet strategy to enable the self-supervised training of LSHNet in an end-to-end fashion. Due to the designed strategy, the highly semantic similarity and discrimination of degraded images are well-preserved in our learned latent codes without requiring additional human labor in labeling tons of degraded images. Moreover, to tackle large-scale image retrieval efficiently, we further propose to transform the latent codes into locality-sensitive hashing codes such that the degraded images can be retrieved in sublinear time with their representation ability almost unaffected. Extensive experiments are conducted on three public benchmarks where the results demonstrate the superior performance of LSHNet in retrieving similar images under degraded conditions.

21 March 2005
Verified
Conference Paper
Closed access
WZWei Zhong
Wei Zhong
GAG. Altun
G. Altun
HHH.-J. Hu
H.-J. Hu
RHRobert Harrison
Robert Harrison
PTPhang C. Tai
Phang C. Tai
YPYi Pan
Yi Pan
Protein secondary structure prediction is one of the most important problems in bioinformatics research. When the traditional tertiary classifier is used in our neural network, 72% accuracy is reached. Since the neural network might not work very well in three-class classification for certain domains, the three-class problem is reduced to six binary class problems for the first time to carry out protein secondary structure prediction. With the combination of six binary classifiers, we experiment and test several tertiary classifiers. Additionally, three new tertiary classifiers are proposed in this study: MAX/spl I.bar/HEC, ONE/spl I.bar/TO/spl I.bar/ONE/spl I.bar/MAX and ONE/spl I.bar/TO/spl I.bar/ONE/spl I.bar/VOTE. ONE/spl I.bar/TO/spl I.bar/ONE/spl I.bar/VOTE outperforms the six other experimental tertiary classifiers in this study. ONE/spl I.bar/TO/spl I.bar/ONE/spl I.bar/VOTE tertiary classifier with PSSM encoding scheme obtains 74.02% test accuracy on RS126 dataset. To the best of our knowledge, this is the best result for RS126 dataset with the cross-validation method for neural network. The improvement of prediction accuracy indicates that decomposition of the multiclass problem into several binary class problems may be applied to other areas of computational biology in order to increase generalization power of neural networks.