Maximizing Image Utilization in Photomosaics

M. Mikamo, M. Slomp, Shun Yanase, B. Raytchev, Toru Tamaki, K. Kaneda
{"title":"Maximizing Image Utilization in Photomosaics","authors":"M. Mikamo, M. Slomp, Shun Yanase, B. Raytchev, Toru Tamaki, K. Kaneda","doi":"10.1109/IC-NC.2010.17","DOIUrl":null,"url":null,"abstract":"Non-photo realistic rendering (NPR) is an appealing subject in computer graphics with a wide array of applications. As opposed to photo realistic rendering, NPR focuses on highlighting features and artistic traits instead of physical accuracy. Photo mosaic generation is one of the most popular NPR techniques, where a single image is assembled from several smaller ones. Visual responses change depending on the proximity to the photo mosaic, leading to many creative prospects for publicity. Synthesizing photo mosaics typically requires very large image databases in order to produce pleasing results. Moreover, repetitions are allowed to occur which may locally bias the mosaic. This paper provides alternatives to prevent repetitions while still being robust enough to work with coarse image subsets. Three approaches were devised for the matching stage of photo mosaics: a greedy-based procedural algorithm, simulated annealing and Soft Assign. We found that the latter two approaches deliver adequate arrangements in cases where only a restricted number of images is available.","PeriodicalId":375145,"journal":{"name":"2010 First International Conference on Networking and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 First International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC-NC.2010.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Non-photo realistic rendering (NPR) is an appealing subject in computer graphics with a wide array of applications. As opposed to photo realistic rendering, NPR focuses on highlighting features and artistic traits instead of physical accuracy. Photo mosaic generation is one of the most popular NPR techniques, where a single image is assembled from several smaller ones. Visual responses change depending on the proximity to the photo mosaic, leading to many creative prospects for publicity. Synthesizing photo mosaics typically requires very large image databases in order to produce pleasing results. Moreover, repetitions are allowed to occur which may locally bias the mosaic. This paper provides alternatives to prevent repetitions while still being robust enough to work with coarse image subsets. Three approaches were devised for the matching stage of photo mosaics: a greedy-based procedural algorithm, simulated annealing and Soft Assign. We found that the latter two approaches deliver adequate arrangements in cases where only a restricted number of images is available.
最大限度地提高图像利用率的photomosics
非照片真实感渲染(NPR)是计算机图形学中一个具有广泛应用的热门课题。与照片逼真的渲染相反,NPR侧重于突出特征和艺术特征,而不是物理准确性。照片马赛克生成是最流行的NPR技术之一,其中一张图像由几个较小的图像组装而成。视觉反应的变化取决于接近照片马赛克,导致许多创造性的宣传前景。为了产生令人满意的结果,合成照片马赛克通常需要非常大的图像数据库。此外,允许出现可能局部偏置马赛克的重复。本文提供了防止重复的替代方法,同时仍然具有足够的鲁棒性来处理粗糙的图像子集。针对照片拼接的匹配阶段,设计了三种方法:基于贪婪的过程算法、模拟退火算法和软分配算法。我们发现后两种方法在只有有限数量的图像可用的情况下提供适当的安排。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信