1
|
- Project 4 questions?
- Review thisThursday
- Final Exam
- 10:30-12:20pm, Thursday, Mar. 20
- Evaluations today at the end of class
|
2
|
|
3
|
- Today’s Reading
- Alexei A. Efros and Thomas K. Leung, “Texture Synthesis by
Non-parametric Sampling,” Proc. International Conference on Computer
Vision (ICCV), 1999.
- http://www.cs.berkeley.edu/~efros/research/NPS/efros-iccv99.pdf
|
4
|
- What is texture?
- How can we model it?
|
5
|
- 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:
|
6
|
- “A dog is a man’s best friend. It’s a dog eat dog world out there.”
|
7
|
- Create plausible looking poetry, love letters, term papers, etc.
- Most basic algorithm
- Build probability histogram
- find all blocks of N consecutive words/letters in training documents
- compute probability of occurance
- Given words
- Example on board...
|
8
|
- “I Spent an Interesting Evening Recently with a Grain of Salt”
- - Mark V.
Shaney
- (computer-generated contributor to UseNet News group called net.singles)
- You can try it online here: http://www.yisongyue.com/shaney/
|
9
|
- What is texture?
- An image obeying some statistical properties
- Similar structures repeated over and over again
- Often has some degree of randomness
|
10
|
|
11
|
- Can apply 2D version of text synthesis
|
12
|
- 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
|
13
|
|
14
|
|
15
|
|
16
|
|
17
|
|
18
|
|
19
|
|
20
|
|
21
|
- Given: image of k2
pixels
- Output: image of n2
pixels
- how many window comparisons does this algorithm require?
|
22
|
|
23
|
|
24
|
|
25
|
- In what order should we fill the pixels?
|
26
|
- In what order should we fill the pixels?
- choose pixels that have more neighbors filled
- choose pixels that are continuations of lines/curves/edges
|
27
|
|
28
|
- Can also be formulated as image diffusion
- Idea of propagating along lines comes from
- Bertalmío, Sapiro, Caselles, and Ballester, “Image Inpainting,” Proc.
SIGGRAPH 2000.
|
29
|
|
30
|
|
31
|
|
32
|
|
33
|
|
34
|
|
35
|
|
36
|
|
37
|
|
38
|
|
39
|
|
40
|
|
41
|
|
42
|
|
43
|
|
44
|
- Efros and Leung, “Texture Synthesis by Non-parametric Sampling,” Proc.
ICCV, 1999.
- Efros and Freeman, “Image Quilting for Texture Synthesis and Transfer,”
Proc. SIGGRAPH 2001.
- Bertalmío, Sapiro, Caselles, and Ballester, “Image Inpainting,” Proc.
SIGGRAPH 2000.
- Criminisi, Perez, and Toyama. “Object Removal by Exemplar-based
Inpainting,” Proc. CVPR, 2003.
- Kwatra, Schödl, Essa, Turk, and Bobick, “Graphcut Textures: Image and
Video Synthesis Using Graph Cuts,” Proc. SIGGRAPH 2003.
- Hertzmann, Jacobs, Oliver, Curless, and Salesin, “Image Analogies,”
Proc. SIGGRAPH 2001.
- Bhat, Seitz, Hodgins, Khosla, “Flow-Based Video Synthesis and Editing,”
Proc. SIGGRAPH 2004.
|