Illumination Estimation via Non- Negative Matrix Factorization By Lilong Shi, Brian Funt, Weihua Xiong, ( Simon Fraser University, Canada) Sung-Su Kim,

Slides:



Advertisements
Similar presentations
Nonnegative Matrix Factorization with Sparseness Constraints S. Race MA591R.
Advertisements

Accelerated, Parallel and PROXimal coordinate descent IPAM February 2014 APPROX Peter Richtárik (Joint work with Olivier Fercoq - arXiv: )
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Illumination Estimation via Thin Plate Spline Weihua Xiong ( OmniVision Technology,USA ) Lilong Shi, Brian Funt ( Simon Fraser University, Canada) ( Simon.
Color Imaging Analysis of Spatio-chromatic Decorrelation for Colour Image Reconstruction Mark S. Drew and Steven Bergner
Binary Shading using Geometry and Appearance Bert Buchholz Tamy Boubekeur Doug DeCarlo Marc Alexa Telecom ParisTech – CNRS Rutgers University TU Berlin.
Color Image Understanding Sharon Alpert & Denis Simakov.
Nonsmooth Nonnegative Matrix Factorization (nsNMF) Alberto Pascual-Montano, Member, IEEE, J.M. Carazo, Senior Member, IEEE, Kieko Kochi, Dietrich Lehmann,
Spectral Matting Anat Levin 1,2 Alex Rav-Acha 1 Dani Lischinski 1 1 School of CS&Eng The Hebrew University 2 CSAIL MIT.
1School of CS&Eng The Hebrew University
Simon Fraser University Computational Vision Lab Lilong Shi, Brian Funt and Tim Lee.
Lilong Shi and Brian Funt School of Computing Science, Simon Fraser University, Canada.
Approaches for Retinex and Their Relations Yu Du March 14, 2002.
Shape From Light Field meets Robust PCA
Light, Surface and Feature in Color Images Lilong Shi Postdoc at Caltech Computational Vision Lab, Simon Fraser University.
Rob Fergus Courant Institute of Mathematical Sciences New York University A Variational Approach to Blind Image Deconvolution.
Classical inference and design efficiency Zurich SPM Course 2014
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.
The Viola/Jones Face Detector (2001)
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.
Unsupervised Feature Selection for Multi-Cluster Data Deng Cai et al, KDD 2010 Presenter: Yunchao Gong Dept. Computer Science, UNC Chapel Hill.
School of Computer Science Simon Fraser University November 2009 Sharpening from Shadows: Sensor Transforms for Removing Shadows using a Single Image Mark.
Light Mixture Estimation for Spatially Varying White Balance
The Capacity of Color Histogram Indexing Dong-Woei Lin NTUT CSIE.
Quaternion Colour Texture
Quaternion Colour Constancy
Color Image Understanding Sharon Alpert & Denis Simakov.
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.
WORD-PREDICTION AS A TOOL TO EVALUATE LOW-LEVEL VISION PROCESSES Prasad Gabbur, Kobus Barnard University of Arizona.
A Theory of Locally Low Dimensional Light Transport Dhruv Mahajan (Columbia University) Ira Kemelmacher-Shlizerman (Weizmann Institute) Ravi Ramamoorthi.
Lilong Shi, Brian Funt, and Ghassan Hamarneh School of Computing Science, Simon Fraser University.
High-resolution Hyperspectral Imaging via Matrix Factorization Rei Kawakami 1 John Wright 2 Yu-Wing Tai 3 Yasuyuki Matsushita 2 Moshe Ben-Ezra 2 Katsushi.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Introduction SNR Gain Patterns Beam Steering Shading Resources: Wiki:
Mutual Information-based Stereo Matching Combined with SIFT Descriptor in Log-chromaticity Color Space Yong Seok Heo, Kyoung Mu Lee, and Sang Uk Lee.
Multimodal Interaction Dr. Mike Spann
Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.
Non Negative Matrix Factorization
Cs: compressed sensing
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.
Maryam Sadeghi 1,3, Majid Razmara 1, Martin Ester 1, Tim K. Lee 1,2,3 and M. Stella Atkins 1 1: School of Computing Science, Simon Fraser University 2:
Sparse Matrix Factorizations for Hyperspectral Unmixing John Wright Visual Computing Group Microsoft Research Asia Sept. 30, 2010 TexPoint fonts used in.
Local Non-Negative Matrix Factorization as a Visual Representation Tao Feng, Stan Z. Li, Heung-Yeung Shum, HongJiang Zhang 2002 IEEE Presenter : 張庭豪.
EEG/MEG Source Localisation SPM Course – Wellcome Trust Centre for Neuroimaging – Oct ? ? Jérémie Mattout, Christophe Phillips Jean Daunizeau Guillaume.
The Quotient Image: Class-based Recognition and Synthesis Under Varying Illumination T. Riklin-Raviv and A. Shashua Institute of Computer Science Hebrew.
High-resolution Hyperspectral Imaging via Matrix Factorization
Face Detection Using Large Margin Classifiers Ming-Hsuan Yang Dan Roth Narendra Ahuja Presented by Kiang “Sean” Zhou Beckman Institute University of Illinois.
Joint Tracking of Features and Edges STAN BIRCHFIELD AND SHRINIVAS PUNDLIK CLEMSON UNIVERSITY ABSTRACT LUCAS-KANADE AND HORN-SCHUNCK JOINT TRACKING OF.
CoNMF: Exploiting User Comments for Clustering Web2.0 Items Presenter: He Xiangnan 28 June School of Computing National.
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
Thank you for the introduction
A Hybrid Strategy For Illuminant Estimation Targeting Hard Images Roshanak Zakizadeh 1 Michael Brown 2 Graham Finlayson 1 1 University of East Anglia 2.
Computational Vision CSCI 363, Fall 2012 Lecture 17 Stereopsis II
Sparse nonnegative matrix factorization for protein sequence motifs information discovery Presented by Wooyoung Kim Computer Science, Georgia State University.
Semi-Supervised Clustering
Jinbo Bi Joint work with Jiangwen Sun, Jin Lu, and Tingyang Xu
Multiplicative updates for L1-regularized regression
Algorithm Theoretical Basis Document GlobAlbedo Aerosol Retrieval
Nonparametric Semantic Segmentation
Machine Learning Basics
Color Error Diffusion with Generalized Optimum Noise Shaping
Learning with information of features
Towards Understanding the Invertibility of Convolutional Neural Networks Anna C. Gilbert1, Yi Zhang1, Kibok Lee1, Yuting Zhang1, Honglak Lee1,2 1University.
“grabcut”- Interactive Foreground Extraction using Iterated Graph Cuts
The loss function, the normal equation,
Mathematical Foundations of BME Reza Shadmehr
COLOR CONSTANCY IN THE COMPRESSED DOMAIN
Shape from Shading and Texture
Non-Negative Matrix Factorization
Directional Occlusion with Neural Network
Presentation transcript:

Illumination Estimation via Non- Negative Matrix Factorization By Lilong Shi, Brian Funt, Weihua Xiong, ( Simon Fraser University, Canada) Sung-Su Kim, Byoung-Ho Kang, Sung-Duk Lee, and Chang-Yeong Kim (Samsung Advanced Institute of Technology, Korea) Presented by: Lilong Shi

Automatic White Balance Problem AWB Colour constancy accounting for differences in illumination colour

Overview N sub-windows Take log and apply NMFsc Illumination component (low sparseness) M Reflectance basis (high sparseness) Illumination image by anti-log Reflectance images by anti-log With this we can do AWB

The Model of Illumination and Feature Reflectances RGB sensor response is defined by E(λ) : illumination spectral power distribution S(λ) : matte surface reflectance function R k (λ) : sensor sensitivity function of channel k Assuming narrowband sensors:

The Model of Illumination and Feature Reflectances In logarithm space Linear combination of illumination and reflectance For an entire colour image I, with E and S the illumination and reflectance

Linear Reflectance Features Illumination log E Changes slowly cross an image Reflectance log S Linear combination of M “features” F i weights h i

7 Linear Reflectance Features “Feature” Reflectances “building blocks” e.g. basis images derived from the ORL face image database following Li et al. (2001) Independent  No non-zero pixels in common  Dot product of 2 blocks is zero The complete model

Non-Negative Matrix Factorization NMF Input data matrix Basis vectorsWeights Factored result A data instance v is a weighted combination of basis

Constraints on the Factorization Illumination & reflectance non-negative => NMF basis non-negative E smooth, R non-smooth Sparseness vs. Smoothness 1D example Increasing smoothness Increasing sparseness

Sparseness Constraint Sparseness implies most entries zero 2D example Increasing sparseness

Sparseness Measure Sparseness s(x) of x= Sparseness constraint is enforced during matrix factorization L-1 norm L-2 norm

NMFsc Using Non-Negative Matrix Factorization with sparseness constraint Calling it NMFsc

NMFsc for Auto White Balancing The Illumination-Reflectance model NMFsc form In combination

Incorporating Sparseness Finding M+1 basis vectors Set low sparseness for 1 st basis vector (illumination) Set high sparseness for 2 nd -(M+1) th basis (feature reflectance)

The Algorithm N sub-windows Take log and apply NMFsc Illumination basis (low sparseness) M Reflectance basis (high sparseness) Illumination image by anti-log Reflectance images by anti-log

Experiment on MNFsc (M=4) Input Ground Truth NMFsc result

Experiment on MNFsc (M=4) Illumination Image Reflectance Images

More Experiment on NMFsc (M=4) Input Ground Truth NMFsc result

Experiment on MNFsc (M=4) Illumination Image Reflectance Images

Experiment on MNFsc (M=1) Ground Truth Input Illumination Image NMFsc Result Reflectance Image

More Experiments (M=1) NMFsc Result Reflectance Image Ground Truth Input Illumination Image

Tests on Large Dataset (M=4) 16 sub-windows (16x16) Take log and apply NMFsc Illumination basis (sparseness=0.001) 4 Reflectance basis (sparseness = 0.45) Illumination image by anti-log Reflectance images by anti-log 7661 images (64x64) Average to estimate illumination

Tests on Large Dataset (M=1) Single sub-window (64x64) Take log and apply NMFsc Illumination basis (sparseness=0.001) One reflectance basis (sparseness = 0.45) Illumination image by anti-log Reflectance images by anti-log 7661 images (64x64) Average to estimate illumination

Results Processing Time: 0.83 sec/image for M = 4; 2.43 sec/image for M = 1; Method Angular DegreesL-2 Distance (x10 2 ) MeanMaxMeanMax GW SoG MAX RGB NMFsc (M = 4) NMFsc (M = 1)

Algorithm Comparison via Wilcoxon MethodGWSoGMAX NMFsc (M=4) NMFsc (M=1) GW =+=- SoG =++- MAX ---- NMFsc (M=4) =-+- NMFsc (M=1) ++++ NMFsc better than Greyworld, Shades of Gray, Max RGB

Conclusions New AWB method using NMF NMF ‘factors’ illumination from reflectance Provides separate estimate for each pixel Globally minimizes objective function across all three colour channels Incorporates both colour and spatial (sparseness) information Assumptions spatially smooth illumination variation non-smooth reflectance variation

Conclusions Insensitive to sparseness setting NMFsc converges quickly iterations Good AWB results Tested on large data set of natural images

Financial support provided by Samsung Advanced Institute of Technology

Thank you! Yoho National Park British Columbia, Canada