The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functio...The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functions has an influence on denoising results. We propose a learning-type overcomplete dictionary based on the K-singular value decomposition( K-SVD) algorithm. To construct the dictionary and use it for random seismic noise attenuation,we replace fixed transform base functions with an overcomplete redundancy function library. Owing to the adaptability to data characteristics,the learning-type dictionary describes essential data characteristics much better than conventional denoising methods. The sparsest representation of signals is obtained by the learning and training of seismic data. By comparing the same seismic data obtained using the learning-type overcomplete dictionary based on K-SVD and the data obtained using other denoising methods,we find that the learning-type overcomplete dictionary based on the K-SVD algorithm represents the seismic data more sparsely,effectively suppressing the random noise and improving the signal-to-noise ratio.展开更多
NMR logging can provide the permeability parameter and abundant stratigraphical information such as total porosity,oil,gas and water saturation,oil viscosity,etc. And these physical parameters can be obtained by T2 sp...NMR logging can provide the permeability parameter and abundant stratigraphical information such as total porosity,oil,gas and water saturation,oil viscosity,etc. And these physical parameters can be obtained by T2 spectrum inversion. NMR inversion is an important part in logging interpretation. The authors describe a multi-exponential inversion algorithm,solid iteration redress technique( SIRT),and apply the algorithm in real data and compare the results with those based on singular value decomposition( SVD). It shows that SIRT algorithm is easier to be understood and implemented,and the time spent in SIRT is much shorter than that of SVD algorithm. And the non-negative property of T2 spectrum is much easier to be implemented. It can match the results based on SVD very well. SIRT algorithm can be used in T2 spectrum inversion for NMR analysis.展开更多
Partial eigenvalue decomposition(PEVD) and partial singular value decomposition(PSVD) of large sparse matrices are of fundamental importance in a wide range of applications, including latent semantic indexing, spectra...Partial eigenvalue decomposition(PEVD) and partial singular value decomposition(PSVD) of large sparse matrices are of fundamental importance in a wide range of applications, including latent semantic indexing, spectral clustering, and kernel methods for machine learning. The more challenging problems are when a large number of eigenpairs or singular triplets need to be computed. We develop practical and efficient algorithms for these challenging problems. Our algorithms are based on a filter-accelerated block Davidson method.Two types of filters are utilized, one is Chebyshev polynomial filtering, the other is rational-function filtering by solving linear equations. The former utilizes the fastest growth of the Chebyshev polynomial among same degree polynomials; the latter employs the traditional idea of shift-invert, for which we address the important issue of automatic choice of shifts and propose a practical method for solving the shifted linear equations inside the block Davidson method. Our two filters can efficiently generate high-quality basis vectors to augment the projection subspace at each Davidson iteration step, which allows a restart scheme using an active projection subspace of small dimension. This makes our algorithms memory-economical, thus practical for large PEVD/PSVD calculations. We compare our algorithms with representative methods, including ARPACK, PROPACK, the randomized SVD method, and the limited memory SVD method. Extensive numerical tests on representative datasets demonstrate that, in general, our methods have similar or faster convergence speed in terms of CPU time, while requiring much lower memory comparing with other methods. The much lower memory requirement makes our methods more practical for large-scale PEVD/PSVD computations.展开更多
基金Supported by the National"863"Project(No.2014AA06A605)
文摘The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functions has an influence on denoising results. We propose a learning-type overcomplete dictionary based on the K-singular value decomposition( K-SVD) algorithm. To construct the dictionary and use it for random seismic noise attenuation,we replace fixed transform base functions with an overcomplete redundancy function library. Owing to the adaptability to data characteristics,the learning-type dictionary describes essential data characteristics much better than conventional denoising methods. The sparsest representation of signals is obtained by the learning and training of seismic data. By comparing the same seismic data obtained using the learning-type overcomplete dictionary based on K-SVD and the data obtained using other denoising methods,we find that the learning-type overcomplete dictionary based on the K-SVD algorithm represents the seismic data more sparsely,effectively suppressing the random noise and improving the signal-to-noise ratio.
文摘NMR logging can provide the permeability parameter and abundant stratigraphical information such as total porosity,oil,gas and water saturation,oil viscosity,etc. And these physical parameters can be obtained by T2 spectrum inversion. NMR inversion is an important part in logging interpretation. The authors describe a multi-exponential inversion algorithm,solid iteration redress technique( SIRT),and apply the algorithm in real data and compare the results with those based on singular value decomposition( SVD). It shows that SIRT algorithm is easier to be understood and implemented,and the time spent in SIRT is much shorter than that of SVD algorithm. And the non-negative property of T2 spectrum is much easier to be implemented. It can match the results based on SVD very well. SIRT algorithm can be used in T2 spectrum inversion for NMR analysis.
基金supported by National Science Foundation of USA (Grant Nos. DMS1228271 and DMS-1522587)National Natural Science Foundation of China for Creative Research Groups (Grant No. 11321061)+1 种基金the National Basic Research Program of China (Grant No. 2011CB309703)the National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Sciences
文摘Partial eigenvalue decomposition(PEVD) and partial singular value decomposition(PSVD) of large sparse matrices are of fundamental importance in a wide range of applications, including latent semantic indexing, spectral clustering, and kernel methods for machine learning. The more challenging problems are when a large number of eigenpairs or singular triplets need to be computed. We develop practical and efficient algorithms for these challenging problems. Our algorithms are based on a filter-accelerated block Davidson method.Two types of filters are utilized, one is Chebyshev polynomial filtering, the other is rational-function filtering by solving linear equations. The former utilizes the fastest growth of the Chebyshev polynomial among same degree polynomials; the latter employs the traditional idea of shift-invert, for which we address the important issue of automatic choice of shifts and propose a practical method for solving the shifted linear equations inside the block Davidson method. Our two filters can efficiently generate high-quality basis vectors to augment the projection subspace at each Davidson iteration step, which allows a restart scheme using an active projection subspace of small dimension. This makes our algorithms memory-economical, thus practical for large PEVD/PSVD calculations. We compare our algorithms with representative methods, including ARPACK, PROPACK, the randomized SVD method, and the limited memory SVD method. Extensive numerical tests on representative datasets demonstrate that, in general, our methods have similar or faster convergence speed in terms of CPU time, while requiring much lower memory comparing with other methods. The much lower memory requirement makes our methods more practical for large-scale PEVD/PSVD computations.
