Data-driven methods: Video & Texture

Cs195g Computational PhotographyJames Hays, Brown, Spring 2010Many slides from Alexei Efros

Michel Gondry train video

http://youtube.com/watch?v=qUEs1BwVXGA

Weather Forecasting for Dummies™ Let’s predict weather:

• Given today’s weather only, we want to know tomorrow’s• Suppose weather can only be {Sunny, Cloudy, Raining}

The “Weather Channel” algorithm:• Over a long period of time, record:

– How often S followed by R

– How often S followed by S

– Etc.

• Compute percentages for each state: – P(R|S), P(S|S), etc.

• Predict the state with highest probability!• It’s a Markov Chain

4.04.02.0

3.03.04.0

1.06.03.0

Markov Chain

What if we know today and yesterday’s weather?

Text Synthesis

[Shannon,’48] proposed a way to generate English-looking text using N-grams:• Assume a generalized Markov model• Use a large text to compute prob. distributions of

each letter given N-1 previous letters • Starting from a seed repeatedly sample this Markov

chain to generate new letters • Also works for whole words

WE NEED TO EAT CAKE

Mark V. Shaney (Bell Labs)

Results (using alt.singles corpus):• “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”

Data Driven MethodsThe answer to most non-trivial questions is “Let’s see

what the data says”, rather than “Let’s build a compact parametric model” or “Let’s simulate it from the ground up”.

This can seem unappealing in its simplicity (see Chinese Room thought experiment), but there are still critical issues of representation, generalization, and data choices.

In the end, data driven methods work very well.

“Every time I fire a linguist, the performance of our speech recognition system goes up.” “ Fred Jelinek (Head of IBM's Speech Recognition Group), 1988

Video TexturesVideo Textures

Arno Schödl

Richard Szeliski

David Salesin

Irfan Essa

Microsoft Research, Georgia Tech

Still photosStill photos

Video clipsVideo clips

Video texturesVideo textures

Problem statementProblem statement

video clip video texture

Our approachOur approach

• How do we find good transitions?

Finding good transitions Finding good transitions

• Compute L2 distance Di, j between all

frames

Similar frames make good transitions

frame ivs.

frame j

Markov chain representationMarkov chain representation

2 3 41

Similar frames make good transitions

Transition costs Transition costs

• Transition from i to j if successor of i is similar to j

• Cost function: Cij = Di+1, j

• i

j

i+ 1

j-1

i j D i+ 1, j

Transition probabilitiesTransition probabilities

•Probability for transition Pij inversely related

to cost:•Pij ~ exp ( – Cij / 2 )

high low

Preserving dynamicsPreserving dynamics

Preserving dynamics Preserving dynamics

Preserving dynamics Preserving dynamics

• Cost for transition ij

• Cij = wk Di+k+1, j+kk = -N

N -1

i

j j+ 1

i+ 1 i+ 2

j-1j-2

i jD i, j - 1 D Di+ 1, j i+ 2, j+ 1

i-1

D i-1, j-2

Preserving dynamics – effect Preserving dynamics – effect

• Cost for transition ij

• Cij = wk Di+k+1, j+kk = -N

N -1

2 3 41

Dead endsDead ends

• No good transition at the end of sequence

2 3 41

Future costFuture cost

• Propagate future transition costs backward

• Iteratively compute new cost

• Fij = Cij + mink Fjk

2 3 41

Future costFuture cost

• Propagate future transition costs backward

• Iteratively compute new cost

• Fij = Cij + mink Fjk

2 3 41

Future costFuture cost

• Propagate future transition costs backward

• Iteratively compute new cost

• Fij = Cij + mink Fjk

2 3 41

Future costFuture cost

• Propagate future transition costs backward

• Iteratively compute new cost

• Fij = Cij + mink Fjk

2 3 41

• Propagate future transition costs backward

• Iteratively compute new cost

• Fij = Cij + mink Fjk

• Q-learning

Future costFuture cost

Future cost – effectFuture cost – effect

Finding good loopsFinding good loops

• Alternative to random transitions

• Precompute set of loops up front

Video portraitVideo portrait

• Useful for web pages

Region-based analysisRegion-based analysis

• Divide video up into regions

• Generate a video texture for each region

Automatic region analysisAutomatic region analysis

User selects target frame range

User-controlled video texturesUser-controlled video textures

slow variable fast

Video-based animationVideo-based animation

• Like spritescomputer games

• Extract spritesfrom real video

• Interactively control desired motion

©1985 Nintendo of America Inc.

Video sprite extractionVideo sprite extraction

blue screen m attingand velocity estim ation

C i j = + angle C i j

vector tom ouse pointer

S im ilarity term Contro l term

velocity vector

Animation{ {

Video sprite controlVideo sprite control

• Augmented transition cost:

F i j

F i j

F i j F i j

F i j

F i jF i j

S W

W

N W

N

N E

E

S E

S

G oal

Video sprite controlVideo sprite control

• Need future cost computation

• Precompute future costs for a few angles.

• Switch between precomputed angles according to user input

• [GIT-GVU-00-11]

Interactive fishInteractive fish

Summary Summary

• Video clips video textures

• define Markov process

• preserve dynamics

• avoid dead-ends

• disguise visual discontinuities

Discussion Discussion

• Some things are relatively easy

Discussion Discussion

• Some are hard

“Amateur” by Lasse Gjertsen

http://www.youtube.com/watch?v=JzqumbhfxRo