Image completion with approximate convex hull tensor decomposition

Author(s):  
Rafał Zdunek ◽  
Tomasz Sadowski
2020 ◽  
Vol 10 (3) ◽  
pp. 797 ◽  
Author(s):  
Rafał Zdunek ◽  
Tomasz Sadowski

The issue of image completion has been developed considerably over the last two decades, and many computational strategies have been proposed to fill-in missing regions in an incomplete image. When the incomplete image contains many small-sized irregular missing areas, a good alternative seems to be the matrix or tensor decomposition algorithms that yield low-rank approximations. However, this approach uses heuristic rank adaptation techniques, especially for images with many details. To tackle the obstacles of low-rank completion methods, we propose to model the incomplete images with overlapping blocks of Tucker decomposition representations where the factor matrices are determined by a hybrid version of the Gaussian radial basis function and polynomial interpolation. The experiments, carried out for various image completion and resolution up-scaling problems, demonstrate that our approach considerably outperforms the baseline and state-of-the-art low-rank completion methods.


1989 ◽  
Vol 136 (6) ◽  
pp. 530
Author(s):  
G.R. Wilson ◽  
B.G. Batchelor
Keyword(s):  

2019 ◽  
Vol 31 (5) ◽  
pp. 761
Author(s):  
Xiao Lin ◽  
Zuxiang Liu ◽  
Xiaomei Zheng ◽  
Jifeng Huang ◽  
Lizhuang Ma

2019 ◽  
Vol 82 ◽  
pp. 16-31 ◽  
Author(s):  
Jie Xue ◽  
Yuan Li ◽  
Ravi Janardan
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document