IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v15y2022i19p7016-d924180.html
   My bibliography  Save this article

A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir

Author

Listed:
  • Ren Jiang

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Zhifeng Ji

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Wuling Mo

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Suhua Wang

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Mingjun Zhang

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Wei Yin

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Zhen Wang

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Yaping Lin

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Xueke Wang

    (Research Institute of Petroleum Exploration and Development, PetroChina, Beijing 100083, China)

  • Umar Ashraf

    (Institute for Ecological Research and Pollution Control of Plateau Lakes, School of Ecology and Environmental Science, Yunnan University, Kunming 650500, China)

Abstract

Shear velocity is an important parameter in pre-stack seismic reservoir description. However, in the real study, the high cost of array acoustic logging leads to lacking a shear velocity curve. Thus, it is crucial to use conventional well-logging data to predict shear velocity. The shear velocity prediction methods mainly include empirical formulas and theoretical rock physics models. When using the empirical formula method, calibration should be performed to fit the local data, and its accuracy is low. When using rock physics modeling, many parameters about the pure mineral must be optimized simultaneously. We present a deep learning method to predict shear velocity from several conventional logging curves in tight sandstone of the Sichuan Basin. The XGBoost algorithm has been used to automatically select the feature curves as the model’s input after quality control and cleaning of the input data. Then, we construct a deep-feed neuro network model (DFNN) and decompose the whole model training process into detailed steps. During the training process, parallel training and testing methods were used to control the reliability of the trained model. It was found that the prediction accuracy is higher than the empirical formula and the rock physics modeling method by well validation.

Suggested Citation

  • Ren Jiang & Zhifeng Ji & Wuling Mo & Suhua Wang & Mingjun Zhang & Wei Yin & Zhen Wang & Yaping Lin & Xueke Wang & Umar Ashraf, 2022. "A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir," Energies, MDPI, vol. 15(19), pages 1-20, September.
  • Handle: RePEc:gam:jeners:v:15:y:2022:i:19:p:7016-:d:924180
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/15/19/7016/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/15/19/7016/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. NESTEROV, Yurii, 2013. "Gradient methods for minimizing composite functions," LIDAM Reprints CORE 2510, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Mazahir Hussain & Shuang Liu & Umar Ashraf & Muhammad Ali & Wakeel Hussain & Nafees Ali & Aqsa Anees, 2022. "Application of Machine Learning for Lithofacies Prediction and Cluster Analysis Approach to Identify Rock Type," Energies, MDPI, vol. 15(12), pages 1-15, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gang Hui & Fei Gu & Junqi Gan & Erfan Saber & Li Liu, 2023. "An Integrated Approach to Reservoir Characterization for Evaluating Shale Productivity of Duvernary Shale: Insights from Multiple Linear Regression," Energies, MDPI, vol. 16(4), pages 1-18, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kaiwen Ma & Nikolaos V. Sahinidis & Sreekanth Rajagopalan & Satyajith Amaran & Scott J Bury, 2021. "Decomposition in derivative-free optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 269-292, October.
    2. Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
    3. A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
    4. Zhaosong Lu & Xiaojun Chen, 2018. "Generalized Conjugate Gradient Methods for ℓ 1 Regularized Convex Quadratic Programming with Finite Convergence," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 275-303, February.
    5. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
    6. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Masoud Ahookhosh, 2019. "Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 319-353, June.
    8. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    9. Dewei Zhang & Yin Liu & Sam Davanloo Tajbakhsh, 2022. "A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1126-1140, March.
    10. Weibin Mo & Yufeng Liu, 2022. "Efficient learning of optimal individualized treatment rules for heteroscedastic or misspecified treatment‐free effect models," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 440-472, April.
    11. Liu, Yulan & Bi, Shujun, 2019. "Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 418-435.
    12. Sun, Shilin & Wang, Tianyang & Yang, Hongxing & Chu, Fulei, 2022. "Damage identification of wind turbine blades using an adaptive method for compressive beamforming based on the generalized minimax-concave penalty function," Renewable Energy, Elsevier, vol. 181(C), pages 59-70.
    13. Saif Eddin Jabari & Nikolaos M. Freris & Deepthi Mary Dilip, 2020. "Sparse Travel Time Estimation from Streaming Data," Transportation Science, INFORMS, vol. 54(1), pages 1-20, January.
    14. Ching-pei Lee & Stephen J. Wright, 2019. "Inexact Successive quadratic approximation for regularized optimization," Computational Optimization and Applications, Springer, vol. 72(3), pages 641-674, April.
    15. Le Thi Khanh Hien & Cuong V. Nguyen & Huan Xu & Canyi Lu & Jiashi Feng, 2019. "Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 541-566, May.
    16. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
    17. Min Li & Xiaoming Yuan, 2015. "A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 842-858, October.
    18. Reza Eghbali & Maryam Fazel, 2017. "Decomposable norm minimization with proximal-gradient homotopy algorithm," Computational Optimization and Applications, Springer, vol. 66(2), pages 345-381, March.
    19. Nafees Ali & Xiaodong Fu & Umar Ashraf & Jian Chen & Hung Vo Thanh & Aqsa Anees & Muhammad Shahid Riaz & Misbah Fida & Muhammad Afaq Hussain & Sadam Hussain & Wakeel Hussain & Awais Ahmed, 2022. "Remote Sensing for Surface Coal Mining and Reclamation Monitoring in the Central Salt Range, Punjab, Pakistan," Sustainability, MDPI, vol. 14(16), pages 1-26, August.
    20. NESTEROV, Yu. & SHIKHMAN, Vladimir, 2014. "Convergent subgradient methods for nonsmooth convex minimization," LIDAM Discussion Papers CORE 2014005, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:15:y:2022:i:19:p:7016-:d:924180. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.