Lecture 6: Texture. Tuesday, Sept 18

Similar documents
Texture April 17 th, 2018

Texture April 14 th, 2015

Announcements. Texture. Review: last time. Texture 9/15/2009. Write your CS login ID on the pset hardcopy. Tuesday, Sept 15 Kristen Grauman UT-Austin

Announcements. Texture. Review. Today: Texture 9/14/2015. Reminder: A1 due this Friday. Tues, Sept 15. Kristen Grauman UT Austin

More details on presentations

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

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

Texture. COS 429 Princeton University

Data-driven methods: Video & Texture. A.A. Efros

Texture Synthesis. Darren Green (

Texture Synthesis. Darren Green (

Data-driven methods: Video & Texture. A.A. Efros

Texture and Other Uses of Filters

Image Composition. COS 526 Princeton University

Texture. CS 419 Slides by Ali Farhadi

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

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

Non-linear filtering example

Texture Synthesis. Fourier Transform. F(ω) f(x) To understand frequency ω let s reparametrize the signal by ω: Fourier Transform

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

Texture. Announcements. Markov Chains. Modeling Texture. Guest lecture next Tuesday. Evals at the end of class today

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

Admin. Data driven methods. Overview. Overview. Parametric model of image patches. Data driven (Non parametric) Approach 3/31/2008

Texture. Texture. 2) Synthesis. Objectives: 1) Discrimination/Analysis

Texture. D. Forsythe and J. Ponce Computer Vision modern approach Chapter 9 (Slides D. Lowe, UBC) Previously

Texture Synthesis by Non-parametric Sampling

Texture. D. Forsythe and J. Ponce Computer Vision modern approach Chapter 9 (Slides D. Lowe, UBC) Texture

Bag of Words Models. CS4670 / 5670: Computer Vision Noah Snavely. Bag-of-words models 11/26/2013

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

Texture. D. Forsythe and J. Ponce Computer Vision modern approach Chapter 9 (Slides D. Lowe, UBC)

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

CS6670: Computer Vision

CS 534: Computer Vision Texture

Video Texture. A.A. Efros

Segmentation and Grouping April 19 th, 2018

Final Exam Schedule. Final exam has been scheduled. 12:30 pm 3:00 pm, May 7. Location: INNOVA It will cover all the topics discussed in class

CSCI 1290: Comp Photo

Outline. Segmentation & Grouping. Examples of grouping in vision. Grouping in vision. Grouping in vision 2/9/2011. CS 376 Lecture 7 Segmentation 1

Announcements. Recognition. Recognition. Recognition. Recognition. Homework 3 is due May 18, 11:59 PM Reading: Computer Vision I CSE 152 Lecture 14

Analysis and Synthesis of Texture

Schedule for Rest of Semester

Local Features and Bag of Words Models

Patch Descriptors. CSE 455 Linda Shapiro

Grouping and Segmentation

CS 534: Computer Vision Texture

Filters (cont.) CS 554 Computer Vision Pinar Duygulu Bilkent University

CMPSCI 670: Computer Vision! Grouping

Texture. This isn t described in Trucco and Verri Parts are described in:

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

Filters + linear algebra

CS 2770: Computer Vision. Edges and Segments. Prof. Adriana Kovashka University of Pittsburgh February 21, 2017

Edge and Texture. CS 554 Computer Vision Pinar Duygulu Bilkent University

Patch Descriptors. EE/CSE 576 Linda Shapiro

By Suren Manvelyan,

Segmentation and Grouping

Distribution Distance Functions

Schools of thoughts on texture

Texture Representation + Image Pyramids

Texture. Edge detectors find differences in overall intensity. Average intensity is only simplest difference.

Segmentation and Grouping April 21 st, 2015

Image Processing Techniques and Smart Image Manipulation : Texture Synthesis

Region-based Segmentation

Image Processing. Cosimo Distante. Lecture: Texture

Supervised learning. y = f(x) function

Texture. Edge detectors find differences in overall intensity. Average intensity is only simplest difference.

Segmentation & Grouping Kristen Grauman UT Austin. Announcements

