Low-rank promoting transformations and tensor interpolation - applications to seismic data denoising

In this presentation, we extend our previous work in Hierarchical Tucker (HT) tensor completion, which uses an extremely efficient representation for representing high-dimensional tensors exhibiting low-rank structure, to handle subsampled tensors with noisy entries. We consider a `low-noise' case, so that the energies of the noise and the signal are nearly indistinguishable, and a `high-noise' case, in which the noise energy is now scaled to the amplitude of the entire data volume. For the low-noise case in particular, standard trace-by-trace energy comparisons cannot distinguish noise from signal. We examine the behaviour of noise in terms of the singular values along different matricizations of the data, i.e. reshaping of the tensor along different dimensions. By interpreting this effect in the context of tensor completion, we demonstrate the inefficacy of denoising by this method in the source-receiver domain. In light of this observation, we transform the decimated, noisy data in to the midpoint-offset domain, which promotes low-rank behaviour in the signal and high-rank behaviour in the noise. This distinction between signal and noise allows low-rank interpolation to effectively denoise the signal, without knowledge of the noise location, with only a marginal increase in computational cost. We demonstrate the effectiveness of this approach on a 4D frequency slice.