Perceptually-Driven Statistical Texture Modeling Eero Simoncelli - - PowerPoint PPT Presentation

perceptually driven statistical texture modeling
SMART_READER_LITE
LIVE PREVIEW

Perceptually-Driven Statistical Texture Modeling Eero Simoncelli - - PowerPoint PPT Presentation

Perceptually-Driven Statistical Texture Modeling Eero Simoncelli Howard Hughes Medical Institute, and New York University Javier Portilla University of Granada, Spain What is Visual Texture? Homogeneous, with repeated structures....


slide-1
SLIDE 1

Perceptually-Driven Statistical Texture Modeling

Eero Simoncelli Howard Hughes Medical Institute, and New York University Javier Portilla University of Granada, Spain

slide-2
SLIDE 2

What is “Visual Texture”?

Homogeneous, with repeated structures....

1/02

slide-3
SLIDE 3

What is “Visual Texture”?

Homogeneous, with repeated structures.... “You know it when you see it”

1/02

slide-4
SLIDE 4

Perceptual Texture Description

All Images

Texture Images Equivalence class (visually indistinguishable)

Perceptual model:

  • Set of texture images divided into equivalence classes (metamers)
  • Perceptual “distance” between classes

1/02

slide-5
SLIDE 5

Julesz’s Conjecture (1962)

Hypothesis: two textures with identical Nth-order pixel statistics look the same (for some N).

  • Explicit goal of capturing perceptual definition with a statistical model
  • Statistical measurements should be:

– universal (for all textures) – stationary (translation-invariant) – a minimal set (necessary and sufficient)

  • Julesz (and others) constructed counter-examples for N=2 and N=3, dis-

missing the hypothesis...

1/02

slide-6
SLIDE 6

Julesz’s Conjecture, Revisited

Why did the early attempts fail?

  • Right hypothesis, wrong model: A set of measurements equivalent to the

visual processes used for texture perception should satisfy the hypothesis.

  • Lacked a powerful methodology for testing whether a model satisfies the

hypothesis

  • We can benefit from advances of the past few decades:

– scientific: better understanding of early vision – engineering/mathematical: “wavelets”, statistical estimation, statistical sampling – technological: availability of powerful computers, digital images

1/02

slide-7
SLIDE 7

Testing a Texture Model

  • As with most scientific test, we seek counter-examples
  • Fundamental problem: we usually work with a small number of examples

(tens or hundreds).

  • Classification is an important application, but a weak test
  • Synthesis can provide a much stronger test...

1/02

slide-8
SLIDE 8

Testing a Model via Synthesis

Example

✂✁☎✄ ture

Image Random Seed Statistical Image Sampler Statistical Parameter Estimator Perceptual Comparison

  • Positive results are compelling, assuming:

– reference texture set contains a sufficient variety – statistical sampler generates “typical” examples

  • Negative results are definitive: A single failure indicates insufficiency of

constraints!

  • Partial necessity test: remove a constraint and find a failure example
  • Studying failures allows us to refine the model

1/02

slide-9
SLIDE 9

Methodological Ingredients

  • 1. Representative set of example texture images: Brodatz, VisTex, our own
  • 2. Method of estimating parameters: sample mean
  • 3. Method of generating sample images from model: primary topic of this

work

  • 4. Perceptual test: informal viewing

1/02

slide-10
SLIDE 10

Iterative Synthesis Algorithm

Synthesis Analysis

Transform

Measure Statistics

Example Texture Random Seed Synthesized Texture

Transform

Measure Statistics

Adjust Inverse Transform

Heeger & Bergen, ’95

1/02

slide-11
SLIDE 11

Transform: Steerable Pyramid

Example basis function Spectra Linear basis: multi-scale, oriented, complex. Basis functions are oriented bandpass filters, related by translation, dilation, rotation (directional derivatives, order K−1). Tight frame, 4K/3 overcompleteness for K orientations. Translation-invariant, rotation-invariant. Motivation: image processing, computer vision, biological vision.

1/02

slide-12
SLIDE 12

Steerable Pyramid: Example Decomposition

Real part of coefficients complex magnitude of coefficients Decomposition of a “disk” image

1/02

slide-13
SLIDE 13

Parameters: Marginal Statistics

Distribution of intensity values is captured with the first through fourth mo- ments of both the pixels and the lowpass coefficients at each pyramid scale. Note: A number of authors have used marginal histograms: Faugeras ’80 (pixels), Heeger & Bergen ’95 (wavelet), Zhu etal. ’96 (Gabor). 15 parameters

