Shaoqi Hou

Shaoqi Hou

Auto-generated profile, based on publicly available information

Shaoqi Hou

Shenzhen Institute of Information Technology, Shenzhen, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 January 2024 in Defence Technology
Verified
Journal Article
Open access
SHShaoqi Hou
Shaoqi Hou
ZWZhiming Wang
Zhiming Wang
ZDZhihua Dong
Zhihua Dong
YLYe Li
Ye Li
ZWZhiguo Wang
Zhiguo Wang
XWXinzhong Wang
Xinzhong Wang

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
SHShaoqi Hou
Shaoqi Hou
DFDongdong Fang
Dongdong Fang
YPYixi Pan
Yixi Pan
YLYe Li
Ye Li
GYGuangqiang Yin
Guangqiang Yin
Face detection remains a challenging problem due to the high variability of scale and occlusion despite the strong representational power of deep convolutional neural networks and their implicit robustness. To handle hard face detection under extreme circumstances especially tiny faces detection, in this paper, we proposed a multiscale Hybrid Pyramid Convolutional Network (HPCNet), which is a one‐stage fully convolutional network. Our HPCNet consists of three newly presented modules: firstly, we designed the Hybrid Dilated Convolution (HDC) module to replace the fully connected layers in VGG16, which enlarges receptive field and reduces its loss of local information; secondly, we constructed the Hybrid Feature Pyramid (HFP) to combine semantic information from higher layers together with details from lower layers; and thirdly, to deal with the problem of occlusion and blurring effectively, we introduced Context Information Extractor (CIE) in HPCNet. In addition, we presented an improved Online Hard Example Mining (OHEM) strategy, which can enhance the average precision of face detection by balancing the number of positive and negative samples. Our method has achieved an accuracy of 0.933, 0.924, and 0.848 on the Easy, Medium, and Hard subset of WIDER FACE, respectively, which surpasses most of the advanced algorithms.

19 May 2022 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
SHShaoqi Hou
Shaoqi Hou
KYKangning Yin
Kangning Yin
JLJie Liang
Jie Liang
ZWZhiguo Wang
Zhiguo Wang
YPYixi Pan
Yixi Pan
GYGuangqiang Yin
Guangqiang Yin
In the monitoring scene, parameters of different cameras are vary greatly, which makes Person re-identification (Re-ID) tasks extremely susceptible to factors such as scale, blur, and occlusion. To alleviate the these problems, this paper proposes a Dense Feature Pyramid Network (DFPN), which can converge to a better performance without pretraining. To be more specific, DFPN is composed of three main parts. First, a new Residual Convolutional Block (RCB) is designed by referring to the construction method of ResBlock. Taking RCB as a basic unit and combining it with the convolution layer structure of VGGNet, we construct the backbone RVNet (Residual VGGNet) to realize the rapid convergence of the network and solve the disappearance of the gradient. Second, based on Feature Pyramid Network, we design the Dense Pyramid Fusion Module by integrating the connection mode of DenseNet, which aims at the improvement of the richness and scale diversity of feature maps by taking semantic information and detail information into account. Finally, to increase the receptive field of the feature map, we introduce an improved retinal receptive field structure Improved RFB (IRFB) on the basis of Receptive Field Block (RFB), which can effectively solve the problem of pedestrian occlusion. In experiments on the public datasets Market1501, DukeMTMC-reID and Occluded-Duke, the Rank-1 accuracy can reach 94.12%, 87.25% and 51.72% with pretraining, respectively. A series of ablation experiments and comparative experiments have proved the effectiveness of our modules and overall scheme.

