Mutual Information-based Stereo Matching Combined with SIFT Descriptor in Log-chromaticity Color Space Yong Seok Heo, Kyoung Mu Lee, and Sang Uk Lee.

Slides:



Advertisements
Similar presentations
A Fast Local Descriptor for Dense Matching
Advertisements

Pose Estimation and Segmentation of People in 3D Movies Karteek Alahari, Guillaume Seguin, Josef Sivic, Ivan Laptev Inria, Ecole Normale Superieure ICCV.
Spatial-Temporal Consistency in Video Disparity Estimation ICASSP 2011 Ramsin Khoshabeh, Stanley H. Chan, Truong Q. Nguyen.
Stereo Many slides adapted from Steve Seitz. Binocular stereo Given a calibrated binocular stereo pair, fuse it to produce a depth image Where does the.
Real-Time Accurate Stereo Matching using Modified Two-Pass Aggregation and Winner- Take-All Guided Dynamic Programming Xuefeng Chang, Zhong Zhou, Yingjie.
INTRODUCTION Heesoo Myeong, Ju Yong Chang, and Kyoung Mu Lee Department of EECS, ASRI, Seoul National University, Seoul, Korea Learning.
Does Color Really Help in Dense Stereo Matching?
GrabCut Interactive Image (and Stereo) Segmentation Carsten Rother Vladimir Kolmogorov Andrew Blake Antonio Criminisi Geoffrey Cross [based on Siggraph.
Lecture 8: Stereo.
Stereo.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
Boundary matting for view synthesis Samuel W. Hasinoff Sing Bing Kang Richard Szeliski Computer Vision and Image Understanding 103 (2006) 22–32.
Last Time Pinhole camera model, projection
Multiple View Geometry : Computational Photography Alexei Efros, CMU, Fall 2005 © Martin Quinn …with a lot of slides stolen from Steve Seitz and.
Recognising Panoramas
Computer Vision : CISC 4/689 Adaptation from: Prof. James M. Rehg, G.Tech.
Stereo & Iterative Graph-Cuts Alex Rav-Acha Vision Course Hebrew University.
Optical flow and Tracking CISC 649/849 Spring 2009 University of Delaware.
3D from multiple views : Rendering and Image Processing Alexei Efros …with a lot of slides stolen from Steve Seitz and Jianbo Shi.
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
Stereo Computation using Iterative Graph-Cuts
Compact Windows for Visual Correspondence via Minimum Ratio Cycle Algorithm Olga Veksler NEC Labs America.
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 11, NOVEMBER 2011 Qian Zhang, King Ngi Ngan Department of Electronic Engineering, the Chinese university.
Multiple View Geometry : Computational Photography Alexei Efros, CMU, Fall 2006 © Martin Quinn …with a lot of slides stolen from Steve Seitz and.
Manhattan-world Stereo Y. Furukawa, B. Curless, S. M. Seitz, and R. Szeliski 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp.
Automatic User Interaction Correction via Multi-label Graph-cuts Antonio Hernández-Vela, Carlos Primo and Sergio Escalera Workshop on Human Interaction.
Computer Vision Spring ,-685 Instructor: S. Narasimhan WH 5409 T-R 10:30am – 11:50am Lecture #15.
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’04) /04 $20.00 c 2004 IEEE 1 Li Hong.
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Stereo Matching Information Permeability For Stereo Matching – Cevahir Cigla and A.Aydın Alatan – Signal Processing: Image Communication, 2013 Radiometric.
Autonomous Learning of Object Models on Mobile Robots Xiang Li Ph.D. student supervised by Dr. Mohan Sridharan Stochastic Estimation and Autonomous Robotics.
Structure from images. Calibration Review: Pinhole Camera.
Fast Approximate Energy Minimization via Graph Cuts
3D Fingertip and Palm Tracking in Depth Image Sequences
A Local Adaptive Approach for Dense Stereo Matching in Architectural Scene Reconstruction C. Stentoumis 1, L. Grammatikopoulos 2, I. Kalisperakis 2, E.
Tzu ming Su Advisor : S.J.Wang MOTION DETAIL PRESERVING OPTICAL FLOW ESTIMATION 2013/1/28 L. Xu, J. Jia, and Y. Matsushita. Motion detail preserving optical.
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.
Graph Cut Algorithms for Binocular Stereo with Occlusions
Graph Cut 韋弘 2010/2/22. Outline Background Graph cut Ford–Fulkerson algorithm Application Extended reading.
Takuya Matsuo, Norishige Fukushima and Yutaka Ishibashi
Object Stereo- Joint Stereo Matching and Object Segmentation Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on Michael Bleyer Vienna.
Stereo Many slides adapted from Steve Seitz.
Feature-Based Stereo Matching Using Graph Cuts Gorkem Saygili, Laurens van der Maaten, Emile A. Hendriks ASCI Conference 2011.
Kevin Cherry Robert Firth Manohar Karki. Accurate detection of moving objects within scenes with dynamic background, in scenarios where the camera is.
In Defense of Nearest-Neighbor Based Image Classification Oren Boiman The Weizmann Institute of Science Rehovot, ISRAEL Eli Shechtman Adobe Systems Inc.
Computer Vision, Robert Pless
A Region Based Stereo Matching Algorithm Using Cooperative Optimization Zeng-Fu Wang, Zhi-Gang Zheng University of Science and Technology of China Computer.
1 Markov Random Fields with Efficient Approximations Yuri Boykov, Olga Veksler, Ramin Zabih Computer Science Department CORNELL UNIVERSITY.
Computer Vision Stereo Vision. Bahadir K. Gunturk2 Pinhole Camera.
Histograms of Oriented Gradients for Human Detection(HOG)
Fast Census Transform-based Stereo Algorithm using SSE2
Lecture 16: Stereo CS4670 / 5670: Computer Vision Noah Snavely Single image stereogram, by Niklas EenNiklas Een.
Gaussian Mixture Models and Expectation-Maximization Algorithm.
Ning Sun, Hassan Mansour, Rabab Ward Proceedings of 2010 IEEE 17th International Conference on Image Processing September 26-29, 2010, Hong Kong HDR Image.
Non-Ideal Iris Segmentation Using Graph Cuts
Solving for Stereo Correspondence Many slides drawn from Lana Lazebnik, UIUC.
Improved Census Transforms for Resource-Optimized Stereo Vision
Vision-based SLAM Enhanced by Particle Swarm Optimization on the Euclidean Group Vision seminar : Dec Young Ki BAIK Computer Vision Lab.
Journal of Visual Communication and Image Representation
A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.
Photoconsistency constraint C2 q C1 p l = 2 l = 3 Depth labels If this 3D point is visible in both cameras, pixels p and q should have similar intensities.
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
CSE 185 Introduction to Computer Vision Stereo 2.
Local Stereo Matching Using Motion Cue and Modified Census in Video Disparity Estimation Zucheul Lee, Ramsin Khoshabeh, Jason Juang and Truong Q. Nguyen.
Stereo CS4670 / 5670: Computer Vision Noah Snavely Single image stereogram, by Niklas EenNiklas Een.
Markov Random Fields with Efficient Approximations
Nonparametric Semantic Segmentation
Automatic User Interaction Correction via Multi-label Graph-cuts
Computer Vision Stereo Vision.
Image and Video Processing
Presentation transcript:

