Image Inpaint Using Patch Sparsity
| Main Authors: | Suryawanshi, Shital D., Baviskar, P. V. |
|---|---|
| Format: | Article info application/pdf |
| Bahasa: | eng |
| Terbitan: |
IAIC Publisher
, 2020
|
| Subjects: | |
| Online Access: |
https://aptikom-journal.id/index.php/csit/article/view/54 https://aptikom-journal.id/index.php/csit/article/view/54/30 |
Daftar Isi:
- 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