Texture Turk, 91.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Computer Aided Diagnosis: Feature Extraction
Texture. Limitation of pixel based processing Edge detection with different threshold.
電腦視覺 Computer and Robot Vision I
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:
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
Computer Vision Lecture 16: Texture
Texture. Edge detectors find differences in overall intensity. Average intensity is only simplest difference. many slides from David Jacobs.
The Global Digital Elevation Model (GTOPO30) of Great Basin Location: latitude 38  15’ to 42  N, longitude 118  30’ to 115  30’ W Grid size: 925 m.
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:
Markov chains Prof. Noah Snavely CS1114
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.
Announcements Big mistake on hint in problem 1 (I’m very sorry).
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
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:
Regionalized Variables take on values according to spatial location. Given: Where: A “structural” coarse scale forcing or trend A random” Local spatial.
Visual Information Systems Image Content. Visual cues to recover 3-D information There are number of cues available in the visual stimulus There are number.
Announcements For future problems sets: matlab code by 11am, due date (same as deadline to hand in hardcopy). Today’s reading: Chapter 9, except.
(1) Feature-point matching by D.J.Duff for CompVis Online: Feature Point Matching Detection, Extraction.
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
E.G.M. PetrakisTexture1 Repeative patterns of local variations of intensity on a surface –texture pattern: texel Texels: similar shape, intensity distribution.
Texture Readings: Ch 7: all of it plus Carson paper
CS292 Computational Vision and Language Visual Features - Colour and Texture.
Run-Length Encoding for Texture Classification
Information that lets you recognise a region.
Entropy and some applications in image processing Neucimar J. Leite Institute of Computing
Copyright © 2012 Elsevier Inc. All rights reserved.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 11 Representation & Description Chapter 11 Representation.
CSC2535: Computation in Neural Networks Lecture 11: Conditional Random Fields Geoffrey Hinton.
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 analysis Team 5 Alexandra Bulgaru Justyna Jastrzebska Ulrich Leischner Vjekoslav Levacic Güray Tonguç.
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.
Digital Image Processing CSC331
Course 9 Texture. Definition: Texture is repeating patterns of local variations in image intensity, which is too fine to be distinguished. Texture evokes.
Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.
November 30, PATTERN RECOGNITION. November 30, TEXTURE CLASSIFICATION PROJECT Characterize each texture so as to differentiate it from one.
By Brian Lam and Vic Ciesielski RMIT University
Colour and Texture. Extract 3-D information Using Vision Extract 3-D information for performing certain tasks such as manipulation, navigation, and recognition.
CS654: Digital Image Analysis
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Image Quality Measures Omar Javed, Sohaib Khan Dr. Mubarak Shah.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Texture Analysis and Synthesis. Texture Texture: pattern that “looks the same” at all locationsTexture: pattern that “looks the same” at all locations.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
Texture Models Paul Heckbert, Nov , Image-Based Modeling and Rendering.
By Brian Lam and Vic Ciesielski RMIT University
- photometric aspects of image formation gray level images
Texture.
Announcements Project 4 out today help session at the end of class.
COMP 9517 Computer Vision Texture 6/22/2018 COMP 9517 S2, 2009.
Materi 10 Analisis Citra dan Visi Komputer
Announcements Final Project 3 artifacts Evals
Computer Vision Lecture 16: Texture II
Computer Vision Chapter 9
Outline Neural networks - reviewed Texture modeling
Texture.
Texture, optics and shading
Announcements Guest lecture next Tuesday
Outline Texture modeling - continued Julesz ensemble.
Fourier Transform of Boundaries
Recognition and Matching based on local invariant features
Random Neural Network Texture Model
Outline Texture modeling - continued Markov Random Field models
Presentation transcript:

Texture Turk, 91