Mutual Information-based Stereo Matching Combined with SIFT Descriptor in Log-chromaticity Color Space Yong Seok Heo, Kyoung Mu Lee, and Sang Uk Lee Department of EECS, ASRI, Seoul National University, 151-742, Seoul, Korea IEEE Conference on Computer Vision and Pattern Recognition, 2009.

Outline Introduction System Overview Mutual Information as a Stereo Correspondence Measure Proposed Algorithm Experiments Conclusion

Introduction

Introduction Radiometric variations (between two input images) Degrade the performance of stereo matching algorithms. Mutual Information : Powerful measure which can find any global relationship of intensities Erroneous as regards local radiometric variations

Introduction Different camera exposures (global) Different light configurations (local) Conventional MI Conventional MI

Objective + To present a new method: Based on mutual information combined with SIFT descriptor Superior to the state-of-the art algorithms (conventional mutual information-based) Mutual Information global radiometric variations (camera exposure) SIFT descriptor local radiometric variations (light configuration) +

System Overview

Proposed Alogorithm

Mutual Information (as a Stereo Correspondence Measure)

Energy Function Energy Function: In MAP-MRF framework f: disparity map

Mutual Information Used as a data cost: Measures the mutual dependence of the two random variables Left / Right Image Disparity Map

Mutual Information Entropy: Joint Entropy: P(i): marginal probability of intensity i P(iL,iR): joint probability of intensity iL and iR Entropy Entropy Joint Entropy 1 1 1

Mutual Information Suppose you are reporting the result of rolling a fair eight-sided die. What is the entropy? →The probability distribution is f (x) = 1/8, for x =1··8 , Therefore entropy is: = 8(1/8)log 8 = 3 bits

