AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (17.1 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Publishing Language: Chinese | Open Access

Accelerated random noise suppression of seismic data using compressed singular-value decomposition

Chao SUN1, Peng LIN2( ), Yulin LIU2, Xiudong WANG1, Dongjing XU3
Shandong Provincial Research Institute of Coal Geology Planning and Exploration, Jinan Shandong 250104, China
School of Geoscience and Surveying Engineering, China University of Mining Technology-Beijing, Beijing 100083, China
College of Earth Science and Engineering, Shandong University of Science and Technology, Qingdao Shandong 266590, China
Show Author Information

Abstract

Random noise is one of the common background noises in seismic data, and its attenuation will directly affect the signal-to-noise ratio of seismic data, which is of great significance to improve the quality of seismic data. Low-rank approximation technique is a commonly used method to suppress random noise of seismic data. It converts frequency spatial domain data into the form of Hanke matrix, and uses singular value decomposition technique to reconstruct data by retaining large singular values, so as to achieve the purpose of rank reduction and suppress random noise. The method takes advantage of the low-rank nature of noiseless seismic data, which can be destroyed in the presence of random noise. However, traditional singular value decomposition technology has low computational efficiency, and seismic data generally consist of a large amount of datasets, so traditional singular value decomposition technology will inevitably lead to a large increase in time cost. In order to improve the efficiency of random noise suppression, a new singular value decomposition technique based on compressed sensing theory is proposed. The sparse representation of data is considered in the calculation of singular values, and the sparse representation of data is used to approximate the solution of high-dimensional singular vectors and singular values, so as to improve the accuracy and computational efficiency of singular value decomposition. Compressed sensing theory makes full use of data sparsity, avoids direct processing of original high-dimensional data, and theoretically has high computational efficiency. Three-dimensional synthetic seismic records and field data examples are used to verify the validity and practicability of the proposed method, and comparisons with traditional and random singular value decomposition techniques are performed. The results show that the improved low-rank approximation technique can effectively suppress random noise in seismic data, and the effective signal can be enhanced and highlighted. Compared with traditional and random singular value decomposition, the compressed singular value decomposition technique has higher computational efficiency and can greatly save time cost. Low-rank approximation technology based on compressed singular value decomposition has better performance than other methods in random noise suppression and can further improve the signal-to-noise ratio.

CLC number: TD163.1 Document code: A Article ID: 2096-2193(2025)01-0105-11

References

【1】
【1】
 
 
Journal of Mining Science and Technology
Pages 105-115

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
SUN C, LIN P, LIU Y, et al. Accelerated random noise suppression of seismic data using compressed singular-value decomposition. Journal of Mining Science and Technology, 2025, 10(1): 105-115. https://doi.org/10.19606/j.cnki.jmst.2024934

1164

Views

8

Downloads

0

Crossref

2

Scopus

1

CSCD

Received: 04 July 2024
Revised: 25 November 2024
Published: 28 February 2025
© The Author(s) 2025

This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).