Polygon reconstruction from moments using array processing

P. Milanfar, G. Verghese, W. Karl, A. Willsky
{"title":"Polygon reconstruction from moments using array processing","authors":"P. Milanfar, G. Verghese, W. Karl, A. Willsky","doi":"10.1109/DSP.1994.379852","DOIUrl":null,"url":null,"abstract":"We prove a set of results showing that the vertices of any simply-connected planar polygonal region can be reconstructed from a finite number of its complex moments using array processing. In particular, we derive and illustrate several new algorithms for the reconstruction of the vertices of simply-connected polygons from moments. These results find applications in a variety of apparently disparate areas such as computerized tomography and inverse potential theory, where in the former it is of interest in estimating the shape of an object from a finite number of its projections; while in the latter, the objective is to extract the shape of a gravitating body from measurements of its exterior logarithmic potentials at a finite number of points. The applications of the algorithms, we develop, to tomography hence expose a seemingly deep connection between the fields of tomography and array processing. This connection implies that a host of numerical algorithms such as MUSIC, Min-norm, and Prony are now available for application to tomographic reconstruction problems.<<ETX>>","PeriodicalId":189083,"journal":{"name":"Proceedings of IEEE 6th Digital Signal Processing Workshop","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 6th Digital Signal Processing Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSP.1994.379852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We prove a set of results showing that the vertices of any simply-connected planar polygonal region can be reconstructed from a finite number of its complex moments using array processing. In particular, we derive and illustrate several new algorithms for the reconstruction of the vertices of simply-connected polygons from moments. These results find applications in a variety of apparently disparate areas such as computerized tomography and inverse potential theory, where in the former it is of interest in estimating the shape of an object from a finite number of its projections; while in the latter, the objective is to extract the shape of a gravitating body from measurements of its exterior logarithmic potentials at a finite number of points. The applications of the algorithms, we develop, to tomography hence expose a seemingly deep connection between the fields of tomography and array processing. This connection implies that a host of numerical algorithms such as MUSIC, Min-norm, and Prony are now available for application to tomographic reconstruction problems.<>
使用数组处理从矩多边形重建
我们证明了一组结果,表明任何单连通平面多边形区域的顶点都可以用有限个复矩来重构。特别地,我们推导并说明了几种从矩重建单连通多边形顶点的新算法。这些结果在各种明显不同的领域得到应用,如计算机断层扫描和逆势理论,在前者中,它的兴趣在于从有限数量的投影估计物体的形状;而在后者中,目标是从有限数量点的外部对数势的测量中提取重力物体的形状。我们开发的算法应用于断层扫描,因此暴露了断层扫描和阵列处理领域之间看似深刻的联系。这种联系意味着许多数值算法,如MUSIC, Min-norm和proony,现在可用于层析重建问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信