期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Research on Pedestrian Detection Technology Based on MSR and Faster R-CNN
1
作者 Xueyun Zhao chaoju hu 《Journal of Computer and Communications》 2018年第7期54-63,共10页
In order to avoid the problem of poor illumination characteristics and inaccurate positioning accuracy, this paper proposed a pedestrian detection algorithm suitable for low-light environments. The algorithm first app... In order to avoid the problem of poor illumination characteristics and inaccurate positioning accuracy, this paper proposed a pedestrian detection algorithm suitable for low-light environments. The algorithm first applied the multi-scale Retinex image enhancement algorithm to the sample pre-processing of deep learning to improve the image resolution. Then the paper used the faster regional convolutional neural network to train the pedestrian detection model, extracted the pedestrian characteristics, and obtained the bounding boxes through classification and position regression. Finally, the pedestrian detection process was carried out by introducing the Soft-NMS algorithm, and the redundant bounding box was eliminated to obtain the best pedestrian detection position. The experimental results showed that the proposed detection algorithm achieves an average accuracy of 89.74% on the low-light dataset, and the pedestrian detection effect was more significant. 展开更多
关键词 Deep Learning PEDESTRIAN Detection Region-Based Convolutional NEURAL Network Image Enhancement Non-Maximum SUPPRESSION
下载PDF
An Improved Multiple to One Fully Homomorphic Encryption on the Integers
2
作者 chaoju hu Jianwei Zhao 《Journal of Computer and Communications》 2018年第9期50-59,共10页
The public key of the integer homomorphic encryption scheme which was proposed by Van Dijk et al. is long, so the scheme is almost impossible to use in practice. By studying the scheme and Coron’s public key compress... The public key of the integer homomorphic encryption scheme which was proposed by Van Dijk et al. is long, so the scheme is almost impossible to use in practice. By studying the scheme and Coron’s public key compression technique, a scheme which is able to encrypt n bits plaintext once was obtained. The scheme improved the efficiency of the decrypting party and increased the number of encrypting parties, so it meets the needs of cloud computing better. The security of the scheme is based on the approximate GCD problem and the sparse-subset sum problem. 展开更多
关键词 Fully Homomorphic ENCRYPTION Multipart to ONE Fully HOMOMORPHISM ENCRYPTION Approximate GCD PROBLEM Sparse-Subset Sum PROBLEM
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部