Image inpainting using directional wavelet packets originating from polynomial splines

12 Jan 2020  ·  Amir Averbuch, Pekka Neittaanmaki, Valery Zheludev, Moshe Salhov, Jonathan Hauser ·

The paper presents a new algorithm for the image inpainting problem. The algorithm is using a recently designed versatile library of quasi-analytic complex-valued wavelet packets (qWPs) which originate from polynomial splines of arbitrary orders... Tensor products of 1D qWPs provide a diversity of 2D qWPs oriented in multiple directions. For example, a set of the fourth-level qWPs comprises 62 different directions. The properties of the presented qWPs such as refined frequency resolution, directionality of waveforms with unlimited number of orientations, (anti-)symmetry of waveforms and windowed oscillating structure of waveforms with a variety of frequencies, make them efficient in image processing applications, in particular, in dealing with the inpainting problem addressed in the paper. The obtained results for this problem are quite competitive with the best state-of-the-art algorithms. The inpainting is implemented by an iterative scheme, which, in essence, is the Split Bregman Iteration (SBI) procedure supplied with an adaptive variable soft thresholding based on the Bivariate Shrinkage algorithm. In the inpainting experiments, performance comparison between the qWP-based methods and the state-of-the-art algorithms is presented. read more

PDF Abstract
No code implementations yet. Submit your code now

Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here