CSCI 1290: Comp Photo
|
|
- Mavis McCarthy
- 5 years ago
- Views:
Transcription
1 CSCI 1290: Comp Photo Fall Brown University James Tompkin Many slides thanks to James Hays old CS 129 course, along with all of its acknowledgements.
2 Smartphone news Qualcomm Snapdragon 675 just announced Triple camera config on mid-tier chipset -> moar cameras! Support for features such as: Telephoto (long focal length camera) Wide angle (short focal length camera) Super-wide angle (?? very short focal length camera??) Enhanced portrait mode (Bokeh) 3D face unlock Epic selfies (???) Limitless slo-mo (limitless in recording time, not in anything else) AI: scene/object detection, image style transfer, portrait relighting
3
4
5
6 Today: pixels, patched, & graphs
7 Project 4 - Minimal error boundaries overlapping blocks vertical boundary 2 _ = overlap error min. error boundary
8 Simple Media Retargeting Operators Letterboxing Scaling?? Michael Rubinstein MIT CSAIL
9 Content-aware Retargeting Operators Important content Contentaware Contentoblivious Michael Rubinstein MIT CSAIL
10 Content-aware Retargeting Scale Crop Content-aware Input less-important content Michael Rubinstein MIT CSAIL
11 Image Retargeting Problem statement: Input Image I of n m pixels, and new image size n m Output Image I of size n m which will be good representative of the original image I. To date, no agreed definition, or measure, as to what a good representative is in this context! Michael Rubinstein MIT CSAIL
12 Image/Video Retargeting In large, we would expect: 1. Adhere to the geometric constraints (display/aspect ratio) 2. Preserve the important content and structures 3. Limit artifacts 4. Perhaps a new representation that will support different sizes? Very Ill-posed! How do we define important? Is there a universal ground truth? Would different viewers think the same about a retargeted image? What about artistic impression in the original content? Michael Rubinstein MIT CSAIL
13 Importance (Saliency) Measures A function S: p [0,1] Wang et al More sophisticated: attention models, eye tracking (gazing studies), face detectors, Michael Rubinstein MIT CSAIL Judd et al. ICCV09 Learning to predict where people look
14 Previous Retargeting Approaches Optimal Cropping Window For videos: Pan and scan Still done manually in the movie industry Michael Rubinstein MIT CSAIL Liu and Gleicher, Video Retargeting: Automating Pan and Scan (2006)
15 Cropping Michael Rubinstein MIT CSAIL
16 Seam Carving Assume m n m n, n < n (summarization) Basic Idea: remove unimportant pixels from the image Unimportant = pixels with less energy Intuition for gradient-based energy: Preserve strong contours Human vision more sensitive to edges so try remove content from smoother areas Simple, enough for producing some nice results See their paper for more measures they have used Michael Rubinstein MIT CSAIL
17 Pixel Removal Michael Rubinstein MIT CSAIL Optimal Least-energy pixels (per row) Least-energy columns
18 A Seam A connected path of pixels from top to bottom (or left to right). Exactly one in each row Michael Rubinstein MIT CSAIL
19 Finding the Seam? Michael Rubinstein MIT CSAIL
20 The Optimal Seam E( I) = I + I x y s * = arg min S E( s) Michael Rubinstein MIT CSAIL
21 The recursion relation The Optimal Seam ( M( i 1, j 1), M( i 1, j), M( i 1, 1) ) M( i, j) = E( i, j) + min j + Can be solved efficiently using dynamic programming in O( s n m) (s=3 in the original algorithm) Michael Rubinstein MIT CSAIL
22 Dynamic Programming Invariant property: M(i,j) = minimal cost of a seam going through (i,j) (satisfying the seam properties) Michael Rubinstein MIT CSAIL
23 Dynamic Programming ( M( i 1, j 1), M( i 1, j), M( i 1, 1) ) M( i, j) = E( i, j) + min j Michael Rubinstein MIT CSAIL
24 Dynamic Programming ( M( i 1, j 1), M( i 1, j), M( i 1, 1) ) M( i, j) = E( i, j) + min j Michael Rubinstein MIT CSAIL
25 Dynamic Programming ( M( i 1, j 1), M( i 1, j), M( i 1, 1) ) M( i, j) = E( i, j) + min j Michael Rubinstein MIT CSAIL
26 Searching for Minimum Backtrack (can store choices along the path, but do not have to) Michael Rubinstein MIT CSAIL
27 Backtracking the Seam Michael Rubinstein MIT CSAIL
28 Backtracking the Seam Michael Rubinstein MIT CSAIL
29 Backtracking the Seam Michael Rubinstein MIT CSAIL
30 H & V Cost Maps High cost Low cost Michael Rubinstein MIT CSAIL Horizontal Cost Vertical Cost
31 Michael Rubinstein MIT CSAIL Seam Carving
32 The Seam-Carving Algorithm SEAM-CARVING(im,n ) // size(im) = mxn 1. Do (n-n ) times 2.1. E Compute energy map on im 2.2. s Find optimal seam in E 2.3. im Remove s from im 2. Return im For vertical resize: transpose the image Running time: 2.1 O(mn) 2.2 O(mn) 2.3 O(mn) O(dmn) d=n-n Michael Rubinstein MIT CSAIL
33 Changing Aspect Ratio Michael Rubinstein MIT CSAIL
34 Changing Aspect Ratio Seam Carving Original Scaling Michael Rubinstein MIT CSAIL
35 Changing Aspect ratio Michael Rubinstein MIT CSAIL Cropping Seams Scaling
36 Changing Aspect Ratio Scaling Michael Rubinstein MIT CSAIL
37 Changing Aspect Ratio Scaling Michael Rubinstein MIT CSAIL
38 Seam Carving in the Gradient Domain Michael Rubinstein MIT CSAIL
39 Image Expansion (Synthesis) Michael Rubinstein MIT CSAIL
40 Image Expansion take 2 Michael Rubinstein MIT CSAIL Scaling
41 Enlarged or Reduced? Michael Rubinstein MIT CSAIL
42 Combined Insert and Remove Insert & remove seams Scaling Michael Rubinstein MIT CSAIL
43 Multi-Size Images We can create a new representation of an image that will allow adapting it to different sizes! 1. Precompute all seams once 2. Realtime resizing / transmit with content First to be removed Last to be removed Michael Rubinstein MIT CSAIL
44 Retargeting Video Michael Rubinstein MIT CSAIL
45 Auxiliary Energy Recall our seam equation ( M( i 1, j 1), M( i 1, j), M( i 1, 1) ) M( i, j) = E( i, j) + min j + Michael Rubinstein MIT CSAIL
46 Michael Rubinstein MIT CSAIL With face detector
47 With User Constraints Michael Rubinstein MIT CSAIL
48 Object Removal Michael Rubinstein MIT CSAIL
49 Object Removal Michael Rubinstein MIT CSAIL
50 Limitations Michael Rubinstein MIT CSAIL
51 Preserved Energy - Revisited Average Pixel Energy Image Reduction Michael Rubinstein MIT CSAIL crop column seam pixel optimal
52 Inserted Energy Michael Rubinstein MIT CSAIL
53 Minimize Inserted Energy Instead of removing the seam of least energy, remove the seam that inserts the least energy to the image! Michael Rubinstein MIT CSAIL
54 Tracking Inserted Energy p i-1,j-1 p i-1,j p i-1,j+1 p i,j-1 p i,j p i,j+1 Three possibilities when removing pixel P i,j Michael Rubinstein MIT CSAIL
55 Pixel P i,j : Left Seam p i-1,j-1 p i-1,j p i-1,j+1 p i,j-1 p i,j p i,j+1 Michael Rubinstein MIT CSAIL
56 Pixel P i,j : Right Seam p i-1,j-1 p i-1,j p i-1,j+1 p i,j-1 p i,j p i,j+1 Michael Rubinstein MIT CSAIL
57 Pixel P i,j : Vertical Seam p i-1,j-1 p i-1,j p i-1,j+1 p i,j-1 p i,j p i,j+1 Michael Rubinstein MIT CSAIL
58 Old Backward Energy E Michael Rubinstein MIT CSAIL
59 New Forward Looking Energy E Michael Rubinstein MIT CSAIL
60 Adding Pixel Energy Michael Rubinstein MIT CSAIL
61 Results Backward Input Backward Forward Input Forward Michael Rubinstein MIT CSAIL
62 Results Michael Rubinstein MIT CSAIL
63 Backward vs. Forward Michael Rubinstein MIT CSAIL Backward Forward
64 Results Michael Rubinstein MIT CSAIL
65 Discrete vs. Continuous [Avidan and Shamir 2007] [Wang et al 2008] Continuous Discrete Michael Rubinstein MIT CSAIL
66 From Images to Videos In general, video processing is a much (much!) harder problem 1. Cardinality Suppose 1min of video x 30 fps = 1800 frames Say your algorithm processes an image in 1 minute 30 hours!! 2. Dimensionality/algorithmic Temporal coherency: human visual system is highly sensitive to motion! Michael Rubinstein MIT CSAIL
67 Seam-Carving Video? Naive frame by frame independently Time Michael Rubinstein MIT CSAIL
68 Frame-by-frame Seam-Carving *Representative seams Michael Rubinstein MIT CSAIL
69 From 2D to 3D 1D paths in images 2D manifolds in video cubes Michael Rubinstein MIT CSAIL
70 Challenges Dynamic Programming no longer applicable Reduction to min-cut graph problem Cut must fulfill seam constraints 1. Monotonic (cut each row exactly once) 2. Connected Cut should be a function! Michael Rubinstein MIT CSAIL
71 Graph Construction Not monotonic Michael Rubinstein MIT CSAIL
72 Graph Construction Monotonic, not connected Michael Rubinstein MIT CSAIL
73 Graph Construction Forward Backward Energy Michael Rubinstein MIT CSAIL
74 Multiresolution Graph Cut Lombaert et al. [2005] Michael Rubinstein MIT CSAIL
75 Video Retargeting Video Michael Rubinstein MIT CSAIL
76 Does retargeting actually work? CR is cropping Michael Rubinstein, Diego Gutierrez, Olga Sorkine, Ariel Shamir A Comparative Study of Image Retargeting ACM Transactions on Graphics, Volume 29, Number 5 (Proc. SIGGRAPH Asia) 2010 Michael Rubinstein MIT CSAIL
77 Texture Synthesis Goal of Texture Synthesis: create new samples of a given texture Many applications: virtual environments, holefilling, texturing surfaces
78 The Challenge Need to model the whole spectrum: from repeated to stochastic texture
79 Efros & Leung Algorithm non-parametric sampling p Synthesizing a pixel Input image Assuming Markov property, compute P(p N(p)) Building explicit probability tables infeasible Instead, we search the input image for all similar neighborhoods that s our pdf for p To sample from this pdf, just pick one match at random
80 input Neighborhood Window
81 Varying Window Size Increasing window size
82 Synthesis Results french canvas rafia weave
83 More Results white bread brick wall
84 Homage to Shannon
85 Summary The Efros & Leung algorithm Very simple Surprisingly good results but very slow
86 Image Quilting [Efros & Freeman] p B Synthesizing a block non-parametric sampling Input image Observation: neighbor pixels are highly correlated Idea: unit of synthesis = block Exactly the same but now we want P(B N(B)) Much faster: synthesize all pixels in a block at once Not the same as multi-scale!
87 block Input texture B1 B2 B1 B2 B1 B2 Random placement of blocks Neighboring blocks constrained by overlap Minimal error boundary cut
88 Minimal error boundary overlapping blocks vertical boundary 2 _ = overlap error min. error boundary
89 Our Philosophy The Corrupt Professor s Algorithm : Plagiarize as much of the source image as you can Then try to cover up the evidence Rationale: Texture blocks are by definition correct samples of texture so problem only connecting them together
90
91
92
93
94
95
96 Failures (Chernobyl Harvest)
97 Portilla & Simoncelli Xu, Guo & Shum input image Wei & Levoy Our algorithm
98 Portilla & Simoncelli Xu, Guo & Shum input image Wei & Levoy Our algorithm
99 Portilla & Simoncelli Xu, Guo & Shum input image Wei & Levoy Our algorithm
100 Political Texture Synthesis!
101 Application: Texture Transfer Try to explain one object with bits and pieces of another object: + =
102 Texture Transfer Constraint Texture sample
103 Texture Transfer Take the texture from one image and paint it onto another object Same as texture synthesis, except an additional constraint: 1. Consistency of texture 2. Similarity to the image being explained
104 + =
105
106 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
107 Image Analogies A A B B
108
109 Image Analogies Hertzmann et al A is to A as B is to B Learn A = f(a), apply B = f(b) Use patch similarity
110 Blur Filter
111 Edge Filter
112 Artistic Filters A A B B
113 Image Analogies Hertzmann et al. 2000
114
115
116 How does it work?
117 Features Luminance channel (remapped so that statistics of A and B are similar) Steerable pyramid on luminance channel Multi-scale oriented edge kernels That s it.
118 Colorization
119 Texture-by-numbers A A B B
120 Super-resolution Input A A
121 Super-resolution Result B B
122 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
123 Graph cut vs Dynamic Programming What s the advantage of a graph cut over dynamic programming here?
124
125
126
127
128 Scene Completion
129 Don t blend, CUT! So far we only tried to blend between two images. What about finding an optimal seam? Moving objects become ghosts
130 Davis, 1998 Segment the mosaic Single source image per segment Avoid artifacts along boundaries Dijkstra s algorithm
131 Graph cuts (simple example à la Boykov&Jolly, ICCV 01) Dynamic programming can t handle loops.. Use graph cuts if we want similar cut-where-things-agree idea, but for closed regions which form a loop. Note: this image example is not a loop; It just shows the idea of a cut as related to graph flow. Image segmentation hard constraint sink n-links source a cut hard constraint Image pixels as nodes Minimum cost cut can be computed in polynomial time (max-flow/min-cut algorithms)
132 Kwatra et al, 2003 Actually, for this example, dynamic programming would work just as well, because the region isn t closed
133 Lazy Snapping This one is a loop! Interactive segmentation using graphcuts
134 Putting it all together Compositing images Have a clever blending function Feathering Center-weighted blend different frequencies differently Gradient based blending Choose the right pixels from each image Dynamic programming optimal seams Graph-cuts Now, let s put it all together: Interactive Digital Photomontage, 2004 (video)
135
Seam-Carving. Michael Rubinstein MIT. and Content-driven Retargeting of Images (and Video) Some slides borrowed from Ariel Shamir and Shai Avidan
Seam-Carving and Content-driven Retargeting of Images (and Video) Michael Rubinstein MIT Some slides borrowed from Ariel Shamir and Shai Avidan Display Devices Content Retargeting PC iphone Page Layout
More informationTexture Synthesis. Darren Green (
Texture Synthesis Darren Green (www.darrensworld.com) 15-463: Computational Photography Alexei Efros, CMU, Fall 2006 Texture Texture depicts spatially repeating patterns Many natural phenomena are textures
More informationTexture Synthesis. Darren Green (
Texture Synthesis Darren Green (www.darrensworld.com) 15-463: Computational Photography Alexei Efros, CMU, Fall 2005 Texture Texture depicts spatially repeating patterns Many natural phenomena are textures
More informationData-driven methods: Video & Texture. A.A. Efros
Data-driven methods: Video & Texture A.A. Efros 15-463: Computational Photography Alexei Efros, CMU, Fall 2010 Michel Gondry train video http://youtube.com/watch?v=ques1bwvxga Weather Forecasting for Dummies
More informationData-driven methods: Video & Texture. A.A. Efros
Data-driven methods: Video & Texture A.A. Efros CS194: Image Manipulation & Computational Photography Alexei Efros, UC Berkeley, Fall 2014 Michel Gondry train video http://www.youtube.com/watch?v=0s43iwbf0um
More informationAdmin. Data driven methods. Overview. Overview. Parametric model of image patches. Data driven (Non parametric) Approach 3/31/2008
Admin Office hours straight after class today Data driven methods Assignment 3 out, due in 2 weeks Lecture 8 Projects.. Overview Overview Texture synthesis Quilting Image Analogies Super resolution Scene
More informationTopics. Image Processing Techniques and Smart Image Manipulation. Texture Synthesis. Topics. Markov Chain. Weather Forecasting for Dummies
Image Processing Techniques and Smart Image Manipulation Maneesh Agrawala Topics Texture Synthesis High Dynamic Range Imaging Bilateral Filter Gradient-Domain Techniques Matting Graph-Cut Optimization
More informationTexture. CS 419 Slides by Ali Farhadi
Texture CS 419 Slides by Ali Farhadi What is a Texture? Texture Spectrum Steven Li, James Hays, Chenyu Wu, Vivek Kwatra, and Yanxi Liu, CVPR 06 Texture scandals!! Two crucial algorithmic points Nearest
More informationTexture. The Challenge. Texture Synthesis. Statistical modeling of texture. Some History. COS526: Advanced Computer Graphics
COS526: Advanced Computer Graphics Tom Funkhouser Fall 2010 Texture Texture is stuff (as opposed to things ) Characterized by spatially repeating patterns Texture lacks the full range of complexity of
More informationImage Blending and Compositing NASA
Image Blending and Compositing NASA CS194: Image Manipulation & Computational Photography Alexei Efros, UC Berkeley, Fall 2016 Image Compositing Compositing Procedure 1. Extract Sprites (e.g using Intelligent
More information+ = The Goal of Texture Synthesis. Image Quilting for Texture Synthesis & Transfer. The Challenge. Texture Synthesis for Graphics
Image Quilting for Texture Synthesis & Transfer Alexei Efros (UC Berkeley) Bill Freeman (MERL) The Goal of Texture Synthesis True (infinite) texture input image SYNTHESIS generated image Given a finite
More informationTexture Synthesis and Manipulation Project Proposal. Douglas Lanman EN 256: Computer Vision 19 October 2006
Texture Synthesis and Manipulation Project Proposal Douglas Lanman EN 256: Computer Vision 19 October 2006 1 Outline Introduction to Texture Synthesis Previous Work Project Goals and Timeline Douglas Lanman
More informationMedian filter. Non-linear filtering example. Degraded image. Radius 1 median filter. Today
Today Non-linear filtering example Median filter Replace each pixel by the median over N pixels (5 pixels, for these examples). Generalizes to rank order filters. In: In: 5-pixel neighborhood Out: Out:
More informationNon-linear filtering example
Today Non-linear filtering example Median filter Replace each pixel by the median over N pixels (5 pixels, for these examples). Generalizes to rank order filters. In: In: 5-pixel neighborhood Out: Out:
More informationMore details on presentations
More details on presentations Aim to speak for ~50 min (after 15 min review, leaving 10 min for discussions) Try to plan discussion topics It s fine to steal slides from the Web, but be sure to acknowledge
More informationImage Composition. COS 526 Princeton University
Image Composition COS 526 Princeton University Modeled after lecture by Alexei Efros. Slides by Efros, Durand, Freeman, Hays, Fergus, Lazebnik, Agarwala, Shamir, and Perez. Image Composition Jurassic Park
More informationToday: non-linear filters, and uses for the filters and representations from last time. Review pyramid representations Non-linear filtering Textures
1 Today: non-linear filters, and uses for the filters and representations from last time Review pyramid representations Non-linear filtering Textures 2 Reading Related to today s lecture: Chapter 9, Forsyth&Ponce..
More informationTexture Synthesis. Fourier Transform. F(ω) f(x) To understand frequency ω let s reparametrize the signal by ω: Fourier Transform
Texture Synthesis Image Manipulation and Computational Photography CS294-69 Fall 2011 Maneesh Agrawala [Some slides from James Hays, Derek Hoiem, Alexei Efros and Fredo Durand] Fourier Transform To understand
More informationLecture 6: Texture. Tuesday, Sept 18
Lecture 6: Texture Tuesday, Sept 18 Graduate students Problem set 1 extension ideas Chamfer matching Hierarchy of shape prototypes, search over translations Comparisons with Hausdorff distance, L1 on
More informationLecture #9: Image Resizing and Segmentation
Lecture #9: Image Resizing and Segmentation Mason Swofford, Rachel Gardner, Yue Zhang, Shawn Fenerin Department of Computer Science Stanford University Stanford, CA 94305 {mswoff, rachel0, yzhang16, sfenerin}@cs.stanford.edu
More informationWook Kim. 14 September Korea University Computer Graphics Lab.
Wook Kim 14 September 2011 Preview - Seam carving How to choose the pixels to be removed? Remove unnoticeable pixels that blend with their surroundings. Wook, Kim 14 September 2011 # 2 Preview Energy term
More informationTargil 10 : Why Mosaic? Why is this a challenge? Exposure differences Scene illumination Miss-registration Moving objects
Why Mosaic? Are you getting the whole picture? Compact Camera FOV = 5 x 35 Targil : Panoramas - Stitching and Blending Some slides from Alexei Efros 2 Slide from Brown & Lowe Why Mosaic? Are you getting
More informationTexture April 17 th, 2018
Texture April 17 th, 2018 Yong Jae Lee UC Davis Announcements PS1 out today Due 5/2 nd, 11:59 pm start early! 2 Review: last time Edge detection: Filter for gradient Threshold gradient magnitude, thin
More informationAn Improved Texture Synthesis Algorithm Using Morphological Processing with Image Analogy
An Improved Texture Synthesis Algorithm Using Morphological Processing with Image Analogy Jiang Ni Henry Schneiderman CMU-RI-TR-04-52 October 2004 Robotics Institute Carnegie Mellon University Pittsburgh,
More informationTexture April 14 th, 2015
Texture April 14 th, 2015 Yong Jae Lee UC Davis Announcements PS1 out today due 4/29 th, 11:59 pm start early! 2 Review: last time Edge detection: Filter for gradient Threshold gradient magnitude, thin
More informationAnnouncements. Texture. Review: last time. Texture 9/15/2009. Write your CS login ID on the pset hardcopy. Tuesday, Sept 15 Kristen Grauman UT-Austin
Announcements Texture Write your CS login ID on the pset hardcopy Tuesday, Sept 5 Kristen Grauman UT-Austin Review: last time Edge detection: Filter for gradient Threshold gradient magnitude, thin Texture
More informationImage Compositing and Blending
Computational Photography and Capture: Image Compositing and Blending Gabriel Brostow & Tim Weyrich TA: Frederic Besse Vignetting 3 Figure from http://www.vanwalree.com/optics/vignetting.html Radial Distortion
More informationRecap from Monday. Frequency domain analytical tool computational shortcut compression tool
Recap from Monday Frequency domain analytical tool computational shortcut compression tool Fourier Transform in 2d in Matlab, check out: imagesc(log(abs(fftshift(fft2(im))))); Image Blending (Szeliski
More informationA Comparison Study of Four Texture Synthesis Algorithms on Regular and Near-regular Textures
A Comparison Study of Four Texture Synthesis Algorithms on Regular and Near-regular Textures Wen-Chieh Lin James H. Hays Chenyu Wu Vivek Kwatra Yanxi Liu CMU-RI-TR-04-01 January 2004 School of Computer
More informationShift-Map Image Editing
Shift-Map Image Editing Yael Pritch Eitam Kav-Venaki Shmuel Peleg School of Computer Science and Engineering The Hebrew University of Jerusalem 91904 Jerusalem, Israel Abstract Geometric rearrangement
More informationTexture. Announcements. Markov Chains. Modeling Texture. Guest lecture next Tuesday. Evals at the end of class today
Announcements Guest lecture next Tuesday Dan Goldman: CV in special effects held in Allen Center (room TBA) Evals at the end of class today Texture Today s Reading Alexei A. Efros and Thomas K. Leung,
More informationPatchMatch: A Randomized Correspondence Algorithm for Structural Image Editing
PatchMatch: A Randomized Correspondence Algorithm for Structural Image Editing Barnes et al. In SIGGRAPH 2009 발표이성호 2009 년 12 월 3 일 Introduction Image retargeting Resized to a new aspect ratio [Rubinstein
More informationVolume Editor. Hans Weghorn Faculty of Mechatronics BA-University of Cooperative Education, Stuttgart Germany
Volume Editor Hans Weghorn Faculty of Mechatronics BA-University of Cooperative Education, Stuttgart Germany Proceedings of the 4 th Annual Meeting on Information Technology and Computer Science ITCS,
More informationAnnouncements. Texture. Review. Today: Texture 9/14/2015. Reminder: A1 due this Friday. Tues, Sept 15. Kristen Grauman UT Austin
Announcements Reminder: A due this Friday Texture Tues, Sept 5 Kristen Grauman UT Austin Review Edge detection: Filter for gradient Threshold gradient magnitude, thin Today: Texture Chamfer matching to
More informationImage Resizing Based on Gradient Vector Flow Analysis
Image Resizing Based on Gradient Vector Flow Analysis Sebastiano Battiato battiato@dmi.unict.it Giovanni Puglisi puglisi@dmi.unict.it Giovanni Maria Farinella gfarinellao@dmi.unict.it Daniele Ravì rav@dmi.unict.it
More informationTiled Texture Synthesis
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 16 (2014), pp. 1667-1672 International Research Publications House http://www. irphouse.com Tiled Texture
More informationUniversiteit Leiden Opleiding Informatica
Internal Report 2012-2013-09 June 2013 Universiteit Leiden Opleiding Informatica Evaluation of Image Quilting algorithms Pepijn van Heiningen BACHELOR THESIS Leiden Institute of Advanced Computer Science
More informationHelsinki University of Technology Telecommunications Software and Multimedia Laboratory T Seminar on computer graphics Spring 2004
Helsinki University of Technology 29.3.2004 Telecommunications Software and Multimedia Laboratory T-111.500 Seminar on computer graphics Spring 2004 Image Analogies Jari Huttunen 48120P Image Analogies
More informationMotion Texture. Harriet Pashley Advisor: Yanxi Liu Ph.D. Student: James Hays. 1. Introduction
Motion Texture Harriet Pashley Advisor: Yanxi Liu Ph.D. Student: James Hays 1. Introduction Motion capture data is often used in movies and video games because it is able to realistically depict human
More informationtechnique: seam carving Image and Video Processing Chapter 9
Chapter 9 Seam Carving for Images and Videos Distributed Algorithms for 2 Introduction Goals Enhance the visual content of images Adapted images should look natural Most relevant content should be clearly
More informationImage gradients and edges April 11 th, 2017
4//27 Image gradients and edges April th, 27 Yong Jae Lee UC Davis PS due this Friday Announcements Questions? 2 Last time Image formation Linear filters and convolution useful for Image smoothing, removing
More informationObject Removal Using Exemplar-Based Inpainting
CS766 Prof. Dyer Object Removal Using Exemplar-Based Inpainting Ye Hong University of Wisconsin-Madison Fall, 2004 Abstract Two commonly used approaches to fill the gaps after objects are removed from
More informationImage gradients and edges April 10 th, 2018
Image gradients and edges April th, 28 Yong Jae Lee UC Davis PS due this Friday Announcements Questions? 2 Last time Image formation Linear filters and convolution useful for Image smoothing, removing
More informationImage Processing Techniques and Smart Image Manipulation : Texture Synthesis
CS294-13: Special Topics Lecture #15 Advanced Computer Graphics University of California, Berkeley Monday, 26 October 2009 Image Processing Techniques and Smart Image Manipulation : Texture Synthesis Lecture
More informationVideo Texture. A.A. Efros
Video Texture A.A. Efros 15-463: Computational Photography Alexei Efros, CMU, Fall 2005 Weather Forecasting for Dummies Let s predict weather: Given today s weather only, we want to know tomorrow s Suppose
More informationLight Field Occlusion Removal
Light Field Occlusion Removal Shannon Kao Stanford University kaos@stanford.edu Figure 1: Occlusion removal pipeline. The input image (left) is part of a focal stack representing a light field. Each image
More informationarxiv: v1 [cs.cv] 22 Feb 2017
Synthesising Dynamic Textures using Convolutional Neural Networks arxiv:1702.07006v1 [cs.cv] 22 Feb 2017 Christina M. Funke, 1, 2, 3, Leon A. Gatys, 1, 2, 4, Alexander S. Ecker 1, 2, 5 1, 2, 3, 6 and Matthias
More informationImproved Seam Carving for Video Retargeting. By Erik Jorgensen, Margaret Murphy, and Aziza Saulebay
Improved Seam Carving for Video Retargeting By Erik Jorgensen, Margaret Murphy, and Aziza Saulebay CS 534 Fall 2015 Professor Dyer December 21, 2015 Table of Contents 1. Abstract.....3 2. Introduction.......3
More informationSpace-Time Scene Manifolds
Space-Time Scene Manifolds Y. Wexler D. Simakov Dept. of Computer Science and Applied Math The Weizmann Institute of Science Rehovot, 76100 Israel Abstract Non-Linear Scene Manifold Space-Time volume The
More informationCS6670: Computer Vision
CS6670: Computer Vision Noah Snavely Lecture 19: Graph Cuts source S sink T Readings Szeliski, Chapter 11.2 11.5 Stereo results with window search problems in areas of uniform texture Window-based matching
More informationAutomatic Generation of An Infinite Panorama
Automatic Generation of An Infinite Panorama Lisa H. Chan Alexei A. Efros Carnegie Mellon University Original Image Scene Matches Output Image Figure 1: Given an input image, scene matching from a large
More informationContent-Aware Image Resizing
Content-Aware Image Resizing EE368 Project Report Parnian Zargham Stanford University Electrical Engineering Department Stanford, CA pzargham@stanford.edu Sahar Nassirpour Stanford University Electrical
More informationTexture and Other Uses of Filters
CS 1699: Intro to Computer Vision Texture and Other Uses of Filters Prof. Adriana Kovashka University of Pittsburgh September 10, 2015 Slides from Kristen Grauman (12-52) and Derek Hoiem (54-83) Plan for
More informationImage Compression and Resizing Using Improved Seam Carving for Retinal Images
Image Compression and Resizing Using Improved Seam Carving for Retinal Images Prabhu Nayak 1, Rajendra Chincholi 2, Dr.Kalpana Vanjerkhede 3 1 PG Student, Department of Electronics and Instrumentation
More informationImage gradients and edges
Image gradients and edges April 7 th, 2015 Yong Jae Lee UC Davis Announcements PS0 due this Friday Questions? 2 Last time Image formation Linear filters and convolution useful for Image smoothing, removing
More informationFigure 1: A sampler of different types of textures. Figure 2: Left: An irregular texture overlaid with its lattice. Right: its near-regular counterpar
Deformable Texture: the Irregular-Regular-Irregular Cycle Yanxi Liu and Wen-Chieh Lin The Robotics Institute, Carnegie Mellon University, 5000 Forbes Ave. Pittsburgh, PA 15213 fyanxi,wcling@cs.cmu.edu
More informationImportance Filtering for Image Retargeting
Importance Filtering for Image Retargeting Yuanyuan Ding Epson R&D, Inc. yding@erd.epson.com Jing Xiao Epson R&D, Inc. xiaoj@erd.epson.com Jingyi Yu University of Delaware yu@eecis.udel.edu Abstract Content-aware
More informationDetail Preserving Shape Deformation in Image Editing
Detail Preserving Shape Deformation in Image Editing Hui Fang Google, Inc. John C. Hart University of Illinois, Urbana-Champaign (e) Figure 1: The deformation of a source image, described by tracing and
More informationInternational Journal of Mechatronics, Electrical and Computer Technology
An Efficient Importance Map for Content Aware Image Resizing Abstract Ahmad Absetan 1* and Mahdi Nooshyar 2 1 Faculty of Engineering, University of MohagheghArdabili, Ardabil, Iran 2 Faculty of Engineering,
More informationAn Improved Image Resizing Approach with Protection of Main Objects
An Improved Image Resizing Approach with Protection of Main Objects Chin-Chen Chang National United University, Miaoli 360, Taiwan. *Corresponding Author: Chun-Ju Chen National United University, Miaoli
More informationTexture. COS 429 Princeton University
Texture COS 429 Princeton University Texture What is a texture? Antonio Torralba Texture What is a texture? Antonio Torralba Texture What is a texture? Antonio Torralba Texture Texture is stochastic and
More informationAnnouncements. Mosaics. Image Mosaics. How to do it? Basic Procedure Take a sequence of images from the same position =
Announcements Project 2 out today panorama signup help session at end of class Today mosaic recap blending Mosaics Full screen panoramas (cubic): http://www.panoramas.dk/ Mars: http://www.panoramas.dk/fullscreen3/f2_mars97.html
More informationGPU Video Retargeting with Parallelized SeamCrop
GPU Video Retargeting with Parallelized SeamCrop Johannes Kiess, Daniel Gritzner, Benjamin Guthier Stephan Kopf, Wolfgang Effelsberg Department of Computer Science IV University of Mannheim, Mannheim,
More informationMosaics. Today s Readings
Mosaics VR Seattle: http://www.vrseattle.com/ Full screen panoramas (cubic): http://www.panoramas.dk/ Mars: http://www.panoramas.dk/fullscreen3/f2_mars97.html Today s Readings Szeliski and Shum paper (sections
More informationImage Restoration using Multiresolution Texture Synthesis and Image Inpainting
Image Restoration using Multiresolution Texture Synthesis and Image Inpainting Hitoshi Yamauchi, Jörg Haber, and Hans-Peter Seidel Max-Planck-Institut für Informatik, Saarbrücken, Germany E-mail: {hitoshi,haberj,hpseidel}@mpi-sb.mpg.de
More informationTexture. Texture. 2) Synthesis. Objectives: 1) Discrimination/Analysis
Texture Texture D. Forsythe and J. Ponce Computer Vision modern approach Chapter 9 (Slides D. Lowe, UBC) Key issue: How do we represent texture? Topics: Texture segmentation Texture-based matching Texture
More informationToday s lecture. Image Alignment and Stitching. Readings. Motion models
Today s lecture Image Alignment and Stitching Computer Vision CSE576, Spring 2005 Richard Szeliski Image alignment and stitching motion models cylindrical and spherical warping point-based alignment global
More informationDiscrete Optimization Methods in Computer Vision CSE 6389 Slides by: Boykov Modified and Presented by: Mostafa Parchami Basic overview of graph cuts
Discrete Optimization Methods in Computer Vision CSE 6389 Slides by: Boykov Modified and Presented by: Mostafa Parchami Basic overview of graph cuts [Yuri Boykov, Olga Veksler, Ramin Zabih, Fast Approximation
More informationABSTRACT Departures from a regular texture pattern can happen in many different dimensions. Previous related work has focused on faithful texture synt
Deformable Texture: the Irregular-Regular-Irregular Cycle Yanxi Liu and Wen-Chieh Lin CMU-RI-TR-03-26 The Robotics Institute Carnegie Mellon University Pittsburgh, PA 15213 cfl2003 Carnegie Mellon University
More informationDetail Preserving Shape Deformation in Image Editing
Detail Preserving Shape Deformation in Image Editing Hui Fang Google, Inc. (a) John C. Hart University of Illinois, Urbana-Champaign (c) (b) (d) (e) Figure 1: The deformation of a source image (a), described
More informationFast Texture Transfer
Nonphotorealistic Rendering Fast Texture Transfer Michael Ashikhmin Stony Brook University In many applications it s useful to have the ability to create a texture of arbitrary size given a small input
More informationVisual Media Retargeting
Visual Media Retargeting Ariel Shamir The Interdisciplinary Center, Herzliya Olga Sorkine New York University operators. We will present several ways to define importance maps that use spatial information
More informationBSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy
BSB663 Image Processing Pinar Duygulu Slides are adapted from Selim Aksoy Image matching Image matching is a fundamental aspect of many problems in computer vision. Object or scene recognition Solving
More informationGraph Cuts vs. Level Sets. part I Basics of Graph Cuts
ECCV 2006 tutorial on Graph Cuts vs. Level Sets part I Basics of Graph Cuts Yuri Boykov University of Western Ontario Daniel Cremers University of Bonn Vladimir Kolmogorov University College London Graph
More informationConstrained Texture Synthesis via Energy Minimization
To appear in IEEE TVCG 1 Constrained Texture Synthesis via Energy Minimization Ganesh Ramanarayanan and Kavita Bala, Member, IEEE Department of Computer Science, Cornell University Abstract This paper
More informationTexture Sensitive Image Inpainting after Object Morphing
Texture Sensitive Image Inpainting after Object Morphing Yin Chieh Liu and Yi-Leh Wu Department of Computer Science and Information Engineering National Taiwan University of Science and Technology, Taiwan
More informationVideo Textures. Arno Schödl Richard Szeliski David H. Salesin Irfan Essa. presented by Marco Meyer. Video Textures
Arno Schödl Richard Szeliski David H. Salesin Irfan Essa presented by Marco Meyer Motivation Images lack of dynamics Videos finite duration lack of timeless quality of image Motivation Image Video Texture
More informationHexagonal Image Quilting for Texture Synthesis
Hexagonal Image Quilting for Texture Synthesis David Kuri OVGU Magdeburg Universitätsplatz 2 39114 Magdeburg, Germany david.kuri@st.ovgu.de Elena Root Volkswagen AG Berliner Ring 2 38440 Wolfsburg, Germany
More informationProf. Feng Liu. Spring /17/2017. With slides by F. Durand, Y.Y. Chuang, R. Raskar, and C.
Prof. Feng Liu Spring 2017 http://www.cs.pdx.edu/~fliu/courses/cs510/ 05/17/2017 With slides by F. Durand, Y.Y. Chuang, R. Raskar, and C. Rother Last Time Image segmentation Normalized cut and segmentation
More information2.1 Optimized Importance Map
3rd International Conference on Multimedia Technology(ICMT 2013) Improved Image Resizing using Seam Carving and scaling Yan Zhang 1, Jonathan Z. Sun, Jingliang Peng Abstract. Seam Carving, the popular
More informationSingle Image Super-resolution. Slides from Libin Geoffrey Sun and James Hays
Single Image Super-resolution Slides from Libin Geoffrey Sun and James Hays Cs129 Computational Photography James Hays, Brown, fall 2012 Types of Super-resolution Multi-image (sub-pixel registration) Single-image
More informationHole Filling Through Photomontage
Hole Filling Through Photomontage Marta Wilczkowiak, Gabriel J. Brostow, Ben Tordoff, and Roberto Cipolla Department of Engineering, University of Cambridge, CB2 1PZ, U.K. http://mi.eng.cam.ac.uk/research/projects/holefilling/
More informationImage Retargeting for Small Display Devices
Image Retargeting for Small Display Devices Chanho Jung and Changick Kim Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST) Daejeon, Republic of Korea ABSTRACT
More informationCombining Abstract Images using Texture Transfer
BRIDGES Mathematical Connections in Art, Music, and Science Combining Abstract Images using Texture Transfer Gary R. Greenfield Department of Mathematics & Computer Science University of Richmond Richmond,
More informationHuman-centric Panoramic Imaging Stitching
Human-centric Panoramic Imaging Stitching Tomohiro Ozawa Kris M. Kitani Hideki Koike University of Electro-Communications Chofu, Tokyo, Japan Carnegie Mellon University Pittsburgh, PA USA University of
More informationTowards Real-Time Texture Synthesis with the Jump Map
Thirteenth Eurographics Workshop on Rendering (2002) P. Debevec and S. Gibson (Editors) Towards Real-Time Texture Synthesis with the Jump Map Steve Zelinka and Michael Garland Department of Computer Science,
More informationN-Views (1) Homographies and Projection
CS 4495 Computer Vision N-Views (1) Homographies and Projection Aaron Bobick School of Interactive Computing Administrivia PS 2: Get SDD and Normalized Correlation working for a given windows size say
More informationFast Image Stitching and Editing for Panorama Painting on Mobile Phones
Fast Image Stitching and Editing for Panorama Painting on Mobile Phones Yingen Xiong and Kari Pulli Nokia Research Center 955 Page Mill Road, Palo Alto, CA 94304, USA {yingen.xiong, kari.pulli}@nokia.com
More informationFast Non-Linear Video Synopsis
Fast Non-Linear Video Synopsis Alparslan YILDIZ, Adem OZGUR and Yusuf Sinan AKGUL {yildiz, akgul}@bilmuh.gyte.edu.tr, aozgur@gyte.edu.tr GIT Vision Lab - http://vision.gyte.edu.tr Gebze Institute of Technology
More informationCSCI 1290: Comp Photo
CSCI 1290: Comp Photo Fall 2018 @ Brown University James Tompkin Many slides thanks to James Hays old CS 129 course, along with all its acknowledgements. CS 4495 Computer Vision A. Bobick Motion and Optic
More informationOpportunities of Scale
Opportunities of Scale 11/07/17 Computational Photography Derek Hoiem, University of Illinois Most slides from Alyosha Efros Graphic from Antonio Torralba Today s class Opportunities of Scale: Data-driven
More informationPhotoshop Quickselect & Interactive Digital Photomontage
Photoshop Quickselect & Interactive Digital Photomontage By Joseph Tighe 1 Photoshop Quickselect Based on the graph cut technology discussed Boykov-Kolmogorov What might happen when we use a color model?
More informationParallax-tolerant Image Stitching
Parallax-tolerant Image Stitching Fan Zhang and Feng Liu Department of Computer Science Portland State University {zhangfan,fliu}@cs.pdx.edu Abstract Parallax handling is a challenging task for image stitching.
More informationSpatial Control in Neural Style Transfer
Spatial Control in Neural Style Transfer Tom Henighan Stanford Physics henighan@stanford.edu Abstract Recent studies have shown that convolutional neural networks (convnets) can be used to transfer style
More informationVideo Operations in the Gradient Domain. Abstract. these operations on video in the gradient domain. Our approach consists of 3D graph cut computation
Video Operations in the Gradient Domain 1 Abstract Fusion of image sequences is a fundamental operation in numerous video applications and usually consists of segmentation, matting and compositing. We
More informationPattern-based Texture Metamorphosis
Pattern-based Texture Metamorphosis Ziqiang Liu Ce Liu Heung-Yeung Shum Yizhou Yu Microsoft Research Asia Zhejiang University University of Illinois at Urbana-Champaign zqliu@msrchina.research.microsoft.com
More informationLocal Feature Detectors
Local Feature Detectors Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr Slides adapted from Cordelia Schmid and David Lowe, CVPR 2003 Tutorial, Matthew Brown,
More informationAnimating Characters in Pictures
Animating Characters in Pictures Shih-Chiang Dai jeffrey@cmlab.csie.ntu.edu.tw Chun-Tse Hsiao hsiaochm@cmlab.csie.ntu.edu.tw Bing-Yu Chen robin@ntu.edu.tw ABSTRACT Animating pictures is an interesting
More informationDecorating Surfaces with Bidirectional Texture Functions
Decorating Surfaces with Bidirectional Texture Functions Category: Research Abstract We present a system for decorating arbitrary surfaces with bidirectional texture functions (BTF). Our system generates
More informationComputational Photography: Advanced Topics. Paul Debevec
Computational Photography: Advanced Topics Paul Debevec Class: Computational Photography, Advanced Topics Module 1: 105 minutes Debevec,, Raskar and Tumblin 1:45: A.1 Introduction and Overview (Raskar,
More information