d="p-1">A patch of prestack data depends on four spatial dimensions (d="inline-formula-1">de class="mathjax-code"><mml:math><mml:mi>x</mml:mi></mml:math>de>x, d="inline-formula-2">de class="mathjax-code"><mml:math><mml:mi>y</mml:mi></mml:math>de>y midpoints and d="inline-formula-3">de class="mathjax-code"><mml:math><mml:mi>x</mml:mi></mml:math>de>x, d="inline-formula-4">de class="mathjax-code"><mml:math><mml:mi>y</mml:mi></mml:math>de>y offsets) and frequency. The spatial data at one temporal frequency can be represented by a fourth-order tensor. In ideal conditions of high signal-to-noise ratio and complete sampling, one can assume that the seismic data can be approximated via a low-rank fourth-order tensor. Missing samples were recovered by reinserting data obtained by approximating the original noisy and incomplete data volume with new observations obtained via the rank-reduction process. The higher-order singular value decompostion was used to reduce the rank of the prestack seismic tensor. Synthetic data demonstrated the ability of the proposed seismic data completion algorithm to reconstruct events with curvature. The synthetic example allowed to quantify the quality of the reconstruction for different levels of noise and survey sparsity. We also provided a real data example from the Western Canadian sedimentary basin.
