Abstract
To reduce the redundancy of nuclear magnetic resonance (NMR) echo data, kernel principal component analysis (KPCA) is used in the compression. The algorithm of data compression using KPCA is introduced in detail, and the specific calculation process is given. Four commonly used kernel functions are selected: Gaussian kernel, linear kernel, polynomial kernel, and exponential kernel. The compression effect of KPCA based on these four kernel functions on the NMR echo data obtained from complex pore structure formation is compared and analyzed. The study found that: Principal component analysis (PCA) is not suitable for the compression of NMR echo data obtained from the formation with complex pore structure. Compared with PCA, KPCA based on all the four kernels has obvious advantages in computational efficiency. The compression capabilities of KPCA based on Gaussian kernel and exponential kernel are all lower than PCA. The compression capability (CA) of KPCA based on linear kernel is equivalent to PCA. KPCA based on polynomial kernel, when the kernel parameter <inline-formula> <tex-math notation="LaTeX">$\sigma \ge 2$ </tex-math></inline-formula>, its CA is higher than PCA. The compression accuracy of KPCA based on Gaussian kernel, linear kernel, and exponential kernel is stable in the formations with complex pore structure. KPCA based on polynomial kernel is sensitive to the kernel parameter, only when the kernel parameter <inline-formula> <tex-math notation="LaTeX">$\sigma =5$ </tex-math></inline-formula>, the optimal compression accuracy can be obtained. At this time, the optimal compression effect is obtained in the complex pore formation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.