Multidirectional slowness vector for computing angle gathers from reverse time migration

Abstract

Angle gathers are important for true-amplitude migration, migration velocity analysis, and angle-dependent inversion. Among existing methods, calculating the [Formula: see text] direction vector is efficient, but it can give only one direction per grid point and fails to give multiple directions for overlapping wavefields associated with multipaths and reflections. The slowness vectors (SVs) in [Formula: see text] and [Formula: see text] can be connected by Fourier transforms (FTs); the forward FT from [Formula: see text] to [Formula: see text] decomposes the wavefields into different vector components, and the inverse FT sums these components into a unique direction. Therefore, the SV has multiple directions in [Formula: see text], but it has only one direction in [Formula: see text]. Based on this relation, we have separated the computation of propagation direction into two steps: First, we used the forward FT, [Formula: see text] binning, and several inverse FTs to separate the wavefields into vector subsets with different approximate propagation angles, which contained much less wave overlapping; then, we computed [Formula: see text] SVs for each separated wavefield, and the set of these single-direction SVs constituted a multidirectional SV (MSV). In this process, the FTs between [Formula: see text] and [Formula: see text] domains required a large input/output (I/O) time. We prove the conjugate relation between the decomposition results using positive- and negative-frequency wavefields, and we use complex-valued modeling to obtain the positive-frequency wavefields. Thus, we did wavefield decomposition in [Formula: see text] instead of [Formula: see text], and avoided the huge I/O caused by the FT between the [Formula: see text] and [Formula: see text] domains. Our tests demonstrated that the MSV can give multiple directions for overlapping wavefields and improve the quality of angle gathers.