Introduction of the intrinsic image. Intrinsic Images The method of Finlayson & Hordley ( 2001 ) Two assumptions 1. the camera ’ s sensors are sufficiently.

Slides:



Advertisements
Similar presentations
Intrinsic Images by Entropy Minimization (Midway Presentation, by Yingda Chen) Graham D. Finlayson, Mark S. Drew and Cheng Lu, ECCV, Prague, 2004.
Advertisements

Computer Vision Radiometry. Bahadir K. Gunturk2 Radiometry Radiometry is the part of image formation concerned with the relation among the amounts of.
QR Code Recognition Based On Image Processing
Road-Sign Detection and Recognition Based on Support Vector Machines Saturnino, Sergio et al. Yunjia Man ECG 782 Dr. Brendan.
Scene illumination and surface albedo recovery via L1-norm total variation minimization Hong-Ming Chen Advised by: John Wright.
Evaluating Color Descriptors for Object and Scene Recognition Koen E.A. van de Sande, Student Member, IEEE, Theo Gevers, Member, IEEE, and Cees G.M. Snoek,
A Standardized Workflow for Illumination-Invariant Image Extraction Mark S. Drew Muntaseer Salahuddin Alireza Fathi Simon Fraser University, Vancouver,
ECE 472/572 - Digital Image Processing Lecture 10 - Color Image Processing 10/25/11.
Digital Image Fundamentals Selim Aksoy Department of Computer Engineering Bilkent University
Simon Fraser University Computational Vision Lab Lilong Shi, Brian Funt and Tim Lee.
COLORCOLOR A SET OF CODES GENERATED BY THE BRAİN How do you quantify? How do you use?
Color Image Processing
Physics-based Illuminant Color Estimation as an Image Semantics Clue Christian Riess Elli Angelopoulou Pattern Recognition Lab (Computer Science 5) University.
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.
ICCV 2003 Colour Workshop 1 Recovery of Chromaticity Image Free from Shadows via Illumination Invariance Mark S. Drew 1, Graham D. Finlayson 2, & Steven.
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.
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.
Recovering Intrinsic Images from a Single Image 28/12/05 Dagan Aviv Shadows Removal Seminar.
Lecture 30: Light, color, and reflectance CS4670: Computer Vision Noah Snavely.
Color Image Understanding Sharon Alpert & Denis Simakov.
Stereoscopic Light Stripe Scanning: Interference Rejection, Error Minimization and Calibration By: Geoffrey Taylor Lindsay Kleeman Presented by: Ali Agha.
1 Comp300a: Introduction to Computer Vision L. QUAN.
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.
What is color for?.
Shadow Removal Using Illumination Invariant Image Graham D. Finlayson, Steven D. Hordley, Mark S. Drew Presented by: Eli Arbel.
CSC 461: Lecture 2 1 CSC461 Lecture 2: Image Formation Objectives Fundamental imaging notions Fundamental imaging notions Physical basis for image formation.
Statistical Color Models (SCM) Kyungnam Kim. Contents Introduction Trivariate Gaussian model Chromaticity models –Fixed planar chromaticity models –Zhu.
Colour in Computer Graphics Mel Slater. Outline: This time Introduction Spectral distributions Simple Model for the Visual System Simple Model for an.
Spectral contrast enhancement
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,
Computer Graphics I, Fall 2008 Image Formation.
Image Formation. Input - Digital Images Intensity Images – encoding of light intensity Range Images – encoding of shape and distance They are both a 2-D.
1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.
Joint Depth Map and Color Consistency Estimation for Stereo Images with Different Illuminations and Cameras Yong Seok Heo, Kyoung Mu Lee and Sang Uk Lee.
Digital Image Fundamentals Selim Aksoy Department of Computer Engineering Bilkent University
Y. Moses 11 Combining Photometric and Geometric Constraints Yael Moses IDC, Herzliya Joint work with Ilan Shimshoni and Michael Lindenbaum, the Technion.
6. COLOR IMAGE PROCESSING
1 Formation et Analyse d’Images Session 2 Daniela Hall 7 October 2004.
AdeptSight Image Processing Tools Lee Haney January 21, 2010.
September 17, 2013Computer Vision Lecture 5: Image Filtering 1ColorRGB HSI.
CS6825: Color 2 Light and Color Light is electromagnetic radiation Light is electromagnetic radiation Visible light: nm. range Visible light:
Digital Image Processing In The Name Of God Digital Image Processing Lecture6: Color Image Processing M. Ghelich Oghli By: M. Ghelich Oghli
Introduction to Computer Graphics
Lecture 34: Light, color, and reflectance CS4670 / 5670: Computer Vision Noah Snavely.
Visual Computing Computer Vision 2 INFO410 & INFO350 S2 2015
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.
Remote Sensing Image Enhancement. Image Enhancement ► Increases distinction between features in a scene ► Single image manipulation ► Multi-image manipulation.
Geometry Reconstruction March 22, Fundamental Matrix An important problem: Determine the epipolar geometry. That is, the correspondence between.
Pseudo / Color Image Processing Fasih ur Rehman. Color Image Processing Two major areas of Color Image Processing –Pseudo Color Image Processing Assigning.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Computer Graphics Lecture 30 Mathematics of Lighting and Shading - IV Taqdees A. Siddiqi
Introduction to Digital Image Analysis Kurt Thorn NIC.
Digital Image Processing Lecture 12: Color Image Processing Naveed Ejaz.
1 Resolving the Generalized Bas-Relief Ambiguity by Entropy Minimization Neil G. Alldrin Satya P. Mallick David J. Kriegman University of California, San.
CS262 – Computer Vision Lect 4 - Image Formation
Color Image Processing
Color Image Processing
Ido Omer Michael Werman
Chapter 6: Color Image Processing
Color Image Processing
Chapter 14 Shading Models.
Computer Vision Lecture 4: Color
Color Image Processing
Extract Object Boundaries in Noisy Images
Video Compass Jana Kosecka and Wei Zhang George Mason University
Color Image Processing
Chapter 14 Shading Models.
Presentation transcript:

