奇异值分解
低秩近似
秩(图论)
基质(化学分析)
排
张量(固有定义)
算法
过采样
矩阵分解
数学
应用数学
计算机科学
组合数学
几何学
特征向量
物理
量子力学
数据库
计算机网络
复合材料
材料科学
带宽(计算)
作者
Quézia Cavalcante,Milton J. Porsani
标识
DOI:10.1111/1365-2478.13163
摘要
ABSTRACT Low‐rank reconstruction methods assume that noiseless and complete seismic data can be represented as low‐rank matrices or tensors. Therefore, denoising and recovery of missing traces require a reduced‐rank approximation of the data matrix/tensor. To calculate such approximation, we explore the CUR matrix decompositions, which use actual columns and rows of the data matrix, instead of the costly singular vectors derived from singular value decomposition. By allowing oversampling columns and rows, CUR decompositions obviate the need for the exact rank. We evaluate three different procedures for randomly selecting columns and rows to obtain the CUR. Once the low‐rank approximation is estimated, data reconstruction is achieved by an iterative optimization scheme. To demonstrate the effectiveness of CUR matrix decompositions for multidimensional seismic data recovery, we present examples of 3D and 4D synthetic and field data. Results derived by CUR compare well to conventional eigenimage‐family methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI