@article{Kim:2002:JIM,
opteditor = {},
number = {3},
month = jul,
optnote = {},
author = {Junhwan Kim and Fabio Pellacini},
optkey = {},
series = CGPACS,
optannote = {},
url = {http://doi.acm.org/10.1145/566570.566633},
address = {New York},
localfile = {papers/Kim.2002.JIM.pdf},
optpublisher = {},
doi = {http://doi.acm.org/10.1145/566654.566633},
organization = {ACM SIGGRAPH},
journal = SIGGRAPH2002,
citeseer = {http://citeseer.nj.nec.com/541032.html},
volume = {21},
optcrossref = {},
optstatus = {OK},
title = {{J}igsaw {I}mage {M}osaics},
abstract = {This paper introduces a new kind of mosaic, called Jigsaw Image
Mosaic (JIM), where image tiles of arbitrary shape are used to
compose the final picture. The generation of a Jigsaw Image Mosaic
is a solution to the following problem: given an
arbitrarily-shaped container image and a set of arbitrarily-shaped
image tiles, fill the container as compactly as possible with
tiles of similar color to the container taken from the input set
while optionally deforming them slightly to achieve a more
visually-pleasing effect. We approach the problem by defining a
mosaic as the tile configuration that minimizes a mosaicing energy
function. We introduce a general energy-based framework for
mosaicing problems that extends some of the existing algorithms
such as Photomosaics and Simulated Decorative Mosaics. We also
present a fast algorithm to solve the mosaicing problem at an
acceptable computational cost. We demonstrate the use of our
method by applying it to a wide range of container images and
tiles. },
year = {2002},
pages = {657--664},
}
|