Poisson composi-ng 3
|
|
- Hugo Ronald Carpenter
- 5 years ago
- Views:
Transcription
1 1
2 naïve composi-ng 2
3 Poisson composi-ng 3
4 our result 4
5 Objec+ves Seamless composi+ng Robust to inaccurate selec+on Output Quality - Limit color bleeding Time- Performance - Efficient method 5
6 Related Work: Poisson Composi+ng Pas+ng gradients instead of pixels Pérez 03, Georgiev 06, Pros: Blends seamlessly Linear computa+on Cons: Bleeding visible Foreground to background bleeding Poisson Composi+ng Result 6
7 Related Work: L 1 Norm Introduced in shape from shading Reddy 09 Pros: Reduced bleeding Cons: Nonlinear - Computa*onally intensive L 1 Norm Result 7
8 Related Work: Moving Boundaries Move the boundaries to avoid bleeding Jia 06 Pros: Avoids bleeding Cons: We don t want boundaries to change Changed composi+on Changing boundaries 8
9 Contribu+ons Conceal bleeding in textured areas Be_er gradient field at boundary Efficient linear scheme 9
10 Overview Problem Descrip-on Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 10
11 Foreground Algorithm Overview Selec-on Background
12 Foreground Algorithm Overview Selec-on grad Background grad
13 Foreground Algorithm Overview Selec-on grad paste Target gradient field Background grad
14 Foreground Algorithm Overview Selec-on grad paste Target gradient field Background integrate grad Result 14
15 Standard Approach: Poisson composi+ng We seek image I with gradients close to target v. target gradient field = 15
16 Standard Approach: Poisson composi+ng We seek image I with gradients close to target v. target gradient field = Least- squares: output gradient field 16
17 Our Approach We seek image I with gradients close to target v. target gradient field = value that minimizes curl Weighted least- square: weight output gradient field 17
18 Overview Problem Statement Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 18
19 Our Strategy Use the weights to locate integra+on residuals where they are less visible Exploit perceptual effect: visual masking human percep+on affected by texture. 19
20 Visual Masking Demo Can you spot all the dots? 20
21 Visual Masking Demo Texture hides low- frequency content 21
22 Visual Masking Demo Can you spot all the dots? 22
23 Design of the Weights smooth region: needs high weight to prevent bleeding textured regions: low weight is ok because bleeding less visible weights (white is high) 23
24 Es+ma+ng the Amount of Texture RGB gradient field 24
25 Es+ma+ng the Amount of Texture Small Gaussian convolu-on RGB gradient field Noise controlling func-on Large Gaussian convolu-on 25
26 Es+ma+ng the Amount of Texture small Gaussian large Gaussian gradient field g 26
27 Es+ma+ng the Amount of Texture Texture Map Output (white indicates more texture) 27
28 Weight Formula = 1 Weight output v depends only on foreground and background does not depend on the unknown I weights are constant in the op+miza+on our energy is a classical least- squares op-miza-on 28
29 Hiding Residuals with Visual Masking Bleeding only in textured areas Poisson composi+ng With texture weights 29
30 Hiding Residuals with Visual Masking Residuals Poisson composi+ng With texture weights 30
31 Hiding Residuals with Visual Masking Reduced bleeding but not fully Poisson composi+ng With texture weights 31
32 Overview Problem Statement Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 32
33 Boundary Problems Target field v integrable iff curl(v)=0 Only boundary has non- zero curl Consequence of target field construc+on (see paper) curl using standard strategy Our strategy: reducing the curl 33
34 Naïve Approach Minimize Unfortunately, the result is not seamless: output of naïve approach close- up 34
35 Our Approach: Least Squares Trade- off Unknowns: target field v along boundary Weights depend on texture (detail in paper) zero curl weight seamless composi+ng 35
36 Overview Problem Statement Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 36
37 Results and Comparisons Copy- and- paste 37
38 Results and Comparisons Poisson Reconstruc+on : Pérez 03, Georgiev 06, 38
39 Results and Comparisons Maximum Gradient : Pérez 03 39
40 Results and Comparisons Diffusion : Agrawal 06 40
41 Results and Comparisons Lalonde 07 41
42 Results and Comparisons L 1 Norm : Reddy 09 42
43 Results and Comparisons Our Result 43
44 Results and Comparisons Our Result L_1 Norm Lalonde Diffusion Max Poisson Running Time (Seconds) 44
45 Results and Comparisons Poisson 45
46 Results and Comparisons Our Result 46
47 Results and Comparisons Poisson 47
48 Results and Comparisons Our Result 48
49 Discussion Several parameters - all examples use the same parameters Discolora+on may happen - happens in all gradient based operators Our model of visual masking is simple - good for performance - more complex model could be used 49
50 Conclusion Robust composi+ng using visual masking Be_er gradient field at boundary Efficient linear scheme Poisson Reconstruc+on Our Result 50
51 Special Thanks Todor Georgiev Kavita Bala George Dre_akis Aseem Agarwala Bill Freeman Tim Cho Biliana Kaneva Medhat H. Ibrahim Ravi Ramamoorthi This material is based upon work supported by the Na+onal Science Founda+on under Grant No and No
52 Conclusion Robust composi+ng using visual masking Be_er gradient field at boundary Efficient linear scheme Poisson Reconstruc+on Our Result 52
53 Results and Comparisons 53
54 Results and Comparisons Poisson 54
55 Results and Comparisons Our Result 55
Gradient-domain image processing
Gradient-domain image processing http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2018, Lecture 10 Course announcements Homework 3 is out. - (Much) smaller
More informationHigh-Order Similarity Relations in Radiative Transfer: Supplementary Document
High-Order Similarity Relations in Radiative Transfer: Supplementary Document Shuang hao Ravi Ramamoorthi Kavita Bala Cornell University University of California, Berkeley Cornell University Overview This
More informationPoisson Image Editing
Poisson Image Editing Sébastien Boisgérault, Mines ParisTech, under CC BY-NC-SA 4.0 January 21, 2016 Contents Introduction 1 Modelling the Problem 2 Harmonic Functions 5 The irichlet Problem 8 Harmonic/Fourier
More informationPoisson Image Editing
Poisson Image Editing Sébastien Boisgérault, Mines ParisTech, under CC BY-NC-SA 4.0 November 28, 2017 Contents Introduction 1 Modelling the Problem 2 Harmonic Functions 5 The irichlet Problem 8 Harmonic/Fourier
More information6.869 Advances in Computer Vision. Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018
6.869 Advances in Computer Vision Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018 1 Sampling Sampling Pixels Continuous world 3 Sampling 4 Sampling 5 Continuous image f (x, y) Sampling
More informationRandom walks and anisotropic interpolation on graphs. Filip Malmberg
Random walks and anisotropic interpolation on graphs. Filip Malmberg Interpolation of missing data Assume that we have a graph where we have defined some (real) values for a subset of the nodes, and that
More informationITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms
ITK Filters Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms ITCS 6010:Biomedical Imaging and Visualization 1 ITK Filters:
More informationSubsampling and image pyramids
Subsampling and image pyramids http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2018, Lecture 3 Course announcements Homework 0 and homework 1 will be posted tonight. - Homework 0 is not required
More informationWavelet Packet Based Digital Image Watermarking
Wavelet Packet Based Digital Image ing A.Adhipathi Reddy, B.N.Chatterji Department of Electronics and Electrical Communication Engg. Indian Institute of Technology, Kharagpur 72 32 {aar, bnc}@ece.iitkgp.ernet.in
More informationImage Gradients and Gradient Filtering Computer Vision
Image Gradients and Gradient Filtering 16-385 Computer Vision What is an image edge? Recall that an image is a 2D function f(x) edge edge How would you detect an edge? What kinds of filter would you use?
More informationImage Stitching II. Linda Shapiro CSE 455
Image Stitching II Linda Shapiro CSE 455 RANSAC for Homography Initial Matched Points RANSAC for Homography Final Matched Points RANSAC for Homography Image Blending What s wrong? Feathering + 1 0 1 0
More informationLecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008
Lecture 6: Edge Detection CAP 5415: Computer Vision Fall 2008 Announcements PS 2 is available Please read it by Thursday During Thursday lecture, I will be going over it in some detail Monday - Computer
More informationImage Stitching II. Linda Shapiro EE/CSE 576
Image Stitching II Linda Shapiro EE/CSE 576 RANSAC for Homography Initial Matched Points RANSAC for Homography Final Matched Points RANSAC for Homography Image Blending What s wrong? Feathering + 1 0 ramp
More informationEdge Detection. Introduction to Computer Vision. Useful Mathematics Funcs. The bad news
Edge Detection Introduction to Computer Vision CS / ECE 8B Thursday, April, 004 Edge detection (HO #5) Edge detection is a local area operator that seeks to find significant, meaningful changes in image
More informationInverse Problems in Image Processing
H D Inverse Problems in Image Processing Ramesh Neelamani (Neelsh) Committee: Profs. R. Baraniuk, R. Nowak, M. Orchard, S. Cox June 2003 Inverse Problems Data estimation from inadequate/noisy observations
More informationLift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints
Lift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints Nicolas Boumal Université catholique de Louvain (Belgium) IDeAS seminar, May 13 th, 2014, Princeton The Riemannian
More informationDigital Matting. Outline. Introduction to Digital Matting. Introduction to Digital Matting. Compositing equation: C = α * F + (1- α) * B
Digital Matting Outline. Introduction to Digital Matting. Bayesian Matting 3. Poisson Matting 4. A Closed Form Solution to Matting Presenting: Alon Gamliel,, Tel-Aviv University, May 006 Introduction to
More informationMachine Learning and Data Mining. Linear regression. Prof. Alexander Ihler
+ Machine Learning and Data Mining Linear regression Prof. Alexander Ihler Supervised learning Notation Features x Targets y Predictions ŷ Parameters θ Learning algorithm Program ( Learner ) Change µ Improve
More informationNOISE ENHANCED ANISOTROPIC DIFFUSION FOR SCALAR IMAGE RESTORATION. 6, avenue du Ponceau Cergy-Pontoise, France.
NOISE ENHANCED ANISOTROPIC DIFFUSION FOR SCALAR IMAGE RESTORATION Aymeric HISTACE 1, David ROUSSEAU 2 1 Equipe en Traitement d'image et du Signal UMR CNRS 8051 6, avenue du Ponceau 95014 Cergy-Pontoise,
More informationMultimedia Databases. Previous Lecture. 4.1 Multiresolution Analysis. 4 Shape-based Features. 4.1 Multiresolution Analysis
Previous Lecture Multimedia Databases Texture-Based Image Retrieval Low Level Features Tamura Measure, Random Field Model High-Level Features Fourier-Transform, Wavelets Wolf-Tilo Balke Silviu Homoceanu
More informationMultimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig
Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 4 Previous Lecture Texture-Based Image Retrieval Low
More informationPoisson Matting. Abstract. 1 Introduction. Jian Sun 1 Jiaya Jia 2 Chi-Keung Tang 2 Heung-Yeung Shum 1
Poisson Matting Jian Sun 1 Jiaya Jia 2 Chi-Keung Tang 2 Heung-Yeung Shum 1 1 Microsoft Research Asia 2 Hong Kong University of Science and Technology Figure 1: Pulling of matte from a complex scene. From
More informationGeraint Harker. Kapteyn Astronomical Institute, Groningen. Wed. 17th Sept Hamburg LOFAR Workshop
Geraint Harker Kapteyn Astronomical Institute, Groningen Wed. 17th Sept. 2008 Hamburg LOFAR Workshop 1 Extract a cosmological signal from a datacube, the three axes of which are x and y positions, and
More informationMultimedia Databases. 4 Shape-based Features. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis
4 Shape-based Features Multimedia Databases Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 4 Multiresolution Analysis
More informationFiltering and Edge Detection
Filtering and Edge Detection Local Neighborhoods Hard to tell anything from a single pixel Example: you see a reddish pixel. Is this the object s color? Illumination? Noise? The next step in order of complexity
More informationEdge Detection. Computer Vision P. Schrater Spring 2003
Edge Detection Computer Vision P. Schrater Spring 2003 Simplest Model: (Canny) Edge(x) = a U(x) + n(x) U(x)? x=0 Convolve image with U and find points with high magnitude. Choose value by comparing with
More informationEdge Detection in Computer Vision Systems
1 CS332 Visual Processing in Computer and Biological Vision Systems Edge Detection in Computer Vision Systems This handout summarizes much of the material on the detection and description of intensity
More informationImage Filtering, Edges and Image Representation
Image Filtering, Edges and Image Representation Capturing what s important Req reading: Chapter 7, 9 F&P Adelson, Simoncelli and Freeman (handout online) Opt reading: Horn 7 & 8 FP 8 February 19, 8 A nice
More informationBayes Theorem. Jan Kracík. Department of Applied Mathematics FEECS, VŠB - TU Ostrava
Jan Kracík Department of Applied Mathematics FEECS, VŠB - TU Ostrava Introduction Bayes theorem fundamental theorem in probability theory named after reverend Thomas Bayes (1701 1761) discovered in Bayes
More informationEdge Detection PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2005
Edge Detection PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2005 Gradients and edges Points of sharp change in an image are interesting: change in reflectance change in object change
More informationReview for Exam 1. Erik G. Learned-Miller Department of Computer Science University of Massachusetts, Amherst Amherst, MA
Review for Exam Erik G. Learned-Miller Department of Computer Science University of Massachusetts, Amherst Amherst, MA 0003 March 26, 204 Abstract Here are some things you need to know for the in-class
More informationThinking in Frequency
09/05/17 Thinking in Frequency Computational Photography University of Illinois Derek Hoiem Administrative Matlab/linear algebra tutorial tomorrow, planned for 6:30pm Probably 1214 DCL (will send confirmation
More informationImage Filtering. Slides, adapted from. Steve Seitz and Rick Szeliski, U.Washington
Image Filtering Slides, adapted from Steve Seitz and Rick Szeliski, U.Washington The power of blur All is Vanity by Charles Allen Gillbert (1873-1929) Harmon LD & JuleszB (1973) The recognition of faces.
More informationDiffusion/Inference geometries of data features, situational awareness and visualization. Ronald R Coifman Mathematics Yale University
Diffusion/Inference geometries of data features, situational awareness and visualization Ronald R Coifman Mathematics Yale University Digital data is generally converted to point clouds in high dimensional
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2010 Lecture 22: Nearest Neighbors, Kernels 4/18/2011 Pieter Abbeel UC Berkeley Slides adapted from Dan Klein Announcements On-going: contest (optional and FUN!)
More informationTotal Variation Image Edge Detection
Total Variation Image Edge Detection PETER NDAJAH Graduate School of Science and Technology, Niigata University, 8050, Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-28, JAPAN ndajah@telecom0.eng.niigata-u.ac.jp
More informationCosmological N-Body Simulations and Galaxy Surveys
Cosmological N-Body Simulations and Galaxy Surveys Adrian Pope, High Energy Physics, Argonne Na3onal Laboratory, apope@anl.gov CScADS: Scien3fic Data and Analy3cs for Extreme- scale Compu3ng, 30 July 2012
More informationIntegrating Spheres in Molecular Spectrophotometry
Integrating Spheres in Molecular Spectrophotometry Theory and Practice 2012 Perkin Elmer 2012 Perkin Elmer General Sphere Theory 3 Integrating Spheres Types of Sphere Measurements Total Reflectance (Specular
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationWhat is Image Deblurring?
What is Image Deblurring? When we use a camera, we want the recorded image to be a faithful representation of the scene that we see but every image is more or less blurry, depending on the circumstances.
More informationPriors in Dependency network learning
Priors in Dependency network learning Sushmita Roy sroy@biostat.wisc.edu Computa:onal Network Biology Biosta2s2cs & Medical Informa2cs 826 Computer Sciences 838 hbps://compnetbiocourse.discovery.wisc.edu
More informationLine Search Algorithms
Lab 1 Line Search Algorithms Investigate various Line-Search algorithms for numerical opti- Lab Objective: mization. Overview of Line Search Algorithms Imagine you are out hiking on a mountain, and you
More informationProbabilis)c image reconstruc)on, foreground removal, and power spectrum inference from radio interferometers
Probabilis)c image reconstruc)on, foreground removal, and power spectrum inference from radio interferometers Ben Wandelt IAP, ILP, UPMC, CNRS Sorbonne University Theore>cal interest in 21cm cosmology
More informationECE Digital Image Processing and Introduction to Computer Vision. Outline
2/9/7 ECE592-064 Digital Image Processing and Introduction to Computer Vision Depart. of ECE, NC State University Instructor: Tianfu (Matt) Wu Spring 207. Recap Outline 2. Sharpening Filtering Illustration
More informationPerceptually Uniform Color Spaces
C. A. Bouman: Digital Image Processing - January 8, 2018 1 Perceptually Uniform Color Spaces Problem: Small changes in XYZ may result in small or large perceptual changes. Solution: Formulate a perceptually
More informationToday s lecture. Local neighbourhood processing. The convolution. Removing uncorrelated noise from an image The Fourier transform
Cris Luengo TD396 fall 4 cris@cbuuse Today s lecture Local neighbourhood processing smoothing an image sharpening an image The convolution What is it? What is it useful for? How can I compute it? Removing
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationReading. 3. Image processing. Pixel movement. Image processing Y R I G Q
Reading Jain, Kasturi, Schunck, Machine Vision. McGraw-Hill, 1995. Sections 4.-4.4, 4.5(intro), 4.5.5, 4.5.6, 5.1-5.4. 3. Image processing 1 Image processing An image processing operation typically defines
More informationISTITUTO NAZIONALE DI FISICA NUCLEARE
ISTITUTO NAZIONALE DI FISICA NUCLEARE Laboratori Nazionali di Frascati SPARC/EBD-07/003 23 Luglio 2007 Accurate emittance calculation from phase space analysis A. Cianchi 1, C. Ronsivalle 2, L. Giannessi
More informationWhy does a lower resolution image still make sense to us? What do we lose? Image:
2D FREQUENCY DOMAIN The slides are from several sources through James Hays (Brown); Srinivasa Narasimhan (CMU); Silvio Savarese (U. of Michigan); Bill Freeman and Antonio Torralba (MIT), including their
More informationResearch Article Denoising Algorithm Based on Generalized Fractional Integral Operator with Two Parameters
Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 212, Article ID 529849, 14 pages doi:11155/212/529849 Research Article Denoising Algorithm Based on Generalized Fractional
More informationVision Modules and Cue Combination
Cue Coupling This section describes models for coupling different visual cues. The ideas in this section are logical extensions of the ideas in the earlier sections. But we are now addressing more complex
More informationLaplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters
Sobel Filters Note that smoothing the image before applying a Sobel filter typically gives better results. Even thresholding the Sobel filtered image cannot usually create precise, i.e., -pixel wide, edges.
More informationLeast-Squares Finite Element Methods
Pavel В. Bochev Max D. Gunzburger Least-Squares Finite Element Methods Spri ringer Contents Part I Survey of Variational Principles and Associated Finite Element Methods 1 Classical Variational Methods
More informationAnnouncements. Filtering. Image Filtering. Linear Filters. Example: Smoothing by Averaging. Homework 2 is due Apr 26, 11:59 PM Reading:
Announcements Filtering Homework 2 is due Apr 26, :59 PM eading: Chapter 4: Linear Filters CSE 52 Lecture 6 mage Filtering nput Output Filter (From Bill Freeman) Example: Smoothing by Averaging Linear
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2010 Lecture 24: Perceptrons and More! 4/22/2010 Pieter Abbeel UC Berkeley Slides adapted from Dan Klein Announcements W7 due tonight [this is your last written for
More informationEnhanced Surface Metrology
Enhanced Surface Metrology Russell M. Kurtz RAN Science & Technology, LLC Ryder Nesbitt Hexagon Metrology, Inc. There is a constant search for more accurate measurement Traditionally 3 Parameters COST
More informationSeminar on Vector Field Analysis on Surfaces
Seminar on Vector Field Analysis on Surfaces 236629 1 Last time Intro Cool stuff VFs on 2D Euclidean Domains Arrows on the plane Div, curl and all that Helmholtz decomposition 2 today Arrows on surfaces
More informationAnnouncements. CS 188: Artificial Intelligence Spring Classification. Today. Classification overview. Case-Based Reasoning
CS 188: Artificial Intelligence Spring 21 Lecture 22: Nearest Neighbors, Kernels 4/18/211 Pieter Abbeel UC Berkeley Slides adapted from Dan Klein Announcements On-going: contest (optional and FUN!) Remaining
More informationNonlinear Diffusion. 1 Introduction: Motivation for non-standard diffusion
Nonlinear Diffusion These notes summarize the way I present this material, for my benefit. But everything in here is said in more detail, and better, in Weickert s paper. 1 Introduction: Motivation for
More informationLifting Detail from Darkness
Lifting Detail from Darkness J.P.Lewis zilla@computer.org Disney The Secret Lab Lewis / Detail from Darkness p.1/38 Brightness-Detail Decomposition detail image image intensity Separate detail by Wiener
More informationRelations on Hypergraphs
Relations on Hypergraphs John Stell School of Computing, University of Leeds RAMiCS 13 Cambridge, 17th September 2012 Relations on a Set Boolean algebra Converse R = R Complement R = R Composition & residuation
More informationKalman filtering and friends: Inference in time series models. Herke van Hoof slides mostly by Michael Rubinstein
Kalman filtering and friends: Inference in time series models Herke van Hoof slides mostly by Michael Rubinstein Problem overview Goal Estimate most probable state at time k using measurement up to time
More informationCS 542G: Robustifying Newton, Constraints, Nonlinear Least Squares
CS 542G: Robustifying Newton, Constraints, Nonlinear Least Squares Robert Bridson October 29, 2008 1 Hessian Problems in Newton Last time we fixed one of plain Newton s problems by introducing line search
More informationSpread Spectrum Watermarking. Information Technologies for IPR Protection
Spread Spectrum Watermarking Information Technologies for IPR Protection Spread Spectrum Communication A Narrow-band signal is transmitted over a much larger bandwidth such that the signal energy presented
More informationImproved Fast Gauss Transform. Fast Gauss Transform (FGT)
10/11/011 Improved Fast Gauss Transform Based on work by Changjiang Yang (00), Vikas Raykar (005), and Vlad Morariu (007) Fast Gauss Transform (FGT) Originally proposed by Greengard and Strain (1991) to
More informationCSC321 Lecture 15: Exploding and Vanishing Gradients
CSC321 Lecture 15: Exploding and Vanishing Gradients Roger Grosse Roger Grosse CSC321 Lecture 15: Exploding and Vanishing Gradients 1 / 23 Overview Yesterday, we saw how to compute the gradient descent
More information15.063: Communicating with Data
15.063: Communicating with Data Summer 2003 Recitation 6 Linear Regression Today s Content Linear Regression Multiple Regression Some Problems 15.063 - Summer '03 2 Linear Regression Why? What is it? Pros?
More informationShape of Gaussians as Feature Descriptors
Shape of Gaussians as Feature Descriptors Liyu Gong, Tianjiang Wang and Fang Liu Intelligent and Distributed Computing Lab, School of Computer Science and Technology Huazhong University of Science and
More informationLecture 3. Linear Regression II Bastian Leibe RWTH Aachen
Advanced Machine Learning Lecture 3 Linear Regression II 02.11.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de/ leibe@vision.rwth-aachen.de This Lecture: Advanced Machine Learning Regression
More informationVisual Imaging and the Electronic Age Color Science Metamers & Chromaticity Diagrams. Lecture #6 September 7, 2017 Prof. Donald P.
Visual Imaging and the Electronic Age Color Science Metamers & Chromaticity Diagrams Lecture #6 September 7, 2017 Prof. Donald P. Greenberg Matching the Power Spectrum of the Test Lamp with a Full Set
More informationGradient Domain High Dynamic Range Compression
Gradient Domain High Dynamic Range Compression Raanan Fattal Dani Lischinski Michael Werman The Hebrew University of Jerusalem School of Computer Science & Engineering 1 In A Nutshell 2 Dynamic Range Quantity
More informationA Generative Perspective on MRFs in Low-Level Vision Supplemental Material
A Generative Perspective on MRFs in Low-Level Vision Supplemental Material Uwe Schmidt Qi Gao Stefan Roth Department of Computer Science, TU Darmstadt 1. Derivations 1.1. Sampling the Prior We first rewrite
More informationComputer Vision Lecture 3
Computer Vision Lecture 3 Linear Filters 03.11.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Demo Haribo Classification Code available on the class website...
More informationCSC321 Lecture 20: Reversible and Autoregressive Models
CSC321 Lecture 20: Reversible and Autoregressive Models Roger Grosse Roger Grosse CSC321 Lecture 20: Reversible and Autoregressive Models 1 / 23 Overview Four modern approaches to generative modeling:
More informationDigital Image Processing ERRATA. Wilhelm Burger Mark J. Burge. An algorithmic introduction using Java. Second Edition. Springer
Wilhelm Burger Mark J. Burge Digital Image Processing An algorithmic introduction using Java Second Edition ERRATA Springer Berlin Heidelberg NewYork Hong Kong London Milano Paris Tokyo 5 Filters K K No
More informationSolving Corrupted Quadratic Equations, Provably
Solving Corrupted Quadratic Equations, Provably Yuejie Chi London Workshop on Sparse Signal Processing September 206 Acknowledgement Joint work with Yuanxin Li (OSU), Huishuai Zhuang (Syracuse) and Yingbin
More informationGradientShop: A Gradient-Domain Optimization Framework for Image and Video Filtering
GradientShop: A Gradient-Domain Optimization Framework for Image and Video Filtering Pravin Bhat C. Lawrence Zitnick Michael Cohen Brian Curless Presentation : Michael Tao Discussion : Sean Arietta Input
More informationLecture 11: Vector Calculus I
1. Key points Scalar and vector fields Gradient and directional derivative Laplacian Maple Derivatives VectorCalculus package SetCoordinates Vector Norm DotProduct Gradient, Del, Nabla Laplacian evalvf
More informationA Comprehensive Framework for Modeling and Correcting Color Variations in Multi Projector Displays
A Comprehensive Framework for Modeling and Correcting Color Variations in Multi Projector Displays Aditi Majumder Slide 1 Historical Perspective A dream computer in 1980 (Bill Joy and others) Megabytes
More informationSurface Brightness of Spiral Galaxies
Surface Brightness of Spiral Galaxies M104: SA N4535: SAB LMC: dwarf irregular,barred Normal 1/4-law+exp fits An example of surface brightness profile. The top curve is the sum of exp disk+1/4-bulge. The
More information6 The SVD Applied to Signal and Image Deblurring
6 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an
More informationLecture 8: Interest Point Detection. Saad J Bedros
#1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Last Lecture : Edge Detection Preprocessing of image is desired to eliminate or at least minimize noise effects There is always tradeoff
More informationTaking derivative by convolution
Taking derivative by convolution Partial derivatives with convolution For 2D function f(x,y), the partial derivative is: For discrete data, we can approximate using finite differences: To implement above
More informationElaborazione delle Immagini Informazione multimediale - Immagini. Raffaella Lanzarotti
Elaborazione delle Immagini Informazione multimediale - Immagini Raffaella Lanzarotti OPTICAL FLOW Thanks to prof. Mubarak Shah,UCF 2 Video Video: sequence of frames (images) catch in the time Data: function
More informationGradient Descent. Ryan Tibshirani Convex Optimization /36-725
Gradient Descent Ryan Tibshirani Convex Optimization 10-725/36-725 Last time: canonical convex programs Linear program (LP): takes the form min x subject to c T x Gx h Ax = b Quadratic program (QP): like
More informationMultiview Geometry and Bundle Adjustment. CSE P576 David M. Rosen
Multiview Geometry and Bundle Adjustment CSE P576 David M. Rosen 1 Recap Previously: Image formation Feature extraction + matching Two-view (epipolar geometry) Today: Add some geometry, statistics, optimization
More information8 The SVD Applied to Signal and Image Deblurring
8 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an
More information8 The SVD Applied to Signal and Image Deblurring
8 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an
More informationIntroduction to Computer Vision
Introduction to Computer Vision Michael J. Black Sept 2009 Lecture 8: Pyramids and image derivatives Goals Images as functions Derivatives of images Edges and gradients Laplacian pyramids Code for lecture
More informationRegularizing inverse problems. Damping and smoothing and choosing...
Regularizing inverse problems Damping and smoothing and choosing... 141 Regularization The idea behind SVD is to limit the degree of freedom in the model and fit the data to an acceptable level. Retain
More informationLecture 5 Multivariate Linear Regression
Lecture 5 Multivariate Linear Regression Dan Sheldon September 23, 2014 Topics Multivariate linear regression Model Cost function Normal equations Gradient descent Features Book Data 10 8 Weight (lbs.)
More informationFast Local Laplacian Filters: Theory and Applications
Fast Local Laplacian Filters: Theory and Applications Mathieu Aubry (INRIA, ENPC), Sylvain Paris (Adobe), Sam Hasinoff (Google), Jan Kautz (UCL), and Frédo Durand (MIT) Input Unsharp Mask, not edge-aware
More informationA Parameter-Choice Method That Exploits Residual Information
A Parameter-Choice Method That Exploits Residual Information Per Christian Hansen Section for Scientific Computing DTU Informatics Joint work with Misha E. Kilmer Tufts University Inverse Problems: Image
More informationSKA machine learning perspec1ves for imaging, processing and analysis
1 SKA machine learning perspec1ves for imaging, processing and analysis Slava Voloshynovskiy Stochas1c Informa1on Processing Group University of Geneva Switzerland with contribu,on of: D. Kostadinov, S.
More informationCS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015
CS 3710: Visual Recognition Describing Images with Features Adriana Kovashka Department of Computer Science January 8, 2015 Plan for Today Presentation assignments + schedule changes Image filtering Feature
More informationEE5585 Data Compression April 18, Lecture 23
EE5585 Data Compression April 18, 013 Lecture 3 Instructor: Arya Mazumdar Scribe: Trevor Webster Differential Encoding Suppose we have a signal that is slowly varying For instance, if we were looking at
More informationOld painting digital color restoration
Old painting digital color restoration Michail Pappas Ioannis Pitas Dept. of Informatics, Aristotle University of Thessaloniki GR-54643 Thessaloniki, Greece Abstract Many old paintings suffer from the
More informationDirectional Field. Xiao-Ming Fu
Directional Field Xiao-Ming Fu Outlines Introduction Discretization Representation Objectives and Constraints Outlines Introduction Discretization Representation Objectives and Constraints Definition Spatially-varying
More informationMeasurement of the meridional flow from eigenfunc5on perturba5ons
Measurement of the meridional flow from eigenfunc5on perturba5ons Ariane Schad, Markus Roth Kiepenheuer- Ins5tut für Sonnenphysik Solar Subsurface Flows from Helioseismology: Problems and Prospects Helioseismology
More information