1/02

slide-14
SLIDE 14

Parameters: Spectral

Periodicity and globally oriented structure is best captured by frequency-domain measures (Francos, ’93). Can be captured by autocorrelation measurements (included in most texture models). In our model: central 7×7 region of the autocorrelation of each subband pro- vides a crude measure of spectral content within each subband. 125 parameters

1/02

slide-15
SLIDE 15

Parameters: Magnitude Correlation

Coefficient magnitudes are correlated both spatially and across bands. We cap- ture this with local autocorrelation and cross-correlation measurements. 472 parameters

1/02

slide-16
SLIDE 16

Parameters: Phase Correlation

Phases of complex responses at adjacent scales are aligned near image “fea- tures”. We capture this using a novel measure of relative phase: φ(f,c) = c2 · f ∗ |c| , where f is a fine-scale coefficient, c is a coarse-scale coefficient at the same location. 96 parameters Total parameters: 708

1/02

slide-17
SLIDE 17

Phase Correlation Example

input real/imag mag/phase real/imag mag/phase coarse

real imag phase mag x18 real imag phase mag x18

fine

real imag phase mag x18 real imag phase mag x18

rphase

real imag phase mag x20 real imag phase mag x18

1/02

slide-18
SLIDE 18

Implementation

(high) (low) (mid) build complex steerable pyramid impose autoCorr impose subband stats & reconstruct (coarse-to-fine) impose variance Gaussian noise + impose skew/kurt impose pixel statistics synthetic texture

Each statistic, φk( I), is imposed by gradient projection:

  • I′ =

I +λk ∇φk(I), s.t. φk( I) = mk, where mk are the parameter values estimated from the example texture.

1/02

slide-19
SLIDE 19

Example Synthesis Sequence

Initial 1 4 64 We cannot prove convergence. But in practice, algorithm converges rapidly (typical: 50 iterations). Run time: 256×256 image takes roughly 20 minutes (500 Mhz Pentium work- station, matlab code)

1/02

slide-20
SLIDE 20

Examples: Artificial

1/02

slide-21
SLIDE 21

Examples: Photographic, Quasi-periodic

1/02

slide-22
SLIDE 22

Examples: Photographic, Aperiodic

1/02

slide-23
SLIDE 23

Examples: Photographic, Structured

1/02

slide-24
SLIDE 24

Examples: Color

Color is incorporated by transforming to YIQ space, and including cross-band magnitude correlations in the parameterization.

1/02

slide-25
SLIDE 25

Examples: Non-textures?

1/02

slide-26
SLIDE 26

Necessity: Marginal Statistics

  • riginal

with without Needed for proper distribution of intensity values (at each scale).

1/02

slide-27
SLIDE 27

Necessity: Autocorrelation

  • riginal

with without Needed for capturing periodicity and global orientation.

1/02

slide-28
SLIDE 28

Necessity: Magnitude Correlation

  • riginal

with without Needed for capturing periodicity local structure.

1/02

slide-29
SLIDE 29

Necessity: Relative Phase

  • riginal

with without Needed for capturing details of local structure (edges vs. lines), and shading.

1/02

slide-30
SLIDE 30

Julesz Counter-Examples

Examples with identical 3rd-order pixel statistics Left: Julesz ’78; Right: Yellott ’93

1/02

slide-31
SLIDE 31

Spatial Extrapolation

Modification: incorporate an additional projection operation in the synthesis loop, replacing central pixels by those of the original.

1/02

slide-32
SLIDE 32

Scale Extrapolation

Modification: incorporate an additional projection operation in the synthesis loop, replacing coarse-resolution coefficients by those of the original.

1/02

slide-33
SLIDE 33

Texture Mixtures

Modification: choose parameter vector that that is the average of those associ- ated with two example textures.

1/02

slide-34
SLIDE 34

Conclusions

  • A framework for texture modeling, based on that originally proposed by

Julesz

  • New texture model:

– based on biologically-inspired statistical measurements – includes methodology for testing – provides heuristic methodology for refinement – can be applied to a wide range of problems Further information: http://www.cns.nyu.edu/∼lcv/texture

1/02

slide-35
SLIDE 35

To Do

  • Adaptive front-end transformation (e.g., Zhu et al ’96, Manduchi & Portilla

’99)

  • Eliminate redundancy of parameterization
  • Applications: compression, super-resolution, texture interpolation, texture

painting...

1/02