1. Previous lecture Texture Synthesis Texture Transfer + =

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

3. Image Analogies Aaron Hertzmann 1,2 Chuck Jacobs 2 Nuria Oliver 2 Brian Curless 3 David Salesin 2,3 1 New York University 2 Microsoft Research 3 University of Washington

4. Image Analogies AA’ BB’

6. Blur Filter

7. Edge Filter

8. AA’ BB’ Artistic Filters

9. Colorization

10. Texture-by-numbers AA’ BB’

11. Super-resolution Input A A’

12. Super-resolution Result B B’

13. Fill Order In what order should we fill the pixels?

14. Fill Order In what order should we fill the pixels? –choose pixels that have more neighbors filled –choose pixels that are continuations of lines/curves/edges Criminisi, Perez, and Toyama. “Object Removal by Exemplar-based Inpainting,” Proc. CVPR, 2003.Object Removal by Exemplar-based Inpainting

15. Criminisi, Perez, and Toyama. “Object Removal by Exemplar-based Inpainting,” Proc. CVPR, 2003.Object Removal by Exemplar-based Inpainting

16. Criminisi, Perez, and Toyama. “Object Removal by Exemplar-based Inpainting,” Proc. CVPR, 2003.Object Removal by Exemplar-based Inpainting

17. Confidence Term Data Term Criminisi, Perez, and Toyama. “Object Removal by Exemplar-based Inpainting,” Proc. CVPR, 2003.Object Removal by Exemplar-based Inpainting

18. Criminisi, Perez, and Toyama. “Object Removal by Exemplar-based Inpainting,” Proc. CVPR, 2003.Object Removal by Exemplar-based Inpainting

19. Graphcut Textures: Image and Video Synthesis Using Graph Cuts Vivek Kwatra, Arno Schödl, Irfan Essa, Greg Turk and Aaron Bobick To appear in Proc. ACM Transactions on Graphics, SIGGRAPH 2003 Vivek KwatraArno SchödlIrfan EssaGreg TurkAaron BobickSIGGRAPH 2003

20. Graph cut vs Dynamic Programming What’s the advantage of a graph cut over dynamic programming here?

25. Scene Completion