Abstract

AbstractThe basic assumption of low‐rank methods is that noise‐free seismic data can be represented as a low‐rank matrix. Effective noise reduction can be achieved through the low‐rank approximation of Hankel matrices composed of the data. However, selecting the appropriate rank parameter and avoiding expensive singular value decomposition are two challenges that have limited the practical application of this method. In this paper, we first propose symplectic geometric decomposition that avoids singular value decomposition. The symplectic similarity transformation preserves the essence of the original time sequence as well as the signal's basic characteristics and maintains the approximation of the Hankel matrix. To select an appropriate rank, we construct the symplectic geometric entropy according to the distribution of eigenvalues and search for high‐contributing eigenvalues to determine the needed rank parameter. Therefore, we provide an adaptive approach to selecting the rank parameter by the symplectic geometric entropy method. The synthetic examples and field data results show that our method significantly improves the computational efficiency while adaptively retaining more effective signals in complex structures. Therefore, this method has practical application value.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call