超立方体计算机上的图像重建

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI:10.1109/FMPC.1990.89448

E. Zapata, I. Benavides, F. F. Rivera, J. Bruguera, J. Carazo

{"title":"超立方体计算机上的图像重建","authors":"E. Zapata, I. Benavides, F. F. Rivera, J. Bruguera, J. Carazo","doi":"10.1109/FMPC.1990.89448","DOIUrl":null,"url":null,"abstract":"The problem of the 3-D reconstruction of an object from its 2-D projection images using filtered backprojection is addressed. The implementation of the filtered backprojection method on hypercube computers is analyzed. It is shown that the parallel algorithm is general in the sense that it does not impose any restriction on the problem space dimensions and is adaptable to any hypercube dimension. The flexibility of the algorithm is rooted in the methodology developed for embedding algorithms into hypercubes. The algorithmic complexity is analyzed. Because the data redundancy associated with the replication of the projection images in all the PEs has allowed the process of simple backprojection to be designed without routing, an optimum algorithmic complexity is obtained.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Image reconstruction on hypercube computers\",\"authors\":\"E. Zapata, I. Benavides, F. F. Rivera, J. Bruguera, J. Carazo\",\"doi\":\"10.1109/FMPC.1990.89448\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of the 3-D reconstruction of an object from its 2-D projection images using filtered backprojection is addressed. The implementation of the filtered backprojection method on hypercube computers is analyzed. It is shown that the parallel algorithm is general in the sense that it does not impose any restriction on the problem space dimensions and is adaptable to any hypercube dimension. The flexibility of the algorithm is rooted in the methodology developed for embedding algorithms into hypercubes. The algorithmic complexity is analyzed. Because the data redundancy associated with the replication of the projection images in all the PEs has allowed the process of simple backprojection to be designed without routing, an optimum algorithmic complexity is obtained.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1990.89448\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1990.89448","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

研究了利用滤波后的反投影从物体的二维投影图像中重建物体的三维问题。分析了滤波反投影法在超立方体计算机上的实现。结果表明，该并行算法不受问题空间维度的限制，适用于任何超立方体维度，具有通用性。该算法的灵活性源于将算法嵌入超立方体的方法。分析了算法的复杂度。由于在所有pe中与投影图像复制相关的数据冗余使得设计简单的反向投影过程无需路由，因此获得了最优的算法复杂度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Image reconstruction on hypercube computers

The problem of the 3-D reconstruction of an object from its 2-D projection images using filtered backprojection is addressed. The implementation of the filtered backprojection method on hypercube computers is analyzed. It is shown that the parallel algorithm is general in the sense that it does not impose any restriction on the problem space dimensions and is adaptable to any hypercube dimension. The flexibility of the algorithm is rooted in the methodology developed for embedding algorithms into hypercubes. The algorithmic complexity is analyzed. Because the data redundancy associated with the replication of the projection images in all the PEs has allowed the process of simple backprojection to be designed without routing, an optimum algorithmic complexity is obtained.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量