scispace - formally typeset
Open AccessJournal ArticleDOI

Exploiting Multi-Direction Features in MRF-Based Image Inpainting Approaches

Zhidan Li, +2 more
- 13 Dec 2019 - 
- Vol. 7, pp 179905-179917
Reads0
Chats0
TLDR
Experimental results show that the proposed Structure Offsets Statistics based image inpainting algorithm is superior to several state-of-the-art approaches in terms of the abilities of maintaining structure coherence and neighborhood consistence and the computational efficiency.
Abstract
Image inpainting technique recovers the missing regions of an image using information from known regions and it has shown success in various application fields. As a popular kind of methods, Markov Random Field (MRF)-based methods are able to produce better results than earlier diffusion-based and sparse-based methods on inpainting images with big holes. However, for images with complex structures, the results are still not quite pleasant and some inpainting trails exist. The direction feature is an important factor for image understanding and human eye visual requirements, and exploiting multi-direction features is of great potential to further improve inpainting performance. Following the idea, this paper proposes a Structure Offsets Statistics based image inpainting algorithm by exploiting multiple direction features under the framework of MRF-based methods. Specifically, when selecting proper labels, multi-direction features are extracted and applied to construct a structure image and a non-structure image, and the candidate labels are chosen from the offsets of structure and non-structure images. Meanwhile, the multi-direction features are applied to construct a new smooth term for the energy equation which is then solved by graph-cut optimization technology. Experimental results show that on inpainting tasks with various complexities, the proposed method is superior to several state-of-the-art approaches in terms of the abilities of maintaining structure coherence and neighborhood consistence and the computational efficiency.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Anti-forensics of diffusion-based image inpainting

TL;DR: This work proposes an approach that can remove the traces of the diffusion-based inpainting by analyzing the noise pattern of the pixels neighboring the inpainted regions and selecting the nearby pixels that are directly used for inPainting.
Journal ArticleDOI

Non-Local and Multi-Scale Mechanisms for Image Inpainting.

Xu He, +1 more
- 10 May 2021 - 
TL;DR: Zhang et al. as mentioned in this paper combined two non-local mechanisms including a contextual attention module (CAM) and an implicit diversified Markov random fields (ID-MRF) loss with a multi-scale architecture which uses several dense fusion blocks (DFB) based on the dense combination of dilated convolution to guide the generative network to restore discontinuous and continuous large masked areas.
Journal ArticleDOI

3D Measurement Method for Saturated Highlight Characteristics on Surface of Fuel Nozzle

Yeni Li, +2 more
- 28 Jul 2022 - 
TL;DR: In this article , an image inpainting method with a saturated highlight based on the statistics of similar patches used in prior segmentation of the subregion was proposed to improve the detection accuracy of fuel nozzles.
Journal ArticleDOI

A Novel Image Inpainting Framework Using Regression

TL;DR: In this article, a blockwise regression-based image inpainting framework is proposed and the core idea is to fill the unknown region in two stages: Extrapolate the edges to the known region and then extrapolate to theunknown region.
Proceedings ArticleDOI

A Novel Clustering-Based Image Inpainting Model Using the Loermgan Algorithm

Ishan Sharma, +1 more
TL;DR: In this paper , a clustering-centric image inpainting system has been proposed by utilizing the Log of Exponent Rule Generative Adversarial Network (LOERMGAN) algorithm.
References
More filters
Journal ArticleDOI

Fast approximate energy minimization via graph cuts

TL;DR: This work presents two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap moves that allow important cases of discontinuity preserving energies.
Proceedings ArticleDOI

Image inpainting

TL;DR: A novel algorithm for digital inpainting of still images that attempts to replicate the basic techniques used by professional restorators, and does not require the user to specify where the novel information comes from.
Journal ArticleDOI

Region filling and object removal by exemplar-based image inpainting

TL;DR: The simultaneous propagation of texture and structure information is achieved by a single, efficient algorithm that combines the advantages of two approaches: exemplar-based texture synthesis and block-based sampling process.
Posted Content

Online Learning for Matrix Factorization and Sparse Coding

TL;DR: A new online optimization algorithm is proposed, based on stochastic approximations, which scales up gracefully to large data sets with millions of training samples, and extends naturally to various matrix factorization formulations, making it suitable for a wide range of learning problems.
Journal ArticleDOI

Sparse Representation for Color Image Restoration

TL;DR: This work puts forward ways for handling nonhomogeneous noise and missing information, paving the way to state-of-the-art results in applications such as color image denoising, demosaicing, and inpainting, as demonstrated in this paper.
Related Papers (5)