Phase Image Decoding Algorithm for Three-Dimensional Geometry Measurements of Dynamic Objects

IF 0.58 Q3 Engineering
S. V. Dvoinishnikov, D. V. Kulikov, V. G. Meledin, V. V. Rakhmanov
{"title":"Phase Image Decoding Algorithm for Three-Dimensional Geometry Measurements of Dynamic Objects","authors":"S. V. Dvoinishnikov,&nbsp;D. V. Kulikov,&nbsp;V. G. Meledin,&nbsp;V. V. Rakhmanov","doi":"10.1134/S1990478923020072","DOIUrl":null,"url":null,"abstract":"<p> We propose an algorithm for decoding phase images that has algorithmic complexity\n<span>\\( O(N\\log N) \\)</span>. The method is based on an iterative search for the minimum deviation of\nthe model function from the measurement results. The use of an interval search algorithm\npermitted considerably reducing the computational complexity of the algorithm. The error of the\nproposed method is comparable to the error of the phase image decoding method based on the\nanalytical solution of the system of equations describing the intensity in the phase images.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 2","pages":"291 - 295"},"PeriodicalIF":0.5800,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478923020072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

We propose an algorithm for decoding phase images that has algorithmic complexity \( O(N\log N) \). The method is based on an iterative search for the minimum deviation of the model function from the measurement results. The use of an interval search algorithm permitted considerably reducing the computational complexity of the algorithm. The error of the proposed method is comparable to the error of the phase image decoding method based on the analytical solution of the system of equations describing the intensity in the phase images.

Abstract Image

动态物体三维几何测量的相位图像解码算法
我们提出了一种具有算法复杂度的相位图像解码算法\( O(N\log N) \)。该方法基于对模型函数与测量结果的最小偏差的迭代搜索。区间搜索算法的使用大大降低了算法的计算复杂度。该方法的误差与基于相位图像中描述强度的方程组解析解的相位图像解码方法的误差相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Applied and Industrial Mathematics
Journal of Applied and Industrial Mathematics Engineering-Industrial and Manufacturing Engineering
CiteScore
1.00
自引率
0.00%
发文量
16
期刊介绍: Journal of Applied and Industrial Mathematics  is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.
×
引用
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学术官方微信