Generating Classic Mosaics with Graph Cuts
Article first published online: 10 NOV 2010
© 2010 The Authors Computer Graphics Forum © 2010 The Eurographics Association and Blackwell Publishing Ltd.
Computer Graphics Forum
Volume 29, Issue 8, pages 2387–2399, December 2010
How to Cite
Liu, Y., Veksler, O. and Juan, O. (2010), Generating Classic Mosaics with Graph Cuts. Computer Graphics Forum, 29: 2387–2399. doi: 10.1111/j.1467-8659.2010.01752.x
- Issue published online: 10 NOV 2010
- Article first published online: 10 NOV 2010
- non-photorealistic rendering;
- artificial mosaic;
- graph cuts;
- I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation
Classic mosaic is an old and durable art form. Generating artificial classic mosaics from digital images is an interesting problem that has attracted attention in recent years. Previous approaches to mosaic generation are largely based on heuristics, and therefore it is harder to analyse, predict and improve their performance. In addition, previous methods have a number of disadvantages, such as requiring that the number of tiles in a mosaic is known a priori, or relying on extensive user interaction, or using heuristics for tile placement that lead to visible artefacts. We propose a classic mosaic generation algorithm that is based on a principled global optimization. Our approach is fully automatic. We design and optimize an objective function that incorporates the desired mosaic properties, such as tile alignment to significant image edges, prohibiting tile overlap, etc. Our optimization method is based on graph cuts, which proved to be a powerful optimization tool in graphics and computer vision. Experimental comparison to previous work demonstrate the advantages of our approach.