裁剪图像马赛克

Jeff Orchard, C. Kaplan
{"title":"裁剪图像马赛克","authors":"Jeff Orchard, C. Kaplan","doi":"10.1145/1377980.1377997","DOIUrl":null,"url":null,"abstract":"An image mosaic is a rendering of a large target image by arranging a collection of small source images, often in an array, each chosen specifically to fit a particular block of the target image. Most mosaicking methods are simplistic in the sense that they break the target image into regular tiles (e.g., squares or hexagons) and take extreme shortcuts when evaluating the similarity between target tiles and source images. In this paper, we propose an efficient method to obtain higher quality mosaics that incorporate a number of process improvements. The Fast Fourier Transform (FFT) is used to compute a more fine-grained image similarity metric, allowing for optimal colour correction and arbitrarily shaped target tiles. In addition, the framework can find the optimal sub-image within a source image, further improving the quality of the matching. The similarity scores generated by these high-order cost computations are fed into a matching algorithm to find the globally-optimal assignment of source images to target tiles. Experiments show that each improvement, by itself, yields a more accurate mosaic. Combined, the innovations produce very high quality image mosaics, even with only a few hundred source images.","PeriodicalId":204343,"journal":{"name":"International Symposium on Non-Photorealistic Animation and Rendering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":"{\"title\":\"Cut-out image mosaics\",\"authors\":\"Jeff Orchard, C. Kaplan\",\"doi\":\"10.1145/1377980.1377997\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An image mosaic is a rendering of a large target image by arranging a collection of small source images, often in an array, each chosen specifically to fit a particular block of the target image. Most mosaicking methods are simplistic in the sense that they break the target image into regular tiles (e.g., squares or hexagons) and take extreme shortcuts when evaluating the similarity between target tiles and source images. In this paper, we propose an efficient method to obtain higher quality mosaics that incorporate a number of process improvements. The Fast Fourier Transform (FFT) is used to compute a more fine-grained image similarity metric, allowing for optimal colour correction and arbitrarily shaped target tiles. In addition, the framework can find the optimal sub-image within a source image, further improving the quality of the matching. The similarity scores generated by these high-order cost computations are fed into a matching algorithm to find the globally-optimal assignment of source images to target tiles. Experiments show that each improvement, by itself, yields a more accurate mosaic. Combined, the innovations produce very high quality image mosaics, even with only a few hundred source images.\",\"PeriodicalId\":204343,\"journal\":{\"name\":\"International Symposium on Non-Photorealistic Animation and Rendering\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"46\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Non-Photorealistic Animation and Rendering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1377980.1377997\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Non-Photorealistic Animation and Rendering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1377980.1377997","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46

摘要

图像拼接是通过排列小源图像的集合(通常在数组中)来呈现大目标图像,每个源图像都是专门选择以适合目标图像的特定块。大多数拼接方法都是简单的,因为它们将目标图像分解成规则的瓷砖(例如,正方形或六边形),并且在评估目标瓷砖和源图像之间的相似性时采取极端的捷径。在本文中,我们提出了一种有效的方法来获得更高质量的马赛克,其中包括一些工艺改进。快速傅里叶变换(FFT)用于计算更细粒度的图像相似性度量,允许最佳的颜色校正和任意形状的目标瓷砖。此外,该框架还可以在源图像中找到最优子图像,进一步提高匹配质量。这些高阶代价计算产生的相似度分数被输入到匹配算法中,以找到源图像到目标图像的全局最优分配。实验表明,每一项改进本身都会产生更精确的拼接。结合起来,这些创新产生了非常高质量的图像马赛克,即使只有几百个源图像。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cut-out image mosaics
An image mosaic is a rendering of a large target image by arranging a collection of small source images, often in an array, each chosen specifically to fit a particular block of the target image. Most mosaicking methods are simplistic in the sense that they break the target image into regular tiles (e.g., squares or hexagons) and take extreme shortcuts when evaluating the similarity between target tiles and source images. In this paper, we propose an efficient method to obtain higher quality mosaics that incorporate a number of process improvements. The Fast Fourier Transform (FFT) is used to compute a more fine-grained image similarity metric, allowing for optimal colour correction and arbitrarily shaped target tiles. In addition, the framework can find the optimal sub-image within a source image, further improving the quality of the matching. The similarity scores generated by these high-order cost computations are fed into a matching algorithm to find the globally-optimal assignment of source images to target tiles. Experiments show that each improvement, by itself, yields a more accurate mosaic. Combined, the innovations produce very high quality image mosaics, even with only a few hundred source images.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信