Vol.63, No.1, 2020, pp.509-519, doi:10.32604/cmc.2020.07519
A Fast Filling Algorithm for Image Restoration Based on Contour Parity
  • Yan Liu1, *, Wenxin Hu1, *, Longzhe Han2, Maksymyuk Taras3, Zhiyun Chen1
1 School of Data Science and Engineering, East China Normal University, Shanghai, 200062, China.
2 JiangXi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing, Nanchang Institute of Technology, Nanchang, 330099, China.
3 Department of Telecommunication Institute of Telecommunication, Radio Electronics and Electronic Engineering, Lviv Polytechnic National University, Lviv, 79013, Ukraine.
* Corresponding Author: Wenxin Hu. Email: .
Received 30 May 2019; Accepted 16 July 2019; Issue published 30 March 2020
Filling techniques are often used in the restoration of images. Yet the existing filling technique approaches either have high computational costs or present problems such as filling holes redundantly. This paper proposes a novel algorithm for filling holes and regions of the images. The proposed algorithm combines the advantages of both the parity-check filling approach and the region-growing inpainting technique. Pairing points of the region’s boundary are used to search and to fill the region. The scanning range of the filling method is within the target regions. The proposed method does not require additional working memory or assistant colors, and it can correctly fill any complex contours. Experimental results show that, compared to other approaches, the proposed algorithm fills regions faster and with lower computational cost.
Region filling, image restoration, parity check, region growing.
Cite This Article
Y. Liu, W. Hu, L. Han, M. Taras and Z. Chen, "A fast filling algorithm for image restoration based on contour parity," Computers, Materials & Continua, vol. 63, no.1, pp. 509–519, 2020.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.