Constrained Graphcut Texture Synthesis
Loading...
No Access Until
Permanent Link(s)
Other Titles
Authors
Abstract
This 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.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
2005-04-14
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2005-1995
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report