Open Access

ARTICLE

A Fast Filling Algorithm for Image Restoration Based on Contour Parity

by Yan Liu, Wenxin Hu, Longzhe Han, Maksymyuk Taras, Zhiyun Chen

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: .

Computers, Materials & Continua 2020, 63(1), 509-519. https://doi.org/10.32604/cmc.2020.07519

Received 30 May 2019; Accepted 16 July 2019; Issue published 30 March 2020

Abstract

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.

---

Keywords

---

Citations