Introduction of the intrinsic image

Intrinsic Images The method of Finlayson & Hordley ( 2001 ) Two assumptions 1. the camera ’ s sensors are sufficiently narrow band. 2. the illuminant can be approximated by a black-body radiator.

The power spectrum of a black-body radiator The radiance of a black-body radiator temperature T ( Kelvin ), wavelength, Planck ’ s constant Boltzmann ’ s constant, the speed of light

Finlayson & Hordley : many fluorescent light sources can be approximated by a black-body radiator.

Simplification of the equation The temperature T < K. The visual spectrum ranges : 400 nm ~ 700 nm.

Different intensities of the black-body radiator : another constant k. The intensity measured by the sensor

Assumption 1. the illuminant can be approximated by a black-body radiator. 2. pixel colors are linearly related to the data measured by the sensor.

Logarithm The first term : the power of the illuminant and the scene geometry but independent of the color of the illuminant and the reflectance. The second term : the wavelength to which the sensor responds and on the reflectance of the object. The last term : the color of illuminant.

Compute the differences Let and.

As a 2-D vector. If the temperature T is a parameter, the two equations define a line where is a point on the line and other points on the line are reached by adding with varying amounts.

The constants only depend on the wavelength to which the sensor responds. is independent of reflectance.

T : 1000 K ~ K ( in steps of 20 %) Several different surfaces ( red -> white ) were illuminanted by a black-body radiator of different temperatures. sensors : The direction of the lines only depends on the type of sensors used in the camera.

Gamma correction Pixel colors : logarithm : The influence of any gamma correction does not exist for the line in log- chromaticity difference space.

Removal of the temperature T Project the data points in a direction orthogonal to the line. The equation is independent of the illuminant.

Color circle log-chromaticity difference coordinates

If we project the data points along the invariant direction, some information will be lost. Mix of blue and red or cyan and yellow. The direction in which to project the log-chromaticity difference is unique for each camera.

Drawback & : the response of the chosen channel may be very low, leading to noisy results. Which channel should be chosen ?

Modification Finlayson & Drew ( 2001 ): dividing by the geometric mean of the three channels to remove the dependence on the shading information G and the dependence on the intensity k.

the vector is orthogonal to the vector, all points are located on the 2-D plane defined by u.

Finlayson ( 2004 ) define the following coordinate system for the geometric mean chromaticity space. : the two basis vectors Find the two vectors

The geometric mean 2-D chromaticity space Color circle Geometric mean 2-D chromaticity space

Geometric mean chromaticities If we project along a line in geometric mean 2-D chromaticity space, we ’ ll lose some information about the color of the objects. Using the method, we can transform the input image of a calibrated camera to an intrinsic image.

Intrinsic image The intrinsic images only depend on the reflectance of the object points. The 2-D coordinates have to be projected onto a line that is orthogonal to the vector. For a given camera, this vector can be found experimentally by imaging a calibration image under several different illuminants.

Uncalibrated image Finlayson ( 2004 ): compute intrinsic images for an uncalibrated camera from a single image The projection has to be done onto a line inside the geometric mean 2-D chromaticity space. Which line is the correct one ?

The projection of the data points for two different lines.

Entropy Finlayson : the correct orientation is the orientation where the resulting image has minimum entropy. Let be the set of lines for which we compute the entropy.

Entropy For each line, the invariant data points A gray-scale image is formed from the projected data points that are transformed to the range[0, 1]. A histogram is computed for the image.

Compute the probability that the gray value occurs in the image. Compute the entropy The correct direction for the line will be the one where the entropy is minimal.

The invariant direction is located at an angle of °, which corresponds to a projection direction of 60.75°.

The intrinsic image that is based only on reflectance can be used for object recognition. Can we move from an intrinsic image back to a full color image ? As we have known, some color information is lost.

Color image Drew ( 2003 ): go back to a color image The projected coordinates don ’ t have to be interpreted as a gray-scale image. The coordinates along the projection line are 2-D.

Compute the corresponding 3-D coordinates in geometric mean chromaticity space by multiplying the projected coordinates by.

Drew : adding a little illuminant in order to obtain a color image from the 1-D data points. Compute the and project these points onto the invariant direction. Compute the median values of this data.

An illuminanted image is obtained by moving all projected data points by along the direction. 1% of the brightest image pixels = the median of the brightest 1% of the image pixels

Exponentiate to compute output colors. Intrinsic RGB image Rescale the intrinsic image to have the original lightness of the input image.

Segment the input image Compute edges of the segmented input image and the RGB chromaticity intrinsic image Take the threshold : shadow edges 1. edge values > a threshold in the segmented image 2. edge values < another threshold in the RGB color space

Apply the first derivative to the logarithm of the input image Use a morphological operator to binarize and thicken the shadow edges Replace iteratively unknown derivative values on the boundary of the shadow edges by the median of known ones in the vicinity

( e )=( b )-( d ) Marc Ebner

Graham D. Finlayson

Reference Marc Ebner. Color Constancy John Wiley & Sons, England, Finlayson, G.D. and Drew, M.S. and Lu, C., "Intrinsic Images by Entropy Minimisation", In 8th European Conference on Computer Vision III, pp , G.D. Finlayson, S.D. Hordley, and M.S. Drew. Removing shadows from images. In ECCV 2002: European Conference on Computer Vision, pages 4:823 – 836, Lecture Notes in Computer Science Vol. 2353, ∼ mark/ftp/Eccv02/shadowless. pdf.