Texture.

Slides:

Advertisements

Similar presentations

Filling Algorithms Pixelwise MRFsChaos Mosaics Patch segments are pasted, overlapping, across the image. Then either: Ambiguities are removed by smoothing.

Advertisements

Texture. Limitation of pixel based processing Edge detection with different threshold.

Data-driven methods: Texture (Sz 10.5) Cs129 Computational Photography James Hays, Brown, Spring 2011 Many slides from Alexei Efros.

CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 4 – Digital Image Representation Klara Nahrstedt Spring 2009.

November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.

1 Texture Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Structural approach:

嵌入式視覺 Feature Extraction

Pyramids and Texture. Scaled representations Big bars and little bars are both interesting Spots and hands vs. stripes and hairs Inefficient to detect.

CS 4487/9587 Algorithms for Image Analysis

Texture. Edge detectors find differences in overall intensity. Average intensity is only simplest difference. many slides from David Jacobs.

Lecture 3 Nonparametric density estimation and classification

Lecture 4 Linear Filters and Convolution

1 Texture Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Structural approach:

Announcements Project 4 questions? Guest lectures Thursday: Richard Ladner “tactile graphics” Next Tuesday: Jenny Yuen and Jeff Bigham.

Image Quilting for Texture Synthesis & Transfer Alexei Efros (UC Berkeley) Bill Freeman (MERL) +=

Texture This isn’t described in Trucco and Verri Parts are described in: – Computer Vision, a Modern Approach by Forsyth and Ponce –“Texture Synthesis.

Image processing. Image operations Operations on an image –Linear filtering –Non-linear filtering –Transformations –Noise removal –Segmentation.

Announcements Big mistake on hint in problem 1 (I’m very sorry).

Texture Turk, 91.

Texture Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Structural approach:

TEXTURE SYNTHESIS PEI YEAN LEE. What is texture? Images containing repeating patterns Local & stationary.

Announcements For future problems sets: matlab code by 11am, due date (same as deadline to hand in hardcopy). Today’s reading: Chapter 9, except.

Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.

Texture Recognition and Synthesis A Non-parametric Multi-Scale Statistical Model by De Bonet & Viola Artificial Intelligence Lab MIT Presentation by Pooja.

Texture Readings: Ch 7: all of it plus Carson paper

Computer Vision - A Modern Approach Set: Pyramids and Texture Slides by D.A. Forsyth Scaled representations Big bars (resp. spots, hands, etc.) and little.

Texture Synthesis by Non-parametric Sampling Alexei Efros and Thomas Leung UC Berkeley.

Applications of Image Filters Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/04/10.

CAP5415: Computer Vision Lecture 4: Image Pyramids, Image Statistics, Denoising Fall 2006.

Local invariant features Cordelia Schmid INRIA, Grenoble.

INDEPENDENT COMPONENT ANALYSIS OF TEXTURES based on the article R.Manduchi, J. Portilla, ICA of Textures, The Proc. of the 7 th IEEE Int. Conf. On Comp.

Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.

University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.

Course 9 Texture. Definition: Texture is repeating patterns of local variations in image intensity, which is too fine to be distinguished. Texture evokes.

Texture Key issue: representing texture –Texture based matching little is known –Texture segmentation key issue: representing texture –Texture synthesis.

TEXTURE SYNTHESIS BY NON-PARAMETRIC SAMPLING VIVA-VITAL Nazia Tabassum 27 July 2015.

2D Texture Synthesis Instructor: Yizhou Yu. Texture synthesis Goal: increase texture resolution yet keep local texture variation.

MIT AI Lab / LIDS Laboatory for Information and Decision Systems & Artificial Intelligence Laboratory Massachusetts Institute of Technology A Unified Multiresolution.

CS654: Digital Image Analysis

Texture Analysis and Synthesis. Texture Texture: pattern that “looks the same” at all locationsTexture: pattern that “looks the same” at all locations.

Filters– Chapter 6. Filter Difference between a Filter and a Point Operation is that a Filter utilizes a neighborhood of pixels from the input image to.

Prof. Adriana Kovashka University of Pittsburgh September 14, 2016

Linear Filters and Edges Chapters 7 and 8

Announcements Project 4 out today help session at the end of class.

Distinctive Image Features from Scale-Invariant Keypoints

Linear Filters and Edges Chapters 7 and 8

Texture Synthesis by Non-parametric Sampling

Announcements Final Project 3 artifacts Evals

Outline S. C. Zhu, X. Liu, and Y. Wu, “Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo”, IEEE Transactions On Pattern Analysis And Machine.

Computer Vision Lecture 16: Texture II

Image filtering Images by Pawan Sinha.

Image filtering Images by Pawan Sinha.

Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.

Image filtering Images by Pawan Sinha.

Image Quilting for Texture Synthesis & Transfer

Announcements Guest lecture next Tuesday

Most slides from Steve Seitz

Image filtering Images by Pawan Sinha.

Outline Texture modeling - continued Julesz ensemble.

Image filtering

Image filtering

Grouping/Segmentation

Fourier Transform of Boundaries

Image Filtering Readings: Ch 5: 5. 4, 5. 5, 5. 6, , 5

Most slides from Steve Seitz

Some slides: courtesy of David Jacobs

Image Enhancement in the Spatial Domain

Sequences II Prof. Noah Snavely CS1114

Outline Texture modeling - continued Markov Random Field models

Presentation transcript:

Texture

Texture Edge detectors find differences in overall intensity. Average intensity is only simplest difference. many slides from David Jacobs

Issues: 1) Discrimination/Analysis (Freeman)

2) Synthesis

Other texture applications 3. Texture boundary detection. Segmentation 4. Shape from texture.

Gradient in the spacing of the barrels (Gibson 1957)

Texture gradient associated to converging lines (Gibson1957)

What is texture? Something that repeats with variation. Must separate what repeats and what stays the same. Model as repeated trials of a random process The probability distribution stays the same. But each trial is different.

Simplest Texture Each pixel independent, identically distributed (iid). Examples: Region of constant intensity. Gaussian noise pattern. Speckled pattern

Texture Discrimination is then Statistics Two sets of samples. Do they come from the same random process?

Simplest Texture Discrimination Compare histograms. Divide intensities into discrete ranges. Count how many pixels in each range. 0-25 26-50 51-75 76-100 225-250

How/why to compare Simplest comparison is SSD, many others. Can view probabilistically. Histogram is a set of samples from a probability distribution. With many samples it approximates distribution. Test probability samples drawn from same distribution. Ie., is difference greater than expected when two samples come from same distribution?

Chi square distance between texton histograms 0.1 j k 0.8 (Malik)

More Complex Discrimination Histogram comparison is very limiting Every pixel is independent. Everything happens at a tiny scale. Use output of filters of different scales.

Origin: First-order gray-level statistics: characterized by histogram Second-order gray-level statistics: described by co-occurrence matrix Autocorrelation function I(i,j)*I(-i,-j) Power spectrum of I(i,j) is square of magnitude of Fourier Transform Power spectrum of a function is Fourier transform of autocorrelation Various methods use Fourier transform (in polar representation)

Example (Forsyth & Ponce)

classification

What are Right Filters? Multi-scale is good, since we don’t know right scale a priori. Easiest to compare with naïve Bayes: Filter image one: (F1, F2, …) Filter image two: (G1, G2, …) S means image one and two have same texture. Approximate: P(F1,G1,F2,G2, …| S) By P(F1,G1|S)*P(F2,G2|S)*…

What are Right Filters? The more independent the better. In an image, output of one filter should be independent of others. Because our comparison assumes independence. Wavelets seem to be best.

Difference of Gaussian Filters

Spots and Oriented Bars (Malik and Perona)

Gabor Filters Gabor filters at different scales and spatial frequencies top row shows anti-symmetric (or odd) filters, bottom row the symmetric (or even) filters.

Gabor filters are examples of Wavelets We know two bases for images: Pixels are localized in space. Fourier are localized in frequency. Wavelets are a little of both. Good for measuring frequency locally.

Markov Model Captures local dependencies. Each pixel depends on neighborhood. Example, 1D first order model P(p1, p2, …pn) = P(p1)*P(p2|p1)*P(p3|p2,p1)*… = P(p1)*P(p2|p1)*P(p3|p2)*P(p4|p3)*…

Markov Chains Markov Chain a sequence of random variables is the state of the model at time t Markov assumption: each state is dependent only on the previous one dependency given by a conditional probability: The above is actually a first-order Markov chain An N’th-order Markov chain:

Markov Random Field A Markov random field (MRF) First-order MRF: generalization of Markov chains to two or more dimensions. First-order MRF: probability that pixel X takes a certain value given the values of neighbors A, B, C, and D: D C X A B X * Higher order MRF’s have larger neighborhoods

Texture Synthesis [Efros & Leung, ICCV 99] Can apply 2D version of text synthesis

Synthesizing One Pixel SAMPLE x sample image Generated image What is ? Find all the windows in the image that match the neighborhood consider only pixels in the neighborhood that are already filled in To synthesize x pick one matching window at random assign x to be the center pixel of that window

Really Synthesizing One Pixel SAMPLE x sample image Generated image An exact neighbourhood match might not be present So we find the best matches using SSD error and randomly choose between them, preferring better matches with higher probability

Growing Texture Starting from the initial image, “grow” the texture one pixel at a time

Window Size Controls Regularity

More Synthesis Results Increasing window size

More Results reptile skin aluminum wire

Failure Cases Growing garbage Verbatim copying

Image-Based Text Synthesis

Synthesis with Gabor filter Representation (Bergen and Heeger)

There are dependencies in Filter Outputs Edge Filter responds at one scale, often does at other scales. Filter responds at one orientation, often doesn’t at orthogonal orientation. Synthesis using wavelets and Markov model for dependencies: DeBonet and Viola Portilla and Simoncelli

Conclusions Model texture as generated from random process. Discriminate by seeing whether statistics of two processes seem the same. Synthesize by generating image with same statistics.