2018
DOI: 10.1155/2018/3950312
|View full text |Cite
|
Sign up to set email alerts
|

On Surface Completion and Image Inpainting by Biharmonic Functions: Numerical Aspects

Abstract: Numerical experiments with smooth surface extension and image inpainting using harmonic and biharmonic functions are carried out. The boundary data used for constructing biharmonic functions are the values of the Laplacian and normal derivatives of the functions on the boundary. Finite difference schemes for solving these harmonic functions are discussed in detail.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
37
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
3
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 42 publications
(37 citation statements)
references
References 18 publications
0
37
0
Order By: Relevance
“…Once the ionization front is removed from the original image, the gap is expended by a morphological dilation with a 20-pixel-diameter disk and filled using a standard inpainting technique (Damelin & Hoang 2018). This process fills the missing part by selecting similar textures available outside the mask.…”
Section: Ionization Front and H II Regionmentioning
confidence: 99%
“…Once the ionization front is removed from the original image, the gap is expended by a morphological dilation with a 20-pixel-diameter disk and filled using a standard inpainting technique (Damelin & Hoang 2018). This process fills the missing part by selecting similar textures available outside the mask.…”
Section: Ionization Front and H II Regionmentioning
confidence: 99%
“…In order to obtain a simplistic, representation of the scalp map they were re-shaped into a 7x11 matrix that kept the spatial relation between electrodes. Missing values within this scalp matrix were inpainted (Damelin and Hoang (2018)) using the scikit-image library for Python. These low-resolution scalp maps were used as input for ConvDip (see Appendix 1 left column for an example).…”
Section: Convolutional Neural Network I/o Of Convdipmentioning
confidence: 99%
“…For the basic inpainting processes that we described in the previous paragraph, we tested three methods that had available software implementations. These were based on the fast marching [62], Navier-Stokes [63], and biharmonic [64] algorithms. Even though a quantitative comparison of the color correctness of the results is beyond the scope of this paper, we can state that the three methods create visually consistent and appealing urban footprints for our purpose, i.e., providing an engaging visual context to inform a policy maker or stakeholder of what might happen to a city and its surroundings across time and space.…”
Section: Urban Footprint Estimationmentioning
confidence: 99%