Extracting connectivity paths in digital core images using solution of partial minimum eigenvalue problem

Pub Date : 2023-12-05 DOI:10.1515/rnam-2023-0028
Serguei Yu. Maliassov, Yuri V. Vassilevski
{"title":"Extracting connectivity paths in digital core images using solution of partial minimum eigenvalue problem","authors":"Serguei Yu. Maliassov, Yuri V. Vassilevski","doi":"10.1515/rnam-2023-0028","DOIUrl":null,"url":null,"abstract":"We show theoretically and numerically that the lowest non-trivial eigenvector function for a specific eigenproblem has almost constant values in high conductivity channels, which are different in separate channels. Therefore, based on these distinct values, all separate connected clusters of open pores can be identified in digital cores.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/rnam-2023-0028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We show theoretically and numerically that the lowest non-trivial eigenvector function for a specific eigenproblem has almost constant values in high conductivity channels, which are different in separate channels. Therefore, based on these distinct values, all separate connected clusters of open pores can be identified in digital cores.
分享
查看原文
利用部分最小特征值问题解提取数字岩心图像的连通路径
我们从理论上和数值上证明了一个特定特征问题的最低非平凡特征向量函数在高电导率通道中几乎具有恒定值,而在单独的通道中则不同。因此,基于这些不同的值,可以识别出数字岩心中所有独立连接的开孔簇。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信