Libo He

Libo He

Auto-generated profile, based on publicly available information

Libo He

Information Security College, Yunnan Police College, Kunming 650221, China

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

19 May 2022 in Electronics
Verified
Journal Article
Open access
PDF file
LHLibo He
Libo He
ZQZhenping Qiang
Zhenping Qiang
XSXiaofeng Shao
Xiaofeng Shao
HLHong Lin
Hong Lin
MWMeijiao Wang
Meijiao Wang
FDFei Dai
Fei Dai
In face image recognition and other related applications, incomplete facial imagery due to obscuring factors during acquisition represents an issue that requires solving. Aimed at tackling this issue, the research surrounding face image completion has become an important topic in the field of image processing. Face image completion methods require the capability of capturing the semantics of facial expression. A deep learning network has been widely shown to bear this ability. However, for high-resolution face image completion, the network training of high-resolution image inpainting is difficult to converge, thus rendering high-resolution face image completion a difficult problem. Based on the study of the deep learning model of high-resolution face image generation, this paper proposes a high-resolution face inpainting method. First, our method extracts the latent vector of the face image to be repaired through ResNet, then inputs the latent vector to the pre-trained StyleGAN model to generate the face image. Next, it calculates the loss between the known part of the face image to be repaired and the corresponding part of the generated face imagery. Afterward, the latent vector is cut to generate a new face image iteratively until the number of iterations is reached. Finally, the Poisson fusion method is employed to process the last generated face image and the face image to be repaired in order to eliminate the difference in boundary color information of the repaired image. Through the comparison and analysis between two classical face completion methods in recent years on the CelebA-HQ data set, we discovered our method can achieve better completion results of 256*256 resolution face image completion. For 1024*1024 resolution face image restoration, we have also conducted a large number of experiments, which prove the effectiveness of our method. Our method can obtain a variety of repair results by editing the latent vector. In addition, our method can be successfully applied to face image editing, face image watermark clearing and other applications without the network training process of different masks in these applications.

18 August 2023 in Sensors
Verified
Journal Article
Open access
PDF file
JCJia Cao
Jia Cao
ZQZhenping Qiang
Zhenping Qiang
HLHong Lin
Hong Lin
LHLibo He
Libo He
FDFei Dai
Fei Dai
We propose an improved BM3D algorithm for block-matching based on UNet denoising network feature maps and structural similarity (SSIM). In response to the traditional BM3D algorithm that directly performs block-matching on a noisy image, without considering the deep-level features of the image, we propose a method that performs block-matching on the feature maps of the noisy image. In this method, we perform block-matching on multiple depth feature maps of a noisy image, and then determine the positions of the corresponding similar blocks in the noisy image based on the block-matching results, to obtain the set of similar blocks that take into account the deep-level features of the noisy image. In addition, we improve the similarity measure criterion for block-matching based on the Structural Similarity Index, which takes into account the pixel-by-pixel value differences in the image blocks while fully considering the structure, brightness, and contrast information of the image blocks. To verify the effectiveness of the proposed method, we conduct extensive comparative experiments. The experimental results demonstrate that the proposed method not only effectively enhances the denoising performance of the image, but also preserves the detailed features of the image and improves the visual quality of the denoised image.

26 June 2022 in Electronics
Verified
Journal Article
Open access
PDF file
XSXiaofeng Shao
Xiaofeng Shao
ZQZhenping Qiang
Zhenping Qiang
FDFei Dai
Fei Dai
LHLibo He
Libo He
HLHong Lin
Hong Lin
Face images are often used in social and entertainment activities to interact with information. However, during the transmission of digital images, there are factors that may destroy or obscure the key elements of the image, which may hinder the understanding of the image’s content. Therefore, the study of image completion of human faces has become an important research branch in the field of computer image processing. Compared with traditional image inpainting methods, deep-learning-based inpainting methods have significantly improved the results on face images, but in the case of complex semantic information and large missing areas, the completion results are still blurred, and the color of the boundary is inconsistent and does not match human visual perception. To solve this problem, this paper proposes a face completion method based on GAN priori to guide the network to complete face images by directly using the rich and diverse a priori information in the pre-trained GAN. The network model is a coarse-to-fine structure, where the damaged face images and the corresponding masks are first input to the coarse network to obtain the coarse results, and then the coarse results are input to the fine network with multi-resolution skip connections. The fine network uses the a priori information from the pre-trained GAN to guide the network to generate the face images, and finally uses the SN-PatchGAN discriminator to evaluate the completion results. The experiment is performed on the CelebA-HQ dataset. Compared with the latest three completion methods, the qualitative and quantitative experimental analysis shows that our method has obvious improvement in texture and fidelity.

25 July 2024 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
QCQingyang Chen
Qingyang Chen
ZQZhenping Qiang
Zhenping Qiang
YZYue Zhao
Yue Zhao
HLHong Lin
Hong Lin
LHLibo He
Libo He
FDFei Dai
Fei Dai
The majority of existing face inpainting methods primarily focus on generating a single result that visually resembles the original image. The generation of diverse and plausible results has emerged as a new branch in image restoration, often referred to as “Pluralistic Image Completion”. However, most diversity methods simply use random latent vectors to generate multiple results, leading to uncontrollable outcomes. To overcome these limitations, we introduce a novel architecture known as the Reference-Guided Directional Diverse Face Inpainting Network. In this paper, instead of using a background image as reference, which is typically used in image restoration, we have used a face image, which can have many different characteristics from the original image, including but not limited to gender and age, to serve as a reference face style. Our network firstly infers the semantic information of the masked face, i.e., the face parsing map, based on the partial image and its mask, which subsequently guides and constrains directional diverse generator network. The network will learn the distribution of face images from different domains in a low-dimensional manifold space. To validate our method, we conducted extensive experiments on the CelebAMask-HQ dataset. Our method not only produces high-quality oriented diverse results but also complements the images with the style of the reference face image. Additionally, our diverse results maintain correct facial feature distribution and sizes, rather than being random. Our network has achieved SOTA results in face diverse inpainting when writing. Code will is available at https://github.com/nothingwithyou/RDFINet.

23 March 2022
Verified
Book Chapter
Closed access
PDF file
SSShiqi Su
Shiqi Su
MYMiao Yang
Miao Yang
LHLibo He
Libo He
XSXiaofeng Shao
Xiaofeng Shao
YZYuxuan Zuo
Yuxuan Zuo
ZQZhenping Qiang
Zhenping Qiang