Table of Contents
Fetching ...

Wavelet Burst Accumulation for turbulence mitigation

Jerome Gilles, Stanley Osher

TL;DR

This work investigates the extension of the recently proposed weighted Fourier burst accumulation method into the wavelet domain and suggests replacing the rigid registration step used in the original algorithm with a nonrigid registration in order to process sequences acquired through atmospheric turbulence.

Abstract

In this paper, we investigate the extension of the recently proposed weighted Fourier burst accumulation (FBA) method into the wavelet domain. The purpose of FBA is to reconstruct a clean and sharp image from a sequence of blurred frames. This concept lies in the construction of weights to amplify dominant frequencies in the Fourier spectrum of each frame. The reconstructed image is then obtained by taking the inverse Fourier transform of the average of all processed spectra. In this paper, we first suggest to replace the rigid registration step used in the original algorithm by a non-rigid registration in order to be able to process sequences acquired through atmospheric turbulence. Second, we propose to work in a wavelet domain instead of the Fourier one. This leads us to the construction of two types of algorithms. Finally, we propose an alternative approach to replace the weighting idea by an approach promoting the sparsity in the used space. Several experiments are provided to illustrate the efficiency of the proposed methods.

Wavelet Burst Accumulation for turbulence mitigation

TL;DR

This work investigates the extension of the recently proposed weighted Fourier burst accumulation method into the wavelet domain and suggests replacing the rigid registration step used in the original algorithm with a nonrigid registration in order to process sequences acquired through atmospheric turbulence.

Abstract

In this paper, we investigate the extension of the recently proposed weighted Fourier burst accumulation (FBA) method into the wavelet domain. The purpose of FBA is to reconstruct a clean and sharp image from a sequence of blurred frames. This concept lies in the construction of weights to amplify dominant frequencies in the Fourier spectrum of each frame. The reconstructed image is then obtained by taking the inverse Fourier transform of the average of all processed spectra. In this paper, we first suggest to replace the rigid registration step used in the original algorithm by a non-rigid registration in order to be able to process sequences acquired through atmospheric turbulence. Second, we propose to work in a wavelet domain instead of the Fourier one. This leads us to the construction of two types of algorithms. Finally, we propose an alternative approach to replace the weighting idea by an approach promoting the sparsity in the used space. Several experiments are provided to illustrate the efficiency of the proposed methods.

Paper Structure

This paper contains 10 sections, 19 equations, 9 figures, 1 table.

Figures (9)

  • Figure 1: Original sequences: Barchart 1 (top row), Barchart 2 (middle row), Barchart 3 (bottom row). The consecutive columns correspond to the frames 1 and 25, respectively.
  • Figure 2: Restoration results on Barchart 1 sequence (50 frames) without non-rigid registration and $p=11$ (without any final denoising or sharpening step).
  • Figure 3: Restoration results on Barchart 2 sequence (50 frames) without non-rigid registration and $p=11$ (without any final denoising or sharpening step).
  • Figure 4: Restoration results on Barchart 3 sequence (50 frames) without non-rigid registration and $p=11$ (without any final denoising or sharpening step).
  • Figure 5: Restoration results on Barchart 1 sequence (50 frames) with non-rigid registration and $p=11$ (without any final denoising or sharpening step).
  • ...and 4 more figures