Computer Graphics. P08 Texture Synthesis. Aleksandra Pizurica Ghent University

Similar documents
Parametric Texture Model based on Joint Statistics

Texture Synthesis and Manipulation Project Proposal. Douglas Lanman EN 256: Computer Vision 19 October 2006

A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients. Gowtham Bellala Kumar Sricharan Jayanth Srinivasa

Image Fusion Using Double Density Discrete Wavelet Transform

Fast wavelet transform domain texture synthesis

CHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING. domain. In spatial domain the watermark bits directly added to the pixels of the cover

Image pyramids and their applications Bill Freeman and Fredo Durand Feb. 28, 2006

Query by Fax for Content-Based Image Retrieval

Today: non-linear filters, and uses for the filters and representations from last time. Review pyramid representations Non-linear filtering Textures

Multiresolution Image Processing

Image Composition. COS 526 Princeton University

An Improved Texture Synthesis Algorithm Using Morphological Processing with Image Analogy

Texture Similarity Measure. Pavel Vácha. Institute of Information Theory and Automation, AS CR Faculty of Mathematics and Physics, Charles University

Texture. Announcements. 2) Synthesis. Issues: 1) Discrimination/Analysis

Lecture 3: Tilings and undecidability

HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION

Digital Image Processing. Chapter 7: Wavelets and Multiresolution Processing ( )

Texture Synthesis. Michael Kazhdan ( /657)

ISSN: (Online) Volume 2, Issue 5, May 2014 International Journal of Advance Research in Computer Science and Management Studies

Wavelet Transform (WT) & JPEG-2000

Multi-focus Image Fusion Using Stationary Wavelet Transform (SWT) with Principal Component Analysis (PCA)

A NEW ROBUST IMAGE WATERMARKING SCHEME BASED ON DWT WITH SVD

Experiments with Edge Detection using One-dimensional Surface Fitting

Lecture 6: Texture. Tuesday, Sept 18

Verification of a brick Wang tiling algorithm

Comparison of Digital Image Watermarking Algorithms. Xu Zhou Colorado School of Mines December 1, 2014

Autoregressive and Random Field Texture Models

Implementation of ContourLet Transform For Copyright Protection of Color Images

CHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET

Mr Mohan A Chimanna 1, Prof.S.R.Khot 2

FAST ALGORITHM FOR H.264/AVC INTRA PREDICTION BASED ON DISCRETE WAVELET TRANSFORM

Texture. The Challenge. Texture Synthesis. Statistical modeling of texture. Some History. COS526: Advanced Computer Graphics

Texture Analysis of Painted Strokes 1) Martin Lettner, Paul Kammerer, Robert Sablatnig

Hexagonal Image Quilting for Texture Synthesis

Data hiding Using Texture Synthesis with Watermarking

TEXTURE. Plan for today. Segmentation problems. What is segmentation? INF 4300 Digital Image Analysis. Why texture, and what is it?

CHAPTER 4 FEATURE EXTRACTION AND SELECTION TECHNIQUES

Photometric Processing

Texture-based Image Retrieval Using Multiscale Sub-image Matching

Robust Image Watermarking based on Discrete Wavelet Transform, Discrete Cosine Transform & Singular Value Decomposition

Final Review. Image Processing CSE 166 Lecture 18

Image Texture Tiling. Philip Reasa, Daniel Konen, Ben Mackenthun. December 18, 2013

EN1610 Image Understanding Lab # 3: Edges

Comparative Evaluation of DWT and DT-CWT for Image Fusion and De-noising

An Image Coding Approach Using Wavelet-Based Adaptive Contourlet Transform

Design of Orthogonal Graph Wavelet Filter Banks

Tiled Texture Synthesis

Reversible Texture Synthesis for Data Security

Keywords - DWT, Lifting Scheme, DWT Processor.

GPU-based interactive near-regular texture synthesis for digital human models

Feature Based Watermarking Algorithm by Adopting Arnold Transform

APPLICATION OF CONTOURLET TRANSFORM AND MAXIMUM ENTROPY ON DIGITAL IMAGE WATERMARKING