Mutual Information H( IL, IR ) H( IL | IR ) H( IR | IL ) MI( IL; IR ) Entropy Entropy Joint Entropy H( IL, IR ) H( IL | IR ) H( IR | IL ) MI( IL; IR ) H( IL ) H( IR )

Mutual Information Entropy: Joint Entropy: P(i): marginal probability of intensity i P(iL,iR): joint probability of intensity iL and iR Entropy Entropy Joint Entropy i1 i2 1 1 1

Pixel-wise Mutual Information Previous: Mutual Information of whole images Difficult to use it as a data cost in an energy minimization framework → Pixel-wise

Pixel-wise Mutual Information = P(.) / P(., .) : marginal / joint probability G(.) / G(., .) : 1D / 2D Gaussian function

Left Image Intensity Right Image Intensity

Conventional MI Do not encode spatial information Cannot handle the local radiometric variations caused by light configuration change Collect correspondences in the joint probability assuming that there is a global transformation The shape of the corresponding joint probability is very sparse. Do not encode spatial information

Conventional MI Different camera exposures (global) Different light configurations (local) Conventional MI Conventional MI

Proposed Algorithm

111

Log-chromaticity Color Space Transform the input color images to log- chromaticity color space [5] To deal with local as well as global radiometric variations Used to establish a linear relationship between color values of input images [5] Y. S. Heo, K.M. Lee, and S. U. Lee. Illumination and camera invariant stereo matching. In Proc. of CVPR, 2008

111

SIFT Descriptor Robust and accurately depicts local gradient information Computed for every pixel in the log-chromaticity color space

Energy Function ( ) Data Cost: Mutual Information: SIFT descriptor distance: constant ( ) Log-chromaticity intensity

111

Joint Probability Using SIFT Descriptor A joint probability is computed at each channel by use of the estimated disparity map from the previous iteration. Wrong disparity can induce an incorrect joint probability. Incorporate the spatial information in the joint probability computation step Adopt the SIFT descriptor

Joint Probability Using SIFT Descriptor K-channel SIFT-weighted joint probability:   : Euclidean distance VL,K(P) / VR,K(P) : SIFT descriptors for the pixel P l : SIFT descriptor size T = 1 If True T = 0 If false i1 i2

Joint Probability Using SIFT Descriptor A joint probability is computed at each channel Use estimated disparity map from the previous iteration. is governed by the constraint that corresponding pixels should have similar gradient structures.

111

Energy Function Data Cost: Smooth Cost: MI SIFT

Energy Minimization The total energy is minimized by the Graph-cuts expansion algorithm[3]. [3] Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. PAMI, 23(11):1222–1239, 2001.

Graph Cut e1=e2<e3=e4 G=(V,E) V={v1,v2,v3,v4} (set of all points),E={e1,e2,e3,e4} (set of all edges) e1=e2<e3=e4

Energy Minimization

Energy Minimization

Experiments

Experimental Results The std. dev σ of the Gaussian function is 10, τ = 30, l = 4*4*8 = 128 The window size of the SIFT descriptor : 9X9 λ = 0.1, μ = 1.1, VMAX=5 The total running time of our method for most images does not exceed 8 minutes. Aloe image (size : 427 X 370 / disparity range : 0-70) is about 6 minutes on a PC with PENTIUM-4 2.4GHz CPU.

MI vs. SIFT L: illum(1)-exp(1) / R: illum(3)-exp(1) MI SIFT MI + SIFT Error Rate 17.6% 11.97 % 9.27 % MI SIFT MI + SIFT Error Rate 26.45% 17.87 % 11.83 %

L: illum(1)-exp(1) / R: illum(3)-exp(1)

Different Exposure Left Image Right Image Ground Truth Proposed Rank/BT NCC ANCC MI

Different Light Source Configurations Left Image Right Image Ground Truth Proposed 111 Rank/BT NCC ANCC MI

Different Exposure Left Image Right Image Ground Truth Proposed 111 Rank/BT NCC ANCC MI

Different Light Source Configurations Left Image Right Image Ground Truth Proposed 111 Rank/BT NCC ANCC MI

Different Exposure Left Image Right Image Ground Truth Proposed 111 Rank/BT NCC ANCC MI

Different Light Source Configurations Left Image Right Image Ground Truth Proposed 111 Rank/BT NCC ANCC MI

Exposure Exposure Light Configuration Light Configuration

Exposure Exposure Light Configuration Light Configuration

Conclusion

Conclusion Propose a new stereo matching algorithm based on : mutual information (MI) combined with SIFT descriptor Quite robust and accurate to local as well as global radiometric variations