Show simple item record

dc.contributor.authorRamanarayanan, Ganeshen_US
dc.contributor.authorBala, Kavitaen_US
dc.date.accessioned2007-04-04T19:44:39Z
dc.date.available2007-04-04T19:44:39Z
dc.date.issued2005-04-14en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2005-1995en_US
dc.identifier.urihttps://hdl.handle.net/1813/5695
dc.description.abstractThis paper describes constrained graphcut texture synthesis (CGS), a graphcut-based synthesis algorithm that creates output textures satisfying constraints. We show that constrained texture synthesis can be posed in a principled way as an optimization problem that requires balancing two measures of quality: constraint satisfaction and texture seamlessness. We then present an efficient algorithm for finding good solutions to this problem, using generalized graphcut minimization. CGS enables explicit control while preserving the speed and quality benefits of graphcut texture synthesis. This approach supports the full image analogies framework, while providing superior image quality and performance. A range of applications of CGS are demonstrated, including detail synthesis, artistic filtering by analogy, and texture-by-numbers. CGS is easily extended to handle multiple constraints on a single output, thus enabling novel applications that combine both user-specified and image-based control.en_US
dc.format.extent17718873 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleConstrained Graphcut Texture Synthesisen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics