Image and volume data rotation with 1- and 3-pass algorithms.

L Tosoni, S Lanzavecchia, P L Bellon
{"title":"Image and volume data rotation with 1- and 3-pass algorithms.","authors":"L Tosoni,&nbsp;S Lanzavecchia,&nbsp;P L Bellon","doi":"10.1093/bioinformatics/12.6.549","DOIUrl":null,"url":null,"abstract":"<p><p>Three different implementations of the 3-pass algorithm of image and volume data rotation are illustrated and discussed. The three protocols use interpolation in real domain, with a peculiar implementation of the Shannon reconstruction, or phase shifts in Fourier domain. Accuracy and speed of the three methods are compared with corresponding values obtained with a 1-pass method. The results indicate that for low or moderate accuracy, 1-pass is more convenient than 3-pass rotation for both accuracy and speed. Very accurate rotations can be obtained in reasonable time if all steps of 3-pass rotation are performed in the Fourier domain.</p>","PeriodicalId":77081,"journal":{"name":"Computer applications in the biosciences : CABIOS","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/bioinformatics/12.6.549","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer applications in the biosciences : CABIOS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/12.6.549","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Three different implementations of the 3-pass algorithm of image and volume data rotation are illustrated and discussed. The three protocols use interpolation in real domain, with a peculiar implementation of the Shannon reconstruction, or phase shifts in Fourier domain. Accuracy and speed of the three methods are compared with corresponding values obtained with a 1-pass method. The results indicate that for low or moderate accuracy, 1-pass is more convenient than 3-pass rotation for both accuracy and speed. Very accurate rotations can be obtained in reasonable time if all steps of 3-pass rotation are performed in the Fourier domain.

图像和体积数据旋转与1和3通过算法。
对图像和体数据旋转的三遍算法的三种不同实现进行了说明和讨论。这三种协议在实域使用插值,用一种特殊的香农重建实现,或在傅里叶域相移。将三种方法的精度和速度与1次法得到的相应值进行了比较。结果表明,对于低或中等精度,1次旋转比3次旋转更方便,无论是精度还是速度。如果在傅里叶域中进行三次旋转的所有步骤,则可以在合理的时间内获得非常精确的旋转。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信