Gradient-Controlled Gaussian Kernel for Image Inpainting

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Noori Hossein

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: AUT Journal of Electrical Engineering Year:2023 | Volume:55 | Issue:1 Page(s): 11-20

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Gradient-Controlled Gaussian Kernel for Image Inpainting

Author(s)

Noori Hossein | Issue Writer Certificate

Keywords

Image inpainting

Image reconstruction

image interpolation

Abstract

Image inpainting is the process of filling in damaged or missing regions in an image by using information from known regions or known pixels of the image. One of the most important techniques for inpainting is convolution-based methods, in which a kernel is convolved with the damaged image iteratively. Convolution based algorithms are very quick, but they don’t have good results in structures and textural regions and result in blurring. The kernel size in the convolution-based algorithm is a critical parameter. The large size results in edge blurring, and if the kernel size is small, the information may not be sufficient for reconstruction. In this paper, a novel convolution-based algorithm is proposed that uses known gradient of the pixels to construct a convolution mask. In this algorithm, the kernel size is controlled by the gradient of the image in the known regions. The algorithm computes the weighted sum of the known pixels in a neighborhood around a damaged pixel and replaces the value in the place of that damaged pixel. The proposed algorithm is fast and results in good edges and smooth regions reconstruction. It is an iterative algorithm and its implementation is very simple. Experimental results show the effectiveness of our algorithm.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans