Fast approximate focal stack transform

J. G. Marichal-Hernández, J. P. Luke, F. Rosa, F. Pérez Nava, J. Rodríguez-Ramos
{"title":"Fast approximate focal stack transform","authors":"J. G. Marichal-Hernández, J. P. Luke, F. Rosa, F. Pérez Nava, J. Rodríguez-Ramos","doi":"10.1109/3DTV.2009.5069644","DOIUrl":null,"url":null,"abstract":"In this work we develop a new algorithm, extending the Fast Digital Radon transform from Götz and Druckmüller (1996), that is capable of generating the approximate focal stack of a scene, previously measured with a plenoptic camera, with the minimum number of operations. This new algorithm does not require multiplications, just sums, and its computational complexity is O(N4) to achieve a volume consisting of 2N − 1 photographic planes focused at different depths, from a N4 light field. The method is close to real-time performance, and its output can be used to estimate the distances to objects of a scene.","PeriodicalId":230128,"journal":{"name":"2009 3DTV Conference: The True Vision - Capture, Transmission and Display of 3D Video","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 3DTV Conference: The True Vision - Capture, Transmission and Display of 3D Video","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3DTV.2009.5069644","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

In this work we develop a new algorithm, extending the Fast Digital Radon transform from Götz and Druckmüller (1996), that is capable of generating the approximate focal stack of a scene, previously measured with a plenoptic camera, with the minimum number of operations. This new algorithm does not require multiplications, just sums, and its computational complexity is O(N4) to achieve a volume consisting of 2N − 1 photographic planes focused at different depths, from a N4 light field. The method is close to real-time performance, and its output can be used to estimate the distances to objects of a scene.
快速近似焦叠变换
在这项工作中,我们开发了一种新的算法,扩展了来自Götz和druckm ller(1996)的快速数字Radon变换,该算法能够以最少的操作次数生成场景的近似焦点堆栈,以前是用全光学相机测量的。这种新算法不需要乘法,只需要求和,其计算复杂度为0 (N4),可以从N4光场中获得由不同深度聚焦的2N−1个摄影平面组成的体积。该方法接近实时性能,其输出可用于估计场景中物体的距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信