We present a novel formulation of exemplar-based inpainting as a global energy optimization problem, written in terms of the offset map. The proposed energy function combines a data attachment term that ensures the continuity of reconstruction at the boundary of the inpainting domain with a smoothness term that ensures a visually coherent reconstruction inside the hole. This formulation is adapted to obtain a global minimum using the graph cuts algorithm. To reduce the computational complexity, we propose an efficient multiscale graph cuts algorithm. To compensate the loss of information at low resolution levels, we use a feature representation computed at the original image resolution. This permits alleviation of the ambiguity induced by comparing only color information when the image is represented at low resolution levels. Our experiments show how well the proposed algorithm performs compared with other recent algorithms.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TIP.2012.2218828DOI Listing

Publication Analysis

Top Keywords

graph cuts
12
multiscale graph
8
term ensures
8
cuts algorithm
8
low resolution
8
resolution levels
8
exemplar-based image
4
image inpainting
4
inpainting multiscale
4
cuts novel
4

Similar Publications

The objective of the max-cut problem is to cut any graph in such a way that the total weight of the edges that are cut off is maximum in both subsets of vertices that are divided due to the cut of the edges. Although it is an elementary graph partitioning problem, it is one of the most challenging combinatorial optimization-based problems, and tons of application areas make this problem highly admissible. Due to its admissibility, the problem is solved using the Harris Hawk Optimization algorithm (HHO).

View Article and Find Full Text PDF

In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The first problem is to approximate cuts in balanced directed graphs.

View Article and Find Full Text PDF

Objective: To estimate proton density fat fraction (PDFF) from chemical shift encoded (CSE) MR images using a deep learning (DL)-based method that is precise and robust to different MR scanners and acquisition echo times (TEs).

Methods: Variable echo times neural network (VET-Net) is a two-stage framework that first estimates nonlinear variables of the CSE-MR signal model, to posteriorly estimate water/fat signal components using the least-squares method. VET-Net incorporates a vector with TEs as an auxiliary input, therefore enabling PDFF calculation with any TE setting.

View Article and Find Full Text PDF
Article Synopsis
  • Nanostructures, especially carbon nanotubes, are tiny materials with exceptional electronic properties, prompting recent research into their mathematical characteristics.
  • The study emphasizes the importance of molecular descriptors and topological indices in mathematical chemistry, particularly for QSAR and QSPR modeling.
  • In this research, the authors formulated the top ten critical topological indices for a benzene ring on a P-type surface in a 2D lattice, developed a predictive model for graph energy, and included NMR patterns and the HOMO-LUMO gap.
View Article and Find Full Text PDF

Saccharomyces cerevisiae is an excellent model to study the effect of external cues on cell division and stress response. 5-Fluorocuracil (5-FU) has been used to treat solid tumors since several decades. The drug was initially designed to interfere with DNA replication but was later found to exert its antiproliferative effect also via RNA-dependent processes.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!