Distance-preserving manifold denoising for data-driven mechanics

被引:5
|
作者
Bahmani, Bahador [1 ]
Sun, WaiChing [1 ]
机构
[1] Columbia Univ, Dept Civil Engn & Engn Mech, 614 SW Mudd,Mail Code 4709, New York, NY 10027 USA
基金
美国国家科学基金会;
关键词
Data-driven mechanics; Manifold de-noising; Geodesic; Constitutive manifold; Autoencoder; Isometry;
D O I
10.1016/j.cma.2022.115857
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This article introduces an isometric manifold embedding data-driven paradigm designed to enable model-free simulations with noisy data sampled from a constitutive manifold. The proposed data-driven approach iterates between a global optimization problem that seeks admissible solutions for the balance principle and a local optimization problem that finds the closest point projection of the Euclidean space that isometrically embeds a nonlinear constitutive manifold. To de-noise the database, a geometric autoencoder is introduced such that the encoder first learns to create an approximated embedding that maps the underlying low-dimensional structure of the high-dimensional constitutive manifold onto a flattened manifold with less curvature. We then obtain the noise-free constitutive responses by projecting data onto a denoised latent space that is completely flat by assuming that the noise and the underlying constitutive signal are orthogonal to each other. Consequently, a projection from the conservative manifold onto this de-noised constitutive latent space enables us to complete the local optimization step of the data-driven paradigm. Finally, to decode the data expressed in the latent space without reintroducing noise, we impose a set of isometry constraints while training the autoencoder such that the nonlinear mapping from the latent space to the reconstructed constituent manifold is distance-preserving. Numerical examples are used to both validate the implementation and demonstrate the accuracy, robustness, and limitations of the proposed paradigm.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:33
相关论文
共 50 条
  • [31] Minimizing Branching Vertices in Distance-Preserving Subgraphs
    Gajjar, Kshitij
    Radhakrishnan, Jaikumar
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 131 - 142
  • [32] Numerical radius distance-preserving maps on B(H)
    Bai, ZF
    Hou, JC
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2004, 132 (05) : 1453 - 1461
  • [33] Distance-preserving mappings from binary vectors to permutations
    Chang, JC
    Chen, RJ
    Klove, T
    Tsai, SC
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) : 1054 - 1059
  • [34] Data-driven probability concentration and sampling on manifold
    Soize, C.
    Ghanem, R.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2016, 321 : 242 - 258
  • [35] Data-driven denoising of stationary accelerometer signals
    Engelsman, Daniel
    Klein, Itzik
    MEASUREMENT, 2023, 218
  • [36] Data-Driven multiscale modeling in mechanics
    Karapiperis, K.
    Stainier, L.
    Ortiz, M.
    Andrade, J. E.
    JOURNAL OF THE MECHANICS AND PHYSICS OF SOLIDS, 2021, 147
  • [37] Data-Driven games in computational mechanics
    Weinberg, K.
    Stainier, L.
    Conti, S.
    Ortiz, M.
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2023, 417
  • [38] Consistent Data-Driven Computational Mechanics
    Gonzalez, D.
    Chinesta, F.
    Cueto, E.
    PROCEEDINGS OF 21ST INTERNATIONAL ESAFORM CONFERENCE ON MATERIAL FORMING (ESAFORM 2018), 2018, 1960
  • [39] Distance-Preserving Vector Space Embedding for Consensus Learning
    Nienkotter, Andreas
    Jiang, Xiaoyi
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2021, 51 (02): : 1244 - 1257
  • [40] On distance-preserving elimination orderings in graphs: Complexity and algorithms
    Coudert, David
    Ducoffe, Guillaume
    Nisse, Nicolas
    Soto, Mauricio
    DISCRETE APPLIED MATHEMATICS, 2018, 243 : 140 - 153