5 August 2024 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
SHShaoqi Hou
Shaoqi Hou
XLXueting Liu
Xueting Liu
CWChenyu Wu
Chenyu Wu
GYGuangqiang Yin
Guangqiang Yin
XWXinzhong Wang
Xinzhong Wang
ZWZhiguo Wang
Zhiguo Wang
Person Re-identification (Re-ID) technology aims to solve the matching problem of the same pedestrians at different times and places, which has important application value in the field of public safety. At present, most scholars focus on designing complex models to improve the accuracy of Re-ID, but the high complexity of the model further restricts the practical application of Re-ID algorithm. To solve the above problems, this paper designs a lightweight Self-selective Receptive Field (SRF) block instead of directly designing complex models. Specifically, the module can be plug-and-play on the general backbone network, so as to significantly improve the performance of Re-ID while effectively controlling the amount of its own parameter and calculation: (1) the SRF block encodes pedestrian targets and image contexts at different scales by constructing pyramidal convolution group and allows the module to independently select the size of the receptive field through training by means of self-adaptive weighting; (2) in order to reduce the complexity of SRF block, we introduce a "channel scaling factor" and design a "grouped convolution operation" by constraining the channels of the feature map and changing the structure of the convolution kernel respectively. Experiments on multiple datasets show that SRF Network (SRFNet) for Re-ID can achieve a good balance between performance and complexity, which fully demonstrates the effectiveness of SRF block.

1 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
SHShaoqi Hou
Shaoqi Hou
CLChunhui Liu
Chunhui Liu
KYKangning Yin
Kangning Yin
YDYiyin Ding
Yiyin Ding
ZWZhiguo Wang
Zhiguo Wang
GYGuangqiang Yin
Guangqiang Yin
Person Re‐identification (Re‐ID) is aimed at solving the matching problem of the same pedestrian at a different time and in different places. Due to the cross‐device condition, the appearance of different pedestrians may have a high degree of similarity; at this time, using the global features of pedestrians to match often cannot achieve good results. In order to solve these problems, we designed a Spatial Attention Network Guided by Attribute Label (SAN‐GAL), which is a dual‐trace network containing both attribute classification and Re‐ID. Different from the previous approach of simply adding a branch of attribute binary classification network, our SAN‐GAL is mainly divided into two connecting steps. First, with attribute labels as guidance, we generate Attribute Attention Heat map (AAH) through Grad‐CAM algorithm to accurately locate fine‐grained attribute areas of pedestrians. Then, the Attribute Spatial Attention Module (ASAM) is constructed according to the AHH which is taken as the prior knowledge and introduced into the Re‐ID network to assist in the discrimination of the Re‐ID task. In particular, our SAN‐GAL network can integrate the local attribute information and global ID information of pedestrians without introducing additional attribute region annotation, which has good flexibility and adaptability. The test results on Market1501 and DukeMTMC‐reID show that our SAN‐GAL can achieve good results and can achieve 85.8% Rank‐1 accuracy on DukeMTMC‐reID dataset, which is obviously competitive compared with most Re‐ID algorithms.

1 January 2025 in Computers, Materials & Continua
Verified
Journal Article
Open access
SHShaoqi Hou
Shaoqi Hou
ZQZebang Qin
Zebang Qin
CWChenyu Wu
Chenyu Wu
GYGuangqiang Yin
Guangqiang Yin
XWXinzhong Wang
Xinzhong Wang
ZWZhiguo Wang
Zhiguo Wang
Visual Place Recognition (VPR) technology aims to use visual information to judge the location of agents, which plays an irreplaceable role in tasks such as loop closure detection and relocation. It is well known that previous VPR algorithms emphasize the extraction and integration of general image features, while ignoring the mining of salient features that play a key role in the discrimination of VPR tasks. To this end, this paper proposes a Domain-invariant Information Extraction and Optimization Network (DIEONet) for VPR. The core of the algorithm is a newly designed Domain-invariant Information Mining Module (DIMM) and a Multi-sample Joint Triplet Loss (MJT Loss). Specifically, DIMM incorporates the interdependence between different spatial regions of the feature map in the cascaded convolutional unit group, which enhances the model’s attention to the domain-invariant static object class. MJT Loss introduces the “joint processing of multiple samples” mechanism into the original triplet loss, and adds a new distance constraint term for “positive and negative” samples, so that the model can avoid falling into local optimum during training. We demonstrate the effectiveness of our algorithm by conducting extensive experiments on several authoritative benchmarks. In particular, the proposed method achieves the best performance on the TokyoTM dataset with a Recall@1 metric of 92.89%.