A fast and flexible algorithm for microstructure reconstruction combining simulated annealing and deep learning

被引:5
|
作者
Ma, Zhenchuan [1 ]
He, Xiaohai [1 ]
Yan, Pengcheng [1 ]
Zhang, Fan [1 ]
Teng, Qizhi [1 ]
机构
[1] Sichuan Univ, Coll Elect & Informat Engn, Chengdu, Peoples R China
关键词
Microstructure characterization and; reconstruction; Porous media; Stochastic reconstruction; Simulated annealing; Deep learning; FRACTURE PROPERTIES; POROUS-MEDIA; SANDSTONE; MODEL;
D O I
10.1016/j.compgeo.2023.105755
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Microstructural analyses of porous media have considerable research value when studying of macroscopic properties,and the accurate reconstruction of a digital microstructure model is an important component of this research. Computational reconstruction algorithms for microstructures have attracted much attention due to their low cost and excellent performance. However, achieving faster and more efficient reconstruction remains a challenge for computational reconstruction algorithms. The bottleneck lies in the computational reconstruction algorithms themselves, which are either too slow (traditional reconstruction algorithms) or not flexible to the training process (deep learning reconstruction algorithms). To address these limitations, we propose a fast and flexible deep learning algorithm using a neural network based on an improved simulated annealing framework (ISAF-NN). The proposed algorithm adopts structural information of the reference image to guide the network design, and uses the description function to extract feature distribution of the reference image as the objective function to complete the network optimization. Benefit from the network structure is simple and flexible, the proposed algorithm can complete training and reconstruction in a short time. By adjusting the input size, the algorithm can also achieve arbitrary sized reconstruction. The proposed algorithm is experimentally applied to several materials to verify its effectiveness and generalizability.
引用
收藏
页数:22
相关论文
共 50 条
  • [1] Simulated Annealing Algorithm for Deep Learning
    Rere, L. M. Rasdi
    Fanany, Mohamad Ivan
    Arymurthy, Aniati Murni
    THIRD INFORMATION SYSTEMS INTERNATIONAL CONFERENCE 2015, 2015, 72 : 137 - 144
  • [2] Combining the perceptron algorithm with logarithmic simulated annealing
    Albrecht, A
    Wong, CK
    NEURAL PROCESSING LETTERS, 2001, 14 (01) : 75 - 83
  • [3] Combining the Perceptron Algorithm with Logarithmic Simulated Annealing
    A. Albrecht
    C. K. Wong
    Neural Processing Letters, 2001, 14 : 75 - 83
  • [4] A pixel selection rule based on the number of different-phase neighbours for the simulated annealing reconstruction of sandstone microstructure
    Tang, T.
    Teng, Q.
    He, X.
    Luo, D.
    JOURNAL OF MICROSCOPY, 2009, 234 (03) : 262 - 268
  • [5] Combining multiple clusterings using fast simulated annealing
    Lu, Zhiwu
    Peng, Yuxin
    Ip, Horace H. S.
    PATTERN RECOGNITION LETTERS, 2011, 32 (15) : 1956 - 1961
  • [6] A Modified Very Fast Simulated Annealing Algorithm
    Vakil-Baghmisheh, Mohammad-Taghi
    Navarbaf, Afireza
    2008 INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS, VOLS 1 AND 2, 2008, : 61 - 66
  • [7] An improved fast adaptive simulated annealing algorithm
    Pu Zhong-hao
    Wang Lin
    Zhang Lei
    Proceedings of 2006 Chinese Control and Decision Conference, 2006, : 511 - 514
  • [8] Optimizing hyperparameters of deep learning in predicting bus passengers based on simulated annealing
    Tsai, Chun-Wei
    Hsia, Chien-Hui
    Yang, Shuang-Jie
    Liu, Shih-Jui
    Fang, Zhi-Yan
    APPLIED SOFT COMPUTING, 2020, 88
  • [9] A deep reinforcement learning assisted simulated annealing algorithm for a maintenance planning problem
    Kosanoglu, Fuat
    Atmis, Mahir
    Turan, Hasan Huseyin
    ANNALS OF OPERATIONS RESEARCH, 2024, 339 (1-2) : 79 - 110
  • [10] Image reconstruction using simulated annealing algorithm in EIT
    Kim, HC
    Boo, CJ
    Lee, YJ
    INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2005, 3 (02) : 211 - 216