ICCV 2003 Colour Workshop 1 Recovery of Chromaticity Image Free from Shadows via Illumination Invariance Mark S. Drew 1, Graham D. Finlayson 2, & Steven.

Slides:



Advertisements
Similar presentations
A Common Framework for Ambient Illumination in the Dichromatic Reflectance Model Color and Reflectance in Imaging and Computer Vision Workshop 2009 October.
Advertisements

Intrinsic Images by Entropy Minimization (Midway Presentation, by Yingda Chen) Graham D. Finlayson, Mark S. Drew and Cheng Lu, ECCV, Prague, 2004.
Computer Vision Radiometry. Bahadir K. Gunturk2 Radiometry Radiometry is the part of image formation concerned with the relation among the amounts of.
Scene illumination and surface albedo recovery via L1-norm total variation minimization Hong-Ming Chen Advised by: John Wright.
Color Imaging Analysis of Spatio-chromatic Decorrelation for Colour Image Reconstruction Mark S. Drew and Steven Bergner
A Standardized Workflow for Illumination-Invariant Image Extraction Mark S. Drew Muntaseer Salahuddin Alireza Fathi Simon Fraser University, Vancouver,
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm Lecture #12.
Eyes for Relighting Extracting environment maps for use in integrating and relighting scenes (Noshino and Nayar)
Lilong Shi and Brian Funt School of Computing Science, Simon Fraser University, Canada.
16421: Vision Sensors Lecture 6: Radiometry and Radiometric Calibration Instructor: S. Narasimhan Wean 5312, T-R 1:30pm – 2:50pm.
Basic Principles of Surface Reflectance
3D Reconstruction – Factorization Method Seong-Wook Joo KG-VISA 3/10/2004.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
1 Practical Scene Illuminant Estimation via Flash/No-Flash Pairs Cheng Lu and Mark S. Drew Simon Fraser University {clu,
BMVC 2009 Specularity and Shadow Interpolation via Robust Polynomial Texture Maps Mark S. Drew 1, Nasim Hajari 1, Yacov Hel-Or 2 & Tom Malzbender 3 1 School.
ECCV 2002 Removing Shadows From Images G. D. Finlayson 1, S.D. Hordley 1 & M.S. Drew 2 1 School of Information Systems, University of East Anglia, UK 2.
1 Invariant Image Improvement by sRGB Colour Space Sharpening 1 Graham D. Finlayson, 2 Mark S. Drew, and 2 Cheng Lu 1 School of Information Systems, University.
Camera calibration and epipolar geometry
1 Automatic Compensation for Camera Settings for Images Taken under Different Illuminants Cheng Lu and Mark S. Drew Simon Fraser University {clu,
1 A Markov Random Field Framework for Finding Shadows in a Single Colour Image Cheng Lu and Mark S. Drew School of Computing Science, Simon Fraser University,
School of Computer Science Simon Fraser University November 2009 Sharpening from Shadows: Sensor Transforms for Removing Shadows using a Single Image Mark.
Uncalibrated Geometry & Stratification Sastry and Yang
Flexible Bump Map Capture From Video James A. Paterson and Andrew W. Fitzgibbon University of Oxford Calibration Requirement:
Mark S. Drew and Amin Yazdani Salekdeh School of Computing Science,
6/23/2015CIC 10, Color constancy at a pixel [Finlayson et al. CIC8, 2000] Idea: plot log(R/G) vs. log(B/G): 14 daylights 24 patches.
Fast Illumination-invariant Background Subtraction using Two Views: Error Analysis, Sensor Placement and Applications Ser-Nam Lim, Anurag Mittal, Larry.
Shadow Removal Using Illumination Invariant Image Graham D. Finlayson, Steven D. Hordley, Mark S. Drew Presented by: Eli Arbel.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Basic Principles of Surface Reflectance Lecture #3 Thanks to Shree Nayar, Ravi Ramamoorthi, Pat Hanrahan.
COMP 290 Computer Vision - Spring Motion II - Estimation of Motion field / 3-D construction from motion Yongjik Kim.
Introduction of the intrinsic image. Intrinsic Images The method of Finlayson & Hordley ( 2001 ) Two assumptions 1. the camera ’ s sensors are sufficiently.
Colour Image Compression by Grey to Colour Conversion Mark S. Drew 1, Graham D. Finlayson 2, and Abhilash Jindal 3 1 Simon Fraser University 2 University.
Stockman MSU/CSE Math models 3D to 2D Affine transformations in 3D; Projections 3D to 2D; Derivation of camera matrix form.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Statistical Color Models (SCM) Kyungnam Kim. Contents Introduction Trivariate Gaussian model Chromaticity models –Fixed planar chromaticity models –Zhu.
Basic Principles of Imaging and Photometry Lecture #2 Thanks to Shree Nayar, Ravi Ramamoorthi, Pat Hanrahan.
Optical flow (motion vector) computation Course: Computer Graphics and Image Processing Semester:Fall 2002 Presenter:Nilesh Ghubade
Computer Vision Spring ,-685 Instructor: S. Narasimhan PH A18B T-R 10:30am – 11:50am Lecture #13.
Summer School on Image Processing 2009, Debrecen, Hungary Colour image processing for SHADOW REMOVAL Alina Elena Oprea, University Politehnica of Bucharest.
Tricolor Attenuation Model for Shadow Detection. INTRODUCTION Shadows may cause some undesirable problems in many computer vision and image analysis tasks,
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
Camera Geometry and Calibration Thanks to Martial Hebert.
Oct 10, Image Formation: Light Sources + Reflectance + Sensors Light is produced in different amounts at different wavelengths by each light source.
Image Formation Fundamentals Basic Concepts (Continued…)
November 2012 The Role of Bright Pixels in Illumination Estimation Hamid Reza Vaezi Joze Mark S. Drew Graham D. Finlayson Petra Aurora Troncoso Rey School.
Y. Moses 11 Combining Photometric and Geometric Constraints Yael Moses IDC, Herzliya Joint work with Ilan Shimshoni and Michael Lindenbaum, the Technion.
University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction to computer vision Chapter 2: Image.
1 Formation et Analyse d’Images Session 2 Daniela Hall 7 October 2004.
Image Based Rendering. Light Field Gershun in 1936 –An illuminated objects fills the surrounding space with light reflected of its surface, establishing.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
Digital Image Processing In The Name Of God Digital Image Processing Lecture6: Color Image Processing M. Ghelich Oghli By: M. Ghelich Oghli
1 Motion Analysis using Optical flow CIS601 Longin Jan Latecki Fall 2003 CIS Dept of Temple University.
Multiple Light Source Optical Flow Multiple Light Source Optical Flow Robert J. Woodham ICCV’90.
Computer vision: models, learning and inference M Ahad Multiple Cameras
1Ellen L. Walker 3D Vision Why? The world is 3D Not all useful information is readily available in 2D Why so hard? “Inverse problem”: one image = many.
Reflectance Function Estimation and Shape Recovery from Image Sequence of a Rotating object Jiping Lu, Jim Little UBC Computer Science ICCV ’ 95.
Colorization is a user-assisted color manipulation mechanism for changing grayscale images into colored ones. Surprisingly, only a fairly sparse set of.
Robotics Chapter 6 – Machine Vision Dr. Amit Goradia.
ECE 638: Principles of Digital Color Imaging Systems Lecture 5: Primaries.
Date of download: 6/1/2016 Copyright © 2016 SPIE. All rights reserved. (a) Optical image of fore and hind wings from a male S. charonda butterfly at different.
Color Image Processing
Color Image Processing
René Vidal and Xiaodong Fan Center for Imaging Science
3D Graphics Rendering PPT By Ricardo Veguilla.
Common Classification Tasks
Mingjing Zhang and Mark S. Drew
Color Image Processing
Part One: Acquisition of 3-D Data 2019/1/2 3DVIP-01.
Color Model By : Mustafa Salam.
Specularity, the Zeta-image, and Information-Theoretic Illuminant
Presentation transcript:

ICCV 2003 Colour Workshop 1 Recovery of Chromaticity Image Free from Shadows via Illumination Invariance Mark S. Drew 1, Graham D. Finlayson 2, & Steven D. Hordley 2 2 School of Information Systems, University of East Anglia, UK 1 School of Computing Science, Simon Fraser University, Canada

ICCV 2003 Colour Workshop 2 Overview Introduction Shadow Free Greyscale images - Illuminant Invariance at a pixel -- 1D image Shadow Free Chromaticity Images - Better-behaved 2D-colour image invariant to lighting Application - For shadow-edge-map aimed at re-integrating to obtain full colour, shadow-free image

ICCV 2003 Colour Workshop 3 The Aim: Shadow Removal We would like to go from a colour image with shadows to the same colour image, but without the shadows.

ICCV 2003 Colour Workshop 4 Why Shadow Removal? For Computer Vision, Image Enhancement, Scene Re-lighting, etc. - e.g., improved object tracking, segmentation etc. Two successive video frames Motion map, original colour space  Motion map, invariant colour space snake

ICCV 2003 Colour Workshop 5 What is a shadow? Region Lit by Sunlight and Sky-light Region Lit by Sky-light only A shadow is a local change in illumination intensity and (often) illumination colour.

ICCV 2003 Colour Workshop 6 Removing Shadows So, if we can factor out the illumination locally (at a pixel) it should follow that we remove the shadows. Can we factor out illumination locally? That is, can we derive an illumination-invariant colour representation at a single image pixel? Yes, provided that our camera and illumination satisfy certain restrictions ….

ICCV 2003 Colour Workshop 7 Conditions for Illumination Invariance Assumptions (but works anyway…!): (1) If sensors can be represented as delta functions (they respond only at a single wavelength) (2) and illumination is restricted to the Planckian locus (3) then we can find a 1D coordinate, a function of image chromaticities, which is invariant to illuminant colour and intensity (4) this gives us a greyscale representation of our original image, but without the shadows (so takes us a third of the way to the goal of this talk!)  (5) But the greyscale value in fact lives in a 2D log- chromaticity colour space, (so takes us a 2/3 of the way) [and exponentiating goes back to a rank-3 colour].

ICCV 2003 Colour Workshop 8 Chromaticity: 2D chromaticity is much more information than 1D greyscale: Can we obtain a shadowless chromaticity image? grey colour chromaticity

ICCV 2003 Colour Workshop 9 Image Formation Camera responses depend on 3 factors: light (E), surface (S), and sensor (Q)  is Lambertian shading

ICCV 2003 Colour Workshop 10 Q 2 ( ) Sensitivity Q 1 ( )Q 3 ( ) = Delta functions “select” single wavelengths: Using Delta-Function Sensitivities

ICCV 2003 Colour Workshop 11 Characterizing Typical Illuminants Most typical illuminants lie on, or close to, the Planckian locus (the red line in the figure) So, let’s represent illuminants by their equivalent Planckian black-body illuminants...

ICCV 2003 Colour Workshop 12 Here I controls the overall intensity of light, T is the temperature, and c 1, c 2 are constants Planckian Black-body Radiators For typical illuminants, c 2 >> T. So, Wien’s approximation:

ICCV 2003 Colour Workshop 13 How good is this approximation? 2500 Kelvin Kelvin 5500 Kelvin

ICCV 2003 Colour Workshop 14 For delta-function sensors and Planckian illumination we have: Back to the image formation equation Surface Light

ICCV 2003 Colour Workshop 15 Band-ratio chromaticity G R B Plane G=1 Perspective projection onto G=1 Let us define a set of 2D band-ratio chromaticities: p is one of the channels, (Green, say)

ICCV 2003 Colour Workshop 16 Let’s take log’s: Band-ratios remove shading and intensity with Gives a straight line: Shading and intensity are gone.

ICCV 2003 Colour Workshop 17 Calibration: find invariant direction Log-ratio chromaticities for 6 surfaces under 14 different Planckian illuminants, HP912 camera Macbeth ColorChecker: 24 patches

ICCV 2003 Colour Workshop 18 Deriving the Illuminant Invariant This axis is invariant to shading + illuminant intensity/colour

ICCV 2003 Colour Workshop 19 Algorithm: Plot, and subtract mean for each colour patch: SVD (2 nd eigenvector) gives invariant direction.

ICCV 2003 Colour Workshop 20 Algorithm, cont’d: Form greyscale I’ in log-space: exponentiate:

ICCV 2003 Colour Workshop 21 Obtaining invariant Chromaticity image (1): We observe: line in 2D chromaticity space is still 2D, if we use projector, rather than rotation: 2-vector

ICCV 2003 Colour Workshop 22 Obtaining invariant Chromaticity image (2): However, we have removed all lighting!  put back offset in e-direction equal to regression on top 1% brightness pixels:

ICCV 2003 Colour Workshop 23 Obtaining invariant Chromaticity image (3): offset in e-direction: We are most familiar with L 1 -chromaticity

ICCV 2003 Colour Workshop 24 Obtaining invariant Chromaticity image (4): In terms of L 1 -chromaticity: orig. recovered

ICCV 2003 Colour Workshop 25 Obtaining invariant Chromaticity image (5): Projection line becomes a rank ~3 curve in L 1 chromaticity space

ICCV 2003 Colour Workshop 26 Obtaining invariant Chromaticity image (6): We can do better on fitting recovered chromaticity to original — regress on brightest quartile:

ICCV 2003 Colour Workshop 27 Improves chromaticity: orig. recovered regressed

ICCV 2003 Colour Workshop 28 Some Examples colour chromaticity recovered

ICCV 2003 Colour Workshop 29 Main Advantage: chromaticity invariant (in [0,1]) is better- behaved than greyscale invariant –– better for shadow-free re-integration (ECCV02)

ICCV 2003 Colour Workshop 30 Acknowledgements The authors would like to thank the Natural Sciences and Engineering Research Council of Canada, and Hewlett-Packard Incorporated for their support of this work.