A Parallel Framework for Fast Photomosaics

Dongwann KANG  Sang-Hyun SEO  Seung-Taek RYOO  Kyung-Hyun YOON  

IEICE TRANSACTIONS on Information and Systems   Vol.E94-D   No.10   pp.2036-2042
Publication Date: 2011/10/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E94.D.2036
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computer Graphics
non-photorealistic rendering,  photomosaics,  GPU,  

Full Text: PDF(3.3MB)>>
Buy this Article

Main bottleneck of photomosaic algorithm is a search for a best matched image. Unlike several techniques which use fast approximation search for increasing the speed, we propose a parallel framework for fast photomosaic using a programmable GPU. This paper suggests a design of vertex structure for a best match searching on each cell of photomosaic grid and shows a texture representation of image database. The shader programs which are used for searching a best match and rendering image tiles into a display are presented. In addition, a simple duplicate reduction and color correction methods are proposed. Our algorithm not only offers dramatic enhancement of speed, but also always guarantees the 'exact' result.