Two-Stage Network Inpainting Algorithm Based on BDCN and U-net Edge Generation

doi:10.13190/j.jbupt.2020-268

Journal of Beijing University of Posts and Telecommunications ›› 2021, Vol. 44 ›› Issue (5): 121-126.doi: 10.13190/j.jbupt.2020-268

• REPORTS • Previous Articles Next Articles

Two-Stage Network Inpainting Algorithm Based on BDCN and U-net Edge Generation

LI Hai-yan¹, WANG Wei-hua¹, GUO Lei¹, LI Hai-jiang², LI Hong-song¹

1. School of Information Science and Engineering, Yunnan University, Kunming 650500, China;
2. Yunnan Communications Investment and Construction Group Company Limited, Kunming 650299, China

Received:2020-07-01 Online:2021-10-28 Published:2021-09-06

Abstract

Abstract: To repair the large irregular missing areas of an image, and obtain reasonable structure and fine-detailed textures,a two-stage network image inpainting algorithm based on bi-directional cascade network (BDCN) for perceptual edge detection and U-net incomplete edge generation is proposed. Firstly,the algorithm edges are extracted using the BDCN network. In the first stage,down-sampling is used to extract the features of the missing image edges based on the edge generation network of the U-net network architecture. The information inputted by the up-sampling layer and the information of each down-sampling layer is then combined to restore the image edge texture details. In the second stage,the hole convolution is applied for down-sampling and up-sampling,which adopts the residual network to reconstruct the missing image with rich details. The proposed algorithm is compared with the existing classic algorithm on the public datasets. Experimental results demonstrate that the proposed algorithm can obtain reasonable results and fine texture details,and its performance is superior to those of the contrast algorithms.

Key words: image inpainting, bi-directional cascade network for perceptual edge detection, U-net incomplete edge generator, the two-stage network

CLC Number:

TP391

LI Hai-yan, WANG Wei-hua, GUO Lei, LI Hai-jiang, LI Hong-song. Two-Stage Network Inpainting Algorithm Based on BDCN and U-net Edge Generation[J]. Journal of Beijing University of Posts and Telecommunications, 2021, 44(5): 121-126.

References

[1] Qiu Fudong, Wu Fan, Chen Guihai. Privacy and quality preserving multimedia data aggregation for participatory sensing systems[J]. IEEE Transactions on Mobile Computing, 2014, 14(6):1287-1300.
[2] Rahaman S, Cheng L, Yao D D, et al. Provably secure anonymous-yet-accountable crowdsensing with scalable sublinear revocation[J]. Privacy Enhancing Technologies, 2017(4):384-403.
[3] Sucasas V, Mantas G, Bastos J, et al. A signature scheme with un-linkable-yet-accountable pseudonymity for privacy-preserving crowdsensing[J]. IEEE Transactions on Mobile Computing, 2019, 19(4):752-768.
[4] Ni Jianbing, Zhang Kuan, Xia Qi, et al. Enabling strong privacy preservation and accurate task allocation for mobile crowdsensing[J]. IEEE Transactions on Mobile Computing, 2019, 19(6):1317-1331.
[5] Zhao Bowen, Tang Shaohua, Liu Ximeng, et al. PACE:privacy-preserving and quality-aware incentive mechanism for mobile crowdsensing[J]. IEEE Transactions on Mobile Computing, 2020, 20(5):1924-1939.
[6] Sun Peng, Wang Zhibo, Feng Yunhe, et al. Towards personalized privacy-preserving incentive for truth disco-very in crowdsourced binary-choice question answering[C]//IEEE Conference on Computer Communications. Toronto:IEEE, 2020:1133-1142.
[7] Galbraith S D, Paterson K G, Smart N P. Pairings for cryptographers[J].Discrete Applied Mathematics, 2008, 156(16):3113-3121.
[8] Chase M, Lysyanskaya A. On signatures of knowledge[C]//Annual International Cryptology Conference. Berlin:Springer, 2006:78-96.
[9] Camenisch J. Group signature schemes and payment systems based on the discrete logarithm problem[D]. Zurich:Swiss Federal Institute of Technology, 1998.
[10] Pointcheval D, Sanders O. Short randomizable signatures[C]//Cryptographers' Track at the RSA Conference. San Francisco:Springer, 2016:111-126.
[11] Camenisch J, Lysyanskaya A. Dynamic accumulators and application to efficient revocation of anonymous credentials[C]//Annual International Cryptology Conference. Berlin:Springer, 2002:61-76.
[12] Baldimtsi F, Camenisch J, Dubovitskaya M, et al. Accumulators with applications to anonymity-preserving revocation[C]//IEEE European Symposium on Security and Privacy. Paris:IEEE, 2017:301-315.
[13] Camenisch J, Drijvers M, Lehmann A, et al. Short threshold dynamic group signatures[C]//International Conference on Security and Cryptography for Networks. Amalfi:Springer, 2020:401-423.
[14] MIRACL Company Limited. Multiprecision integer and rational arithmetic cryptographic library version 7.0[EB/OL]. (2019-08-21)[2020-10-20]. https://github.com/miracl/MIRACL.
[15] Dang Q H. Secure Hash standard:NIST FIPS 180-4-2015[S]. Gaithersburg:National Institute of Standards and Technology, 2015:21-23.
[16] Fan J, Vercauteren F, Verbauwhede I. Faster F_p-arithmetic for cryptographic pairings on Barreto-Naehrig curves[C]//International Workshop on Cryptographic Hardware and Embedded Systems. Berlin:Springer, 2009:240-253.

Two-Stage Network Inpainting Algorithm Based on BDCN and U-net Edge Generation

RichHTML

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 2

Recommended Articles

Metrics

Comments

[1]	LI Haiyan, CHAO Yanjing, YU Pengfei, LI Haijiang, ZHANG Yufeng. Image Inpainting Algorithm with Diverse Aggregation of Contextual Information [J]. Journal of Beijing University of Posts and Telecommunications, 2023, 46(1): 19-25.
[2]	CAO Zhi-yi, NIU Shao-zhang, ZHANG Ji-wei. Masked Image Inpainting Algorithm Based on Generative Adversarial Nets [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(3): 81-86.