Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004 Fast and High Quality Overlap Fast and High Quality Overlap Repair for Patch-Based Texture Repair for Patch-Based Texture Synthesis Synthesis Andrew Nealen Andrew Nealen Marc Alexa Marc Alexa Discrete Geometric Modeling Group (DGM) Discrete Geometric Modeling Group (DGM) Technische Universität Darmstadt Technische Universität Darmstadt
62
Embed
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004 Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Fast and High Quality Overlap Fast and High Quality Overlap Repair for Patch-Based Texture Repair for Patch-Based Texture
SynthesisSynthesis
Andrew NealenAndrew NealenMarc AlexaMarc Alexa
Discrete Geometric Modeling Group (DGM)Discrete Geometric Modeling Group (DGM)Technische Universität DarmstadtTechnische Universität Darmstadt
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Our Setting: 2D Texture Synthesis
nxm Input Texture
NxM Output Texture
► The goal: Synthesize an output texture which is perceptually similar to the input texture. Also ensure that the result contains sufficient variation.
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Patch-Based Texture Synthesis
Some Existing Methods
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
__22
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
__ ==22
overlap error
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
__ ==22
overlap error
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
__ ==22
overlap error
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
__ ==22
overlap error
A B
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► A Very Popular 2D Texture Synthesis Method• Image Quilting [Efros and Freeman 2001]• Graphcut Texures [Kwatra et. al 2003]• Wang Tiles [Cohen et. al 2003]
Patch-Based Texture Synthesis
Some Existing Methods
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
► Introduced at EGSR 2003 [Nealen and Alexa]
• Adaptive Patch Sampling, like Hierarchical Pattern Mapping [Soler et. al 2002]
• Per-Pixel Overlap Re-synthesis
Patch-Based Texture Synthesis
Hybrid Texture Synthesis (HTS)
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Hybrid Texture SynthesisMethod
Result (N x M)
Input (n x m)
Intermediate Result
Result (N x M)
Goal:From nxm, synthesize
NxM
similar, but not identical
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Result (N x M)Result (N x M)
Goal:From nxm, synthesize
NxM
similar, but not identical
Input (n x m)
Intermediate Result
Hybrid Texture SynthesisMethod
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Goal:From nxm, synthesize
NxM
similar, but not identical
Result (N x M)
Input (n x m)
Intermediate Result
Result (N x M)
Patch-Search in the Input + Copy to Result + Mark Invalid Pixels
Hybrid Texture SynthesisMethod
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Result (N x M)
Input (n x m)
Intermediate Result
Result (N x M)
Goal:From nxm, synthesize
NxM
similar, but not identical
Patch-Search in the Input + Copy to Result + Mark Invalid Pixels
Per-Pixel Re-synthesis Steps (for each Patch)
Hybrid Texture SynthesisMethod
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Result (N x M)
Input (n x m)
Intermediate Result
Result (N x M)
Goal:From nxm, synthesize
NxM
similar, but not identical
Patch-Search in the Input + Copy to Result + Mark Invalid Pixels
Per-Pixel Re-synthesis Steps (for each Patch)
Hybrid Texture SynthesisMethod
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Result (N x M)
Input (n x m)
Intermediate Result
Result (N x M)
Goal:From nxm, synthesize
NxM
similar, but not identical
Patch-Search in the Input + Copy to Result + Mark Invalid Pixels
Per-Pixel Re-synthesis Steps (for each Patch)
Hybrid Texture SynthesisMethod
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Result (N x M)
Input (n x m)
Intermediate Result
Result (N x M)
Goal:From nxm, synthesize
NxM
similar, but not identical
Patch-Search in the Input + Copy to Result + Mark Invalid Pixels
Per-Pixel Re-synthesis Steps (for each Patch)
Hybrid Texture SynthesisMethod
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Goal:From nxm, synthesize
NxM
similar, but not identical
Result (N x M)
Input (n x m)
Intermediate Result
Result (N x M)
Patch-Search in the Input + Copy to Result + Mark Invalid Pixels
Per-Pixel Re-synthesis Steps (for each Patch)
Hybrid Texture SynthesisMethod
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Hybrid Texture SynthesisGeneralization: Pro and Con
► Pro: General Method for Overlap Repair• Complementary to other Methods, such as
Minimum-Error-Boundary-Cut (MEBC) or Feathering, yet oftentimes produces better results
• Generalizes to arbitrary patch shapes, i.e. is applicable to Graphcut Textures, Wang Tiles, etc.
► Con: Computationally Expensive• Exhaustive search for each invalid pixel in the
overlap, based on mostly irregular valid neighborhood
• Has O(rN log N) complexity -> Doesn‘t scale well.
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Hybrid Texture SynthesisGeneralization: Pro and Con
► Pro: General Method for Overlap Repair• Complementary to other Methods, such as
Minimum-Error-Boundary-Cut (MEBC) or Feathering, yet oftentimes produces better results
• Generalizes to arbitrary patch shapes, i.e. is applicable to Graphcut Textures, Wang Tiles, etc.
► Con: Computationally Expensive• Exhaustive search for each invalid pixel in the
overlap, based on mostly irregular valid neighborhood
• Has O(rN log N) complexity -> Doesn‘t scale well.
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004
Hybrid Texture SynthesisGeneralization: Pro and Con
► Pro: General Method for Overlap Repair• Complementary to other Methods, such as
Minimum-Error-Boundary-Cut (MEBC) or Feathering, yet oftentimes produces better results
• Generalizes to arbitrary patch shapes, i.e. is applicable to Graphcut Textures, Wang Tiles, etc.
► Con: Computationally Expensive• Exhaustive search for each invalid pixel in the
overlap, based on mostly irregular valid neighborhood
• Has O(rN log N) complexity -> Doesn‘t scale well.
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2004