Structure-oriented SVD

The structure-oriented SVD (SOSVD) refers to two processes: flattening along the local structure in a local spatial window and applying GSVD in the flattened local spatial window. The procedures can be summarized as:

$\displaystyle \mathbf{D} \rightarrow \mathbf{D}_j^R (j=1,2,\cdots,N) \rightarro...
...overline{D}}_j^R \rightarrow \mathbf{d}_j \rightarrow \hat{\mathbf{D}}_{sosvd}.$ (6)

Here, $\mathbf{D}_j^R$ denotes the $j$th spatial window (corresponding to $j$th trace) with a radius of $R$, $\overline{\mathbf{D}}_j^R$ denotes the flattened local spatial window, $\overline{\overline{D}}_j^R$ denotes the SVD denoised local spatial window, $\mathbf{d}_j$ denotes the averaged local spatial window, and $\hat{\mathbf{D}}_{sosvd}$ denotes the output data using SOSVD.

As we can see from the workflow, the key step that distinguishes SOSVD with other types of SVD approaches is the flattening in the local spatial window. The flattening corresponds to applying a flattening operator to the data (here we use a prediction operator according to local slope) so that the output data have horizontal events:

$\displaystyle \mathbf{P}_j \mathbf{D}_j^R= \overline{\mathbf{D}}_j^R.$ (7)

where $\mathbf{P}_j$ is the $j$th flattening operator. Here, the flattening operator is chosen as a plane-wave prediction operator related with the local slope. Equation 7 has the following detailed form:

& \left[
...}_{1+R,j}, \cdots, \overline{\mathbf{d}}_{1+2R,j}].
\end{split}\end{displaymath} (8)

Here, $\mathbf{P}_{(i,j)\rightarrow(k,j)}(\sigma_{i,j})$ denotes the prediction operator from trace $i$ to trace $k$ in $j$th spatial window, which is connected with the local slope of $i$th trace. Prediction of a trace consists of shifting the original trace along dominant event slopes (Fomel, 2010). Prediction of a trace from a distant neighbour can be accomplished by simple recursion (Liu et al., 2010), i.e., predicting trace $k$ from trace $1$ is simply

$\displaystyle \mathbf{P}_{(1,j)\rightarrow(k,j)} (\sigma_{1,j})= \mathbf{P}_{(k...
...rightarrow(3,j)}(\sigma_{2,j})\mathbf{P}_{(1,j)\rightarrow(2,j)}(\sigma_{1,j}).$ (9)

The prediction operator is a numerical solution of the local plane differential equation

$\displaystyle \frac{\partial P}{\partial x} + \sigma \frac{\partial P}{\partial t} = 0,$ (10)

for local plane wave propagation in the $x$ direction.

The dominant slopes are estimated by solving the following least-square minimization problem using regularized least-squares optimization:

$\displaystyle \hat{\mathbf{\sigma}} = \arg\min_{\sigma} \parallel \mathbf{W}(\sigma)\mathbf{D} \parallel_2^2,$ (11)

where $\mathbf{W}$ is the destruction operator defined as

\mathbf{W} = \left[
\mathbf{I} & 0 & 0...
...hbf{P}}_{N-1\rightarrow N} & \mathbf{I}

where $\mathbf{I}$ stands for the identity operator, and $\mathcal{\mathbf{P}}_{i\rightarrow k}$ describes prediction of trace $k$ from trace $i$ (same as the previous version $\mathbf{P}_{(i,j)\rightarrow(k,j)}(\sigma_{i,j})$ except for not in a specific spatial window). The optimization approach as shown in equation 11 for obtaining local slope estimation is called plane wave destruction (PWD) (Fomel, 2002).