Generating Classic Mosaics with Graph Cuts

Simple item page
dc.contributor.authorLiu, Y.en_US
dc.contributor.authorVeksler, O.en_US
dc.contributor.authorJuan, O.en_US
dc.date.accessioned2015-02-23T09:47:11Z
dc.date.available2015-02-23T09:47:11Z
dc.date.issued2010en_US
dc.description.abstractClassic 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.en_US
dc.description.number8en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01752.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages2387-2399en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01752.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleGenerating Classic Mosaics with Graph Cutsen_US
Files
Collections
29-Issue 8