Synthesis of Facial Images with Foundation Make-Up

+ = The Goal of Texture Synthesis. Image Quilting for Texture Synthesis & Transfer. The Challenge. Texture Synthesis for Graphics

Wavelet Applications. Texture analysis&synthesis. Gloria Menegaz 1

QR Code Watermarking Algorithm Based on DWT and Counterlet Transform for Authentication

Reduced Time Complexity for Detection of Copy-Move Forgery Using Discrete Wavelet Transform

Reversible Blind Watermarking for Medical Images Based on Wavelet Histogram Shifting

Compression of RADARSAT Data with Block Adaptive Wavelets Abstract: 1. Introduction

Pyramid Coding and Subband Coding

The Choice of Filter Banks for Wavelet-based Robust Digital Watermarking p. 1/18

Image processing of coarse and fine aggregate images

Clustering and blending for texture synthesis

Digital Image Watermarking using Fuzzy Logic approach based on DWT and SVD

The Choice of Filter Banks for Wavelet-based Robust Digital Watermarking

COLOR HISTOGRAM BASED MEDICAL IMAGE RETRIEVAL SYSTEM

An Introduction to Content Based Image Retrieval

Median filter. Non-linear filtering example. Degraded image. Radius 1 median filter. Today

Non-linear filtering example

Reconstruction PSNR [db]

A Robust Digital Watermarking Scheme using BTC-PF in Wavelet Domain

Digital Image Processing

Pyramid Coding and Subband Coding

Analysis and Synthesis of Texture

Space Filling: A new algorithm for procedural creation of game assets

Image Compression & Decompression using DWT & IDWT Algorithm in Verilog HDL

Segmentation algorithm for monochrome images generally are based on one of two basic properties of gray level values: discontinuity and similarity.

Comparison of wavelet based watermarking techniques Using SVD

Texture Based Image Segmentation and analysis of medical image

SSRG International Journal of Electronics and Communication Engineering (SSRG-IJECE) Volume 3 Issue 6 June 2016

A DWT, DCT AND SVD BASED WATERMARKING TECHNIQUE TO PROTECT THE IMAGE PIRACY

Image Features Extraction Using The Dual-Tree Complex Wavelet Transform

Evaluation of texture features for image segmentation

On the undecidability of the tiling problem. Jarkko Kari. Mathematics Department, University of Turku, Finland

Color Image Segmentation

EDGE-AWARE IMAGE PROCESSING WITH A LAPLACIAN PYRAMID BY USING CASCADE PIECEWISE LINEAR PROCESSING

Chapter 3 Image Registration. Chapter 3 Image Registration

Fractals: a way to represent natural objects

I Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University. Computer Vision: 6. Texture

Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi

A 3-D Virtual SPIHT for Scalable Very Low Bit-Rate Embedded Video Compression

Segmentation of Images

Digital Color Image Watermarking In RGB Planes Using DWT-DCT-SVD Coefficients

Topics. Image Processing Techniques and Smart Image Manipulation. Texture Synthesis. Topics. Markov Chain. Weather Forecasting for Dummies

Midterm Examination CS 534: Computational Photography

A FRACTAL WATERMARKING SCHEME FOR IMAGE IN DWT DOMAIN

TEXTURE ANALYSIS USING GABOR FILTERS FIL

A HYBRID WATERMARKING SCHEME BY REDUNDANT WAVELET TRANSFORM AND BIDIAGONAL SINGULAR VALUE DECOMPOSITION

EE795: Computer Vision and Intelligent Systems

Robust Blind Digital Watermarking in Contourlet Domain

Transcription:

Computer Graphics P08 Texture Synthesis Aleksandra Pizurica Ghent University Telecommunications and Information Processing Image Processing and Interpretation Group

Applications of texture synthesis Computer generated images Films Virtual reality Computer games P08_2

The problem A naive approach: simple tiling? A sample Large texture Given texture I, generate texture J That looks like I (or differs from I in the same way as I differs from itself) Doesn t show any obvious copying or tiling Tiling is obvious! P08_3