Texture Synthesis. Michael Kazhdan ( /657)

What is an edge? Paint. Depth discontinuity. Material change. Texture boundary

Tiled Texture Synthesis

Edges and Binary Image Analysis April 12 th, 2018

Templates, Image Pyramids, and Filter Banks

Segmentation Computer Vision Spring 2018, Lecture 27

Bag-of-features. Cordelia Schmid

Computer Vision Course Lecture 04. Template Matching Image Pyramids. Ceyhun Burak Akgül, PhD cba-research.com. Spring 2015 Last updated 11/03/2015

CS4442/9542b Artificial Intelligence II prof. Olga Veksler

Object Removal Using Exemplar-Based Inpainting

CS4442/9542b Artificial Intelligence II prof. Olga Veksler

Supervised learning. y = f(x) function

[ ] Review. Edges and Binary Images. Edge detection. Derivative of Gaussian filter. Image gradient. Tuesday, Sept 16

Bias-Variance Trade-off (cont d) + Image Representations

A Comparison Study of Four Texture Synthesis Algorithms on Regular and Near-regular Textures

Texture C H A P T E R 6

Computer Graphics. P08 Texture Synthesis. Aleksandra Pizurica Ghent University

Problem Set 4. Assigned: March 23, 2006 Due: April 17, (6.882) Belief Propagation for Segmentation

EECS490: Digital Image Processing. Lecture #19

Motion Texture. Harriet Pashley Advisor: Yanxi Liu Ph.D. Student: James Hays. 1. Introduction

SVM-KNN : Discriminative Nearest Neighbor Classification for Visual Category Recognition

CPSC 425: Computer Vision

Today. Main questions 10/30/2008. Bag of words models. Last time: Local invariant features. Harris corner detector: rotation invariant detection

Supervised texture detection in images

Bayes Risk. Classifiers for Recognition Reading: Chapter 22 (skip 22.3) Discriminative vs Generative Models. Loss functions in classifiers

Classifiers for Recognition Reading: Chapter 22 (skip 22.3)

Why is computer vision difficult?

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

Solution: filter the image, then subsample F 1 F 2. subsample blur subsample. blur

Beyond Bags of features Spatial information & Shape models

Segmentation (continued)

Edges and Binary Images

Texton-based Texture Classification

All good things must...

Transcription:

Lecture 6: Texture Tuesday, Sept 18

Graduate students Problem set 1 extension ideas Chamfer matching Hierarchy of shape prototypes, search over translations Comparisons with Hausdorff distance, L1 on silhouettes Multi-view matching, Background subtraction Adaptive background model Classify blobs based on shape cues Collect some statistics of tracks over time,

Texture

Scale: objects vs. texture

Texture problems Segmentation from texture cues Analyze, represent v texture Group image regions with consistent texture Synthesis Generate new texture patches/images given v some examples Shape from texture Estimate surface orientation or shape from image texture

Shape from texture Assume homogeneity of texture Use deformation of texture from point to point to estimate surface shape

Images:Bill Freeman, A. Efros Analysis vs. Synthesis

Why analyze texture? What kind of response will we get with an edge detector for these images? Images from Malik and Perona, 1990

Image credit: D. Forsyth and for this image?

http://www.airventure.org/2004/gallery/images/073104_satellite.jpg

Psychophysics of texture Some textures distinguishable with preattentive perception [Julesz 1975] Analysis: need to measure densities of local pattern types what are the fundamental units? Same or different?

Capturing the local patterns with image measurements [Bergen & Adelson, Nature 1988] Scale of patterns influences discriminability Size-tuned linear filters

What filters? Weights: 1, -2, 1; sigmas 0.62, 1, Weights: 1,-1; sigmas 0.71, 1.14, [Malik & Perona, 1990] Horizontal bar: Weights: -1, 2, -1; Sigmax = 2 Sigmay = 1 Offsets along y: 1, 0, -1 Spots: weighted sum of two/three concentric, symmetric Gaussians Oriented bars: weighted sum of three oriented offset Gaussians

Forsyth & Ponce

Texture representation Textures made up of repeated local patterns: Find the patterns Use filters that look like patterns (spots, bars, ) Consider magnitude of response Describe their statistics Mean, standard deviation Histograms

Texture representation Collect responses to collection of filters Filters at multiple scales, orientations Collect within window (assuming know relevant size of this window) For example, collect mean of the squared filter outputs for a range of filters (d filters -> d dimensional vector for each window). Figure by P. Duygulu

Texture representation: example Displaying features: Threshold and combine Forsyth & Ponce Lighter = stronger response Smooth to get mean of squared response in some window

Texture vocabularies Textons: 2D units of preattentive textures [Julesz, 1981] Textons: prototypical responses of images to a given filter bank [Leung & Malik, 1999]

Recognizing materials with textons [Leung & Malik, 1999] Collect filter responses from sample of images (possibly over multiple viewing conditions) Vector quantize into textons Describe new images in terms of distribution of textons Compare histograms, e.g. chi-squared distance Related recent research: [Varma and Zisserman, 2002] [Lazebnik, Schmid, and Ponce, 2003] [Hayman et al., 2004]

[Leung & Malik, 1999]

Texture synthesis Goal: create new samples of a given texture Many applications: virtual environments, holefilling, texturing surfaces Slides from Efros, ICCV 1999

The Challenge Need to model the whole spectrum: from repeated to stochastic texture repeated stochastic Both?

Motivation from Language [Shannon, 48] proposed a way to generate English-looking text using N-grams: Assume a generalized Markov model Use a large text to compute probability distributions of each letter given N-1 previous letters Starting from a seed repeatedly sample this Markov chain to generate new letters One can use whole words instead of letters too: WE NEED TO EAT CAKE

Motivation from language Results: As I've commented before, really relating to someone involves standing next to impossible. "One morning I shot an elephant in my arms and kissed him. "I spent an interesting evening recently with a grain of salt" Notice how well local structure is preserved! Now let s try this in 2D... Dewdney, A potpourri of programmed prose and prosody Scientific American, 1989.

SSD: simple measure of patch similarity A B C = (A-B).^2 sum(c(:)) = 4088780 A B C = (A-B).^2 sum(c(:)) = 1021339

Efros & Leung algorithm p non-parametric sampling Synthesizing a pixel Input image Assuming Markov property, compute P(p N(p)) Building explicit probability tables infeasible Instead, we search the input image for all similar neighborhoods that s our pdf for p To sample from this pdf, just pick one match at random

Efros & Leung algorithm Growing is in onion skin order Within each layer, pixels with most neighbors are synthesized first If no close match can be found, the pixel is not synthesized until the end Using Gaussian-weighted SSD is very important to make sure the new pixel agrees with its closest neighbors Approximates reduction to a smaller neighborhood window if data is too sparse

input Neighborhood Window

Varying Window Size Increasing window size

Synthesis results french canvas rafia weave

white bread Synthesis results brick wall

Synthesis results

Failure Cases Growing garbage Verbatim copying

Hole Filling

Extrapolation

Summary The Efros & Leung algorithm Simple Surprisingly good results Synthesis is easier than analysis! but very slow

Image Quilting [Efros & Freeman 2001] p B Synthesizing a block non-parametric sampling Input image Observation: neighbor pixels are highly correlated Idea: unit of synthesis = block Exactly the same but now we want P(B N(B)) Much faster: synthesize all pixels in a block at once

block Input texture B1 B2 B1 B2 B1 B2 Random placement of blocks Neighboring blocks constrained by overlap Minimal error boundary cut

Minimal error boundary overlapping blocks vertical boundary _ 2 = overlap error min. error boundary

Failures (Chernobyl Harvest)

Texture Transfer Take the texture from one object and paint it onto another object This requires separating texture and shape That s HARD, but we can cheat Assume we can capture shape by boundary and rough shading Then, just add another constraint when sampling: similarity to underlying image at that spot

parmesan + = rice + =

+ =

+ =

Coming up Problem set 1 due Tuesday Segmentation: read Chapter 14