Image Inpaint Using Patch Sparsity

  • Suryawanshi S
  • Baviskar P
N/ACitations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

The process of removing the specific object or area or repairing the damaged area in an image is known as image inpainting. This algorithm [5] is proposed for removing objects from digital image. The challenge is to fill in the hole that is left behind in a visually plausible way. We first note that patch sparsity based synthesis contains the essential process required to replicate both texture and structure [8]; the success of structure propagation however is highly dependent on the order in which the filling proceeds. We propose a best algorithm in which the confidence in the synthesized pixel values is propagated in a manner similar to the propagation of information in inpainting.The actual color values are computed using patch sparsity based synthesis. In this paper the simultaneous propagation of texture and structure information [2] is achieved by a single, efficient algorithm. For best results selected image should have sufficient background information

Cite

CITATION STYLE

APA

Suryawanshi, S. D., & Baviskar, P. V. (2020). Image Inpaint Using Patch Sparsity. APTIKOM Journal on Computer Science and Information Technologies, 1(3), 85–91. https://doi.org/10.34306/csit.v1i3.54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free