基于数据密集型图像的重照明

Biswarup Choudhury, S. Chandran
{"title":"基于数据密集型图像的重照明","authors":"Biswarup Choudhury, S. Chandran","doi":"10.1145/1321261.1321289","DOIUrl":null,"url":null,"abstract":"Image based Relighting(IBRL) has attracted a lot of interest in the computer graphics research, gaming, and virtual cinematography communities for its ability to relight objects or scenes, from novel illuminations captured in natural or synthetic environments. However, the advantages of an image-based framework conflicts with a drastic increase in the storage caused by the huge number of reference images pre-captured under various illumination conditions. To perform fast relighting, while maintaining the visual fidelity, one needs to preprocess this huge data into an appropriate model.\n In this paper, we propose a novel and efficient two-stage relighting algorithm which creates a compact representation of the huge IBRL dataset and facilitates fast relighting. In the first stage, using Singular Value Decomposition, a set of eigen image bases and relighting coefficients are computed. In the second stage, and in contrast to prior methods, the correlation among the relighting coefficients is harnessed using Spherical Harmonics. The proposed method thus has lower memory and computational requirements. We demonstrate our results qualitatively and quantitatively with new generated image data.","PeriodicalId":360852,"journal":{"name":"Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Data-intensive image based relighting\",\"authors\":\"Biswarup Choudhury, S. Chandran\",\"doi\":\"10.1145/1321261.1321289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image based Relighting(IBRL) has attracted a lot of interest in the computer graphics research, gaming, and virtual cinematography communities for its ability to relight objects or scenes, from novel illuminations captured in natural or synthetic environments. However, the advantages of an image-based framework conflicts with a drastic increase in the storage caused by the huge number of reference images pre-captured under various illumination conditions. To perform fast relighting, while maintaining the visual fidelity, one needs to preprocess this huge data into an appropriate model.\\n In this paper, we propose a novel and efficient two-stage relighting algorithm which creates a compact representation of the huge IBRL dataset and facilitates fast relighting. In the first stage, using Singular Value Decomposition, a set of eigen image bases and relighting coefficients are computed. In the second stage, and in contrast to prior methods, the correlation among the relighting coefficients is harnessed using Spherical Harmonics. The proposed method thus has lower memory and computational requirements. We demonstrate our results qualitatively and quantitatively with new generated image data.\",\"PeriodicalId\":360852,\"journal\":{\"name\":\"Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1321261.1321289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1321261.1321289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

基于图像的重照明(IBRL)因其能够从自然或合成环境中捕获的新颖照明中重照明物体或场景的能力,在计算机图形研究、游戏和虚拟电影社区中引起了很多兴趣。然而,基于图像的框架的优点与在各种照明条件下预捕获的大量参考图像导致的存储急剧增加相冲突。为了在保持视觉保真度的同时进行快速重光照,需要将这些庞大的数据预处理成合适的模型。在本文中,我们提出了一种新颖而高效的两阶段重光照算法,该算法创建了一个庞大的IBRL数据集的紧凑表示,并便于快速重光照。第一阶段,利用奇异值分解,计算一组特征图像基和重光照系数;在第二阶段,与先前的方法相比,使用球面谐波来利用重光照系数之间的相关性。因此,该方法具有较低的内存和计算需求。我们用新生成的图像数据定性和定量地证明了我们的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Data-intensive image based relighting
Image based Relighting(IBRL) has attracted a lot of interest in the computer graphics research, gaming, and virtual cinematography communities for its ability to relight objects or scenes, from novel illuminations captured in natural or synthetic environments. However, the advantages of an image-based framework conflicts with a drastic increase in the storage caused by the huge number of reference images pre-captured under various illumination conditions. To perform fast relighting, while maintaining the visual fidelity, one needs to preprocess this huge data into an appropriate model. In this paper, we propose a novel and efficient two-stage relighting algorithm which creates a compact representation of the huge IBRL dataset and facilitates fast relighting. In the first stage, using Singular Value Decomposition, a set of eigen image bases and relighting coefficients are computed. In the second stage, and in contrast to prior methods, the correlation among the relighting coefficients is harnessed using Spherical Harmonics. The proposed method thus has lower memory and computational requirements. We demonstrate our results qualitatively and quantitatively with new generated image data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Backwards State-space Reduction for Planning in Dynamic Knowledge Bases Entity-Linking via Graph-Distance Minimization Specifying and Executing Optimizations for Parallel Programs Graph Transformation Planning via Abstraction Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1