Types of Textures and Techniques Deterministic (given primitives and placement rule Stochastic (not easily identifiable primitives) Mixture of the two (most textures in practice) Model-based methods First-order statistics (pyramidal methods) Using Markov Random Fields (We don t treat in this course) Tiling en patch methods Image Quilting Wang tiles Hybrid methods (tiling + stochastic modeling) P08_4

Pyramidal Methods

Pyramidal Methods (Heeger&Bergen) Two textures are difficult to discriminate if they produce similar responses in a bank of (orientation and frequency selective) linear filters Use this property for texture matching! 0.2 0.2 The histogram 0.1 0-20 0 20 0.1 0-20 0 20 Long tails more large coefficients stronger edges in the corresponding subband (of a given orientation and resolution) P08_6

Pyramidal Decomposition Gaussian pyramid Laplacian pyramid Orientation selection: steerable pyramid P08_7

Pyramidal Decomposition Laplacian pyramide LP l 1 2 LP 2 l 2 2 2 LP LP b 1 P08_8

Pyramidal Decomposition Laplacian pyramide LP l 1 2 LP 2 l 2 2 2 LP LP b 1 oriented filters Steerable pyramid P08_9

Discrete Wavelet Transform (DWT) highpass wavelet coefficients s j g h lowpass 2 2 w j+1 s j+1 g 2 h scaling coefficients 2 w j+2 s j+1 g h 2 2 w j+3 s j+3 DWT algorithm: a filter bank iterated on the lowpass output The same texture synthesis concept can be applied using image pyramid or DWT or a related multiresolution image representation P08_10

Two dimensional DWT highpass g 2 g h 2 2 HH j+1 HL j+1 LL 3 HL 3 LH 3 HH 3 LH 2 HL 2 HH 2 HL 1 LL j lowpass h horizontal filtering 2 g h 2 2 vertical filtering LH j+1 LL j+1 LH 1 HH 1 P08_11

Two dimensional DWT APPROXIMATION scaling coefficients Wavelet coefficient values 0 DETAIL IMAGES wavelet coefficients Peaks indicate image edges P08_12

Texture Synthesis in Pyramidal Decomposition Gaussian pyramid Laplacian pyramid In the following, we assume a Laplacian pyramid, having on mind that the same approach can be applied in other multiresolution representations P08_13

Histogram Matching MH iteration 1 MH MH MH I 1 : example I 2 : noise I 2 (m,n)=ilut1(lut2(i 2 (m,n))) 1 C 2 =LUT2(g 2 ) 0 0 F 2 F 1 g 2 g 1 255 ILUT1(C 2 ) Matching histograms (MH) via cumulative distributions F 1 and F 2. LUTi: look-up table for F i ; ILUT: inverse LUT. When do we need more orientations? Think of extension to color! P08_14

Pyramidal Methods where they work? example texture noise resulting texture Suitable for homogeneous stochastic textures! P08_15

Pyramidal Methods where they don t work? Not homogeneous texture Characteristic structural details Regular patterns Complex compositions The first-order statistics is not sufficient in these cases. P08_16

Pyramidal Methods: Summary Based on first-order statistics Motivated by studies of the human visual system Effective for homogeneous stochastic textures Reading: D. J. Heeger and J.R. Bergen, Pyramid Based Texture Analysis/Synthesis, International Conference on Image Processing (ICIP'95) Vol. 3, 1995. All of it P08_17

Image Quilting

Image Quilting (Efros&Freeman) block Choose blocks of a given size from the input texture sample Step 1: Position overlapping blocks sequentially B 1 B 2 Step 2: Calculate the optimal borders in overlapping regions B 1 B 2 P08_19

Image Quilting (Efros&Freeman) input texture ov B 2 B 2 B 1 ov B 1 B 1 B 2 block Step 1 Step 2 P08_20

Image Quilting: Step 1 Position overlapping blocks sequentially input Random choice of blocks Beter: semi-random with block matching block B 1 ov B 2 ov B 1 B 2 F block matching B ( i, j) B ( i, j) i, j ov 1 ov 2 Const P08_21

Image Quilting: Step 2 Find optimal borders in de overlapping regions input The result of step 1 B 1 B 2 block B 1 ov B 2 ov B 1 B 2 Shortest path through quadratic error surface ov ov 2 1 ( i, j) B2 ( i, )) e( i, j) ( B j P08_22

Image Quilting: Results Works rather well for all texture types Computationally intensive The influence of the block size is difficult to define P08_23

Image Quilting and texture transfer Correspondence maps luminance (after filtering) Step1: F total = F block matching + (1- ) F correspondence Step2: Same as in standard image quilting algorithm P08_24

Image Quilting and Texture Transfer Small correspondence error Big correspondence error F total = F block matching + (1- ) F correspondence F correspondence measures the difference in luminance of the block from the source texture and the block from the target object P08_25

Image Quilting: Summary A tiling method Glues blocks from the input texture sample Works for almost all texture types Computationally intensive Reading: A. Efros and W.T. Freeman, Image Quilting for Texture Synthesis and Transfer, Proceedings of the 28th annual conference on Computer graphics and interactive techniques, pp: 341 346, 2001. All of it P08_26

Wang Tiles

Wang Tiles Square tiles with color-coded edges. Cannot be rotated in the tiling! An example of a set with 2 horizontal and 2 vertical colors: Correct tiling: adjacent edges have the same color P08_28

Wang Tiles An example of a set with 2 horizontal and 2 vertical colors: Correct tiling: adjacent edges have the same color This tiling was named after Hao Wang, who conjectured in 1961 that any set that can produce a valid tiling of the plane must also be able to produce a periodic tiling Later showed: not true! The smallest aperiodic tiling consists of 13 tiles only. In the computer graphics we use sets that make periodic and not periodic tiling (e.g. the set of 8 tiles above) P08_29

Wang Tiles: Stochastic Tiling random choice Random choice from tiles with matching colors of North-West (NW) edges If there is at least one tile for each N-W combination correct tiling is guaranteed If there are at least two tiles for each N-W combination not periodic tiling is guaranteed. Why? The smallest set that satisfies this has 8 tiles. Prove this. (Hint: how many N-W combinations are there if there are 2 colors?) P08_30

Wang Tiles: Tile Design by Quilting Example texture How do we achieve that the tiles perfectly match?? Quilting + cutting out the middle square optimal borders The remaining ones with other combinations of the same 4 blocks P08_31

Introducing Inhomogeneity We learned to solve this: extending to arbitrary size, no copying or tiling obvious, but does it look natural? P08_32

Introducing Inhomogeneity How to achieve this? P08_33

Introducing Inhomogeneity An additional coding in each tile P08_34

Introducing Inhomogeneity Corners are binary coded In our example: corner marked means dense flowers, corner not marked means not dense flowers Two source textures for generating parts of tiles with and without corner marks optimal borders P08_35

Introducing Inhomogeneity Corners are binary coded For each tile: 2 4 =16 possible corner codings A set of 8 tiles extends to 8x16=128 tiles This can be reduced to 64 and still keeping the stochastic selection. Why? (How many corners do we need to match at each step?) P08_36

Wang Tiles: Summary The process of making tiles is complex (quilting) Once tiles are made, tiling very fast Works for almost all texture types Very powerful for producing non-homogeneous textures Reading: Michael F. Cohen, Jonathan Shade, Stefan Hiller, Oliver Deussen, Wang Tiles for Image and Texture Generation, ACM Transactions on Graphics, vol. 22, no. 3, pp. 287 294, July 2003. Sections 1,2 and 3 P08_37

Summary Pyramidal methods based on first-order statistics Work well for stochastic textures Not for non-homogeneous textures, regular patterns and complex composites Image Quilting Conceptually simple but computationally intensive For all textures (sometimes there are artifacts) Very good for texture transfer and for making Wang tiles Wang Tiles Fast and simple, making infinitely large textures Very good for complex textures Making not homogeneous textures: coded corners and edges P08_38