What is texture ? There is no accurate definition. It is often used to represent all the “details” in the image. (F.e, sometimes images are divided to shape + texture. In our case we refer to the texture as images or patterns with some kind of “structure”.

What is texture ? (cont’) repetition stochastic both fractal

What would we like to do with textures? Detect regions / images with textures. Classify using texture. Segmentation: divide the image into regions with uniform texture. Synthesis – given a sample of the texture, generate random images with the same texture. Compression (Especially fractals) Why is it difficult ?

Periodic Texture big assumption: the image is periodic, completely specified by a fundamental region. no allowance for statistical variations this approach is fine if image is periodic, but too limited as a general texture model.

Texture primitives The basic elements that form the texture. Sometimes, they are called “texels”. Primitives do not always exists ( or are not visible). In textures which are not periodic, the texel is the “essential” size of the texture. There might be textures with structure in several resolutions (bricks) Fractals have the similar structure in each resolution. “we don’t see the forest.”

Texture Description Auto-correlation Fourier Transform in small windows Wavlets or Filter banks Feature vectors Statistical descriptors Markov Chains …

The auto-correlation Describes the relations between neighboring pixels. Equivalently, we can analyze the power spectrum of the window: We apply a Fourier Transform in small windows. Analyzing the power spectrum: Periodicity: The energy of different frequencies. Directionality: The energy of slices in different directions.

Filter banks Instead of using the Fourier Basis, apply filters which best classify different textures. Use filters of varying orientations. Use filters of varying scales: Laplacian pyramids Wavlets pyramids … Gabor Filters (Local sinuses in varying scales and directions). Filters which describe certain properties ( Entropy, Energy, Coarseness…) Some successful results in texture segmentation were achieved using moment-based features (mean, variance)

What can we do with these features? For each pixel (or window) attach a vector of features. Use this vector to calculate the “distance” between different windows. We can compute statistics of the features in a region: Use the statistics to separate between different textures. … We can determine the “essential” size of the texture: the size in which the statistics are “interesting”.

Second order statistics (or co-occurrence matrices) The intensity histogram is very limited in describing a texture (f.e - checkerboard versus white-black regions. Use higher-level statistics: Pairs distribution. From this matrix, generate a list of features: Energy Entropy (can also be used as a measure for “textureness”). Homogeneity ( ) 0 1 2 3 Example: co-occurrence matrix of I(x,y) and I(x+1,y) Normalize the matrix to get probabilities. 1 2 3

Texture as a Stochastic Process A random variable is a value with a given probability distribution. A discrete stochastic process is a sequence or array of random variables, statistically interrelated. Conditional probability P[A|B,C] means probability of A given B and C

Markov Chain Assume that each variable depends only on the n preceding values. In this case, we have a Markov chain of order n. We estimate the process using an histogram of groups of size n (The co-occurrence matrix is a special case with n=2) We can use this process to synthesis new images ! Markov Random Field: The same, but 2D.

Markov Chain Example Output of 2nd order word-level Markov Chain [Scientific American, June 1989, Dewdney] after training on 90,000 word philosophical “If we were to revive the fable is useless. Perhaps only the allegory of simulation is unendurable--more cruel than Artaud’s Theatre of Cruelty, which was the first to practice deterrence, abstraction, disconnection, deterritorialisation, etc.; and if it were our own past. We are witnessing the end of the negative form. But nothing separates one pole from the very swing of voting ’’rights’’ to electoral...”

Region texels Divide the image into uniform regions. Use this regions as the texels, or image primitives. Use the structure of this regions to make a statistics about the texture. For example: Directionality diameter versus boundary length

Shape from texture Under the assumption of isotropic patterns, we can use this to recover shape. If the texture is periodic, we can use the size differences between the primitives to recover shape. For example, assuming a planar scene, we can use the direction of maximum rate of change of the primitives size: “texture gradient”

Summery There are many ways to describe a texture: Different kinds of filters. Statistical descriptors. Texture as a random process. For each pixel/region we attach the vector of features. Some works try to recover the primitives. In some cases, it can be used to learn the 3D shape. Many applications. For example: Texture synthesis.