Poisson composi-ng 3

Similar documents
Gradient-domain image processing

High-Order Similarity Relations in Radiative Transfer: Supplementary Document

Poisson Image Editing

Poisson Image Editing

6.869 Advances in Computer Vision. Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018

Random walks and anisotropic interpolation on graphs. Filip Malmberg

ITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms

Subsampling and image pyramids

Wavelet Packet Based Digital Image Watermarking

Image Gradients and Gradient Filtering Computer Vision

Image Stitching II. Linda Shapiro CSE 455

Lecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008

Image Stitching II. Linda Shapiro EE/CSE 576

Edge Detection. Introduction to Computer Vision. Useful Mathematics Funcs. The bad news

Inverse Problems in Image Processing

Lift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints

Digital Matting. Outline. Introduction to Digital Matting. Introduction to Digital Matting. Compositing equation: C = α * F + (1- α) * B

Machine Learning and Data Mining. Linear regression. Prof. Alexander Ihler

NOISE ENHANCED ANISOTROPIC DIFFUSION FOR SCALAR IMAGE RESTORATION. 6, avenue du Ponceau Cergy-Pontoise, France.

Multimedia Databases. Previous Lecture. 4.1 Multiresolution Analysis. 4 Shape-based Features. 4.1 Multiresolution Analysis

Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig

Poisson Matting. Abstract. 1 Introduction. Jian Sun 1 Jiaya Jia 2 Chi-Keung Tang 2 Heung-Yeung Shum 1

Geraint Harker. Kapteyn Astronomical Institute, Groningen. Wed. 17th Sept Hamburg LOFAR Workshop

Multimedia Databases. 4 Shape-based Features. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis

Filtering and Edge Detection

Edge Detection. Computer Vision P. Schrater Spring 2003

Edge Detection in Computer Vision Systems

Image Filtering, Edges and Image Representation

Bayes Theorem. Jan Kracík. Department of Applied Mathematics FEECS, VŠB - TU Ostrava

Edge Detection PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2005

Review for Exam 1. Erik G. Learned-Miller Department of Computer Science University of Massachusetts, Amherst Amherst, MA

Thinking in Frequency

Image Filtering. Slides, adapted from. Steve Seitz and Rick Szeliski, U.Washington

Diffusion/Inference geometries of data features, situational awareness and visualization. Ronald R Coifman Mathematics Yale University

CS 188: Artificial Intelligence Spring Announcements

Total Variation Image Edge Detection

Cosmological N-Body Simulations and Galaxy Surveys

Integrating Spheres in Molecular Spectrophotometry

Lecture 3: Linear Filters

What is Image Deblurring?

Priors in Dependency network learning

Line Search Algorithms

Probabilis)c image reconstruc)on, foreground removal, and power spectrum inference from radio interferometers

ECE Digital Image Processing and Introduction to Computer Vision. Outline

Perceptually Uniform Color Spaces

Today s lecture. Local neighbourhood processing. The convolution. Removing uncorrelated noise from an image The Fourier transform

Lecture 3: Linear Filters

Reading. 3. Image processing. Pixel movement. Image processing Y R I G Q

ISTITUTO NAZIONALE DI FISICA NUCLEARE

Why does a lower resolution image still make sense to us? What do we lose? Image:

Research Article Denoising Algorithm Based on Generalized Fractional Integral Operator with Two Parameters

Vision Modules and Cue Combination

Laplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters

Least-Squares Finite Element Methods

Announcements. Filtering. Image Filtering. Linear Filters. Example: Smoothing by Averaging. Homework 2 is due Apr 26, 11:59 PM Reading:

CS 188: Artificial Intelligence Spring Announcements

Enhanced Surface Metrology

Seminar on Vector Field Analysis on Surfaces

Announcements. CS 188: Artificial Intelligence Spring Classification. Today. Classification overview. Case-Based Reasoning

Nonlinear Diffusion. 1 Introduction: Motivation for non-standard diffusion

Lifting Detail from Darkness

Relations on Hypergraphs

Kalman filtering and friends: Inference in time series models. Herke van Hoof slides mostly by Michael Rubinstein

CS 542G: Robustifying Newton, Constraints, Nonlinear Least Squares

Spread Spectrum Watermarking. Information Technologies for IPR Protection

Improved Fast Gauss Transform. Fast Gauss Transform (FGT)

CSC321 Lecture 15: Exploding and Vanishing Gradients

15.063: Communicating with Data

Shape of Gaussians as Feature Descriptors

Lecture 3. Linear Regression II Bastian Leibe RWTH Aachen

Visual Imaging and the Electronic Age Color Science Metamers & Chromaticity Diagrams. Lecture #6 September 7, 2017 Prof. Donald P.

Gradient Domain High Dynamic Range Compression

A Generative Perspective on MRFs in Low-Level Vision Supplemental Material

Computer Vision Lecture 3

CSC321 Lecture 20: Reversible and Autoregressive Models

Digital Image Processing ERRATA. Wilhelm Burger Mark J. Burge. An algorithmic introduction using Java. Second Edition. Springer

Solving Corrupted Quadratic Equations, Provably

GradientShop: A Gradient-Domain Optimization Framework for Image and Video Filtering

Lecture 11: Vector Calculus I

A Comprehensive Framework for Modeling and Correcting Color Variations in Multi Projector Displays

Surface Brightness of Spiral Galaxies

6 The SVD Applied to Signal and Image Deblurring

Lecture 8: Interest Point Detection. Saad J Bedros

Taking derivative by convolution

Elaborazione delle Immagini Informazione multimediale - Immagini. Raffaella Lanzarotti

Gradient Descent. Ryan Tibshirani Convex Optimization /36-725

Multiview Geometry and Bundle Adjustment. CSE P576 David M. Rosen

8 The SVD Applied to Signal and Image Deblurring

8 The SVD Applied to Signal and Image Deblurring

Introduction to Computer Vision

Regularizing inverse problems. Damping and smoothing and choosing...

Lecture 5 Multivariate Linear Regression

Fast Local Laplacian Filters: Theory and Applications

A Parameter-Choice Method That Exploits Residual Information

SKA machine learning perspec1ves for imaging, processing and analysis

CS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015

EE5585 Data Compression April 18, Lecture 23

Old painting digital color restoration

Directional Field. Xiao-Ming Fu

Measurement of the meridional flow from eigenfunc5on perturba5ons

Transcription:

1

naïve composi-ng 2

Poisson composi-ng 3

our result 4

Objec+ves Seamless composi+ng Robust to inaccurate selec+on Output Quality - Limit color bleeding Time- Performance - Efficient method 5

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

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

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

Contribu+ons Conceal bleeding in textured areas Be_er gradient field at boundary Efficient linear scheme 9

Overview Problem Descrip-on Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 10

Foreground Algorithm Overview Selec-on Background

Foreground Algorithm Overview Selec-on grad Background grad

Foreground Algorithm Overview Selec-on grad paste Target gradient field Background grad

Foreground Algorithm Overview Selec-on grad paste Target gradient field Background integrate grad Result 14

Standard Approach: Poisson composi+ng We seek image I with gradients close to target v. target gradient field = 15

Standard Approach: Poisson composi+ng We seek image I with gradients close to target v. target gradient field = Least- squares: output gradient field 16

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

Overview Problem Statement Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 18

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

Visual Masking Demo Can you spot all the dots? 20

Visual Masking Demo Texture hides low- frequency content 21

Visual Masking Demo Can you spot all the dots? 22

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

Es+ma+ng the Amount of Texture RGB gradient field 24

Es+ma+ng the Amount of Texture Small Gaussian convolu-on RGB gradient field Noise controlling func-on Large Gaussian convolu-on 25

Es+ma+ng the Amount of Texture small Gaussian large Gaussian gradient field g 26

Es+ma+ng the Amount of Texture Texture Map Output (white indicates more texture) 27

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

Hiding Residuals with Visual Masking Bleeding only in textured areas Poisson composi+ng With texture weights 29

Hiding Residuals with Visual Masking Residuals Poisson composi+ng With texture weights 30

Hiding Residuals with Visual Masking Reduced bleeding but not fully Poisson composi+ng With texture weights 31

Overview Problem Statement Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 32

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

Naïve Approach Minimize Unfortunately, the result is not seamless: output of naïve approach close- up 34

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

Overview Problem Statement Hiding Residuals with Visual Masking Genera-ng a low- curl boundary Results and Comparisons 36

Results and Comparisons Copy- and- paste 37

Results and Comparisons Poisson Reconstruc+on : Pérez 03, Georgiev 06, 38

Results and Comparisons Maximum Gradient : Pérez 03 39

Results and Comparisons Diffusion : Agrawal 06 40

Results and Comparisons Lalonde 07 41

Results and Comparisons L 1 Norm : Reddy 09 42

Results and Comparisons Our Result 43

Results and Comparisons Our Result L_1 Norm Lalonde Diffusion Max Poisson 0 5 10 15 20 Running Time (Seconds) 44

Results and Comparisons Poisson 45

Results and Comparisons Our Result 46

Results and Comparisons Poisson 47

Results and Comparisons Our Result 48

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

Conclusion Robust composi+ng using visual masking Be_er gradient field at boundary Efficient linear scheme Poisson Reconstruc+on Our Result 50

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. 0739255 and No. 0924968. 51

Conclusion Robust composi+ng using visual masking Be_er gradient field at boundary Efficient linear scheme Poisson Reconstruc+on Our Result 52

Results and Comparisons 53

Results and Comparisons Poisson 54

Results and Comparisons Our Result 55