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.

Slides:



Advertisements
Similar presentations
Improved Census Transforms for Resource-Optimized Stereo Vision
Advertisements

Pose Estimation and Segmentation of People in 3D Movies Karteek Alahari, Guillaume Seguin, Josef Sivic, Ivan Laptev Inria, Ecole Normale Superieure ICCV.
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,
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.
M.S. Student, Hee-Jong Hong
Real-Time Accurate Stereo Matching using Modified Two-Pass Aggregation and Winner- Take-All Guided Dynamic Programming Xuefeng Chang, Zhong Zhou, Yingjie.
Does Color Really Help in Dense Stereo Matching?
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.
Mean Shift A Robust Approach to Feature Space Analysis Kalyan Sunkavalli 04/29/2008 ES251R.
Last Time Pinhole camera model, projection
Stereo Binocular Stereo Calibration (finish up) Next Time Motivation
The plan for today Camera matrix
Stereo Computation using Iterative Graph-Cuts
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 11, NOVEMBER 2011 Qian Zhang, King Ngi Ngan Department of Electronic Engineering, the Chinese university.
Introduction of the intrinsic image. Intrinsic Images The method of Finlayson & Hordley ( 2001 ) Two assumptions 1. the camera ’ s sensors are sufficiently.
Stereo Guest Lecture by Li Zhang
Project 1 artifact winners Project 2 questions Project 2 extra signup slots –Can take a second slot if you’d like Announcements.
Multiple View Geometry : Computational Photography Alexei Efros, CMU, Fall 2006 © Martin Quinn …with a lot of slides stolen from Steve Seitz and.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
Stereo matching Class 10 Read Chapter 7 Tsukuba dataset.
Manhattan-world Stereo Y. Furukawa, B. Curless, S. M. Seitz, and R. Szeliski 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp.
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.
Joint Histogram Based Cost Aggregation For Stereo Matching Dongbo Min, Member, IEEE, Jiangbo Lu, Member, IEEE, Minh N. Do, Senior Member, IEEE IEEE TRANSACTION.
Stereo Matching Information Permeability For Stereo Matching – Cevahir Cigla and A.Aydın Alatan – Signal Processing: Image Communication, 2013 Radiometric.
Structure from images. Calibration Review: Pinhole Camera.
Fast Approximate Energy Minimization via Graph Cuts
Mutual Information-based Stereo Matching Combined with SIFT Descriptor in Log-chromaticity Color Space Yong Seok Heo, Kyoung Mu Lee, and Sang Uk Lee.
Mean-shift and its application for object tracking
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
KinectFusion : Real-Time Dense Surface Mapping and Tracking IEEE International Symposium on Mixed and Augmented Reality 2011 Science and Technology Proceedings.
A General Framework for Tracking Multiple People from a Moving Camera
A Local Adaptive Approach for Dense Stereo Matching in Architectural Scene Reconstruction C. Stentoumis 1, L. Grammatikopoulos 2, I. Kalisperakis 2, E.
Graph Cut Algorithms for Binocular Stereo with Occlusions
Graph Cut 韋弘 2010/2/22. Outline Background Graph cut Ford–Fulkerson algorithm Application Extended reading.
City University of Hong Kong 18 th Intl. Conf. Pattern Recognition Self-Validated and Spatially Coherent Clustering with NS-MRF and Graph Cuts Wei Feng.
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
Takuya Matsuo, Norishige Fukushima and Yutaka Ishibashi
Y. Moses 11 Combining Photometric and Geometric Constraints Yael Moses IDC, Herzliya Joint work with Ilan Shimshoni and Michael Lindenbaum, the Technion.
Object Stereo- Joint Stereo Matching and Object Segmentation Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on Michael Bleyer Vienna.
A Non-local Cost Aggregation Method for Stereo Matching
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 34, NO. 2, FEBRUARY Leonardo De-Maeztu, Arantxa Villanueva, Member, IEEE, and.
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.
Stereo Many slides adapted from Steve Seitz. Binocular stereo Given a calibrated binocular stereo pair, fuse it to produce a depth image image 1image.
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.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
Fast Census Transform-based Stereo Algorithm using SSE2
Lecture 16: Stereo CS4670 / 5670: Computer Vision Noah Snavely Single image stereogram, by Niklas EenNiklas Een.
Ning Sun, Hassan Mansour, Rabab Ward Proceedings of 2010 IEEE 17th International Conference on Image Processing September 26-29, 2010, Hong Kong HDR Image.
Solving for Stereo Correspondence Many slides drawn from Lana Lazebnik, UIUC.
Improved Census Transforms for Resource-Optimized Stereo Vision
Journal of Visual Communication and Image Representation
Efficient Stereo Matching Based on a New Confidence Metric
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.
Course Introduction to Medical Imaging Segmentation 1 – Mean Shift and Graph-Cuts Guy Gilboa.
Stereo CS4670 / 5670: Computer Vision Noah Snavely Single image stereogram, by Niklas EenNiklas Een.
Summary of “Efficient Deep Learning for Stereo Matching”
Markov Random Fields with Efficient Approximations
Outline S. C. Zhu, X. Liu, and Y. Wu, “Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo”, IEEE Transactions On Pattern Analysis And Machine.
Presented by: Yang Yu Spatiotemporal GMM for Background Subtraction with Superpixel Hierarchy Mingliang Chen, Xing Wei, Qingxiong.
Computer Vision Stereo Vision.
Presentation transcript:

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 IEEE Transactions on Pattern Analysis and Machine Intelligence 2012

Overview Introduction Relate Work Algorithm Experimental Results

Introduction (1/3) image color values can be easily affected by radiometric variations including global intensity changes and local intensity changes (caused by varying light, vignetting and non-Lambertian surface) and noise. For stereo matching, most algorithms assume radiometrically calibrated images However, there exist many real and practical situations or challenging applications in which radiometric variations between stereo images are inevitable.

Introduction (2/3) For examples: 3D reconstruction of aerial images [1], general multiview stereo [4], 3D modeling with internet photos (e.g. Photo Tourism [5] and Photosynth [6] ), and PhotoModeler [7], etc.

In general, color consistency and stereo matching are a chicken-and-egg problem. Color consistency can enhance the performance of stereo matching, while accurate disparity maps can improve the color consistency or constancy. In this paper, new iterative framework that infers both accurate disparity maps and colorconsistent images for radiometrically varying stereo images are proposed. Introduction (3/3)

Relate Work Stereo Matching: – Census transform (7 × 7) [41] – Mutual Information (MI) [22] – Adaptive Normalized Cross Correlation (ANCC) [15] Color Consistency: – Color Histogram Equalized (CHE) [39]

Non-parametric Local Transforms for Computing Visual Correspondence [41] R. Zabih and J. Woodfill, in Proc. European Conference on Computer Vision, 1994.

Stereo Processing by Semiglobal Matching and Mutual Information [22] H. Hirschmuller, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 2, pp. 328–341, 2008.

Robust Stereo Matching Using Adaptive Normalized Cross-Correlation [15] The whole window information around matching pixels is used by the NCC in order to find the mean and standard deviation. Weight distribution information around matching pixels using the bilateral filter. Y. S. Heo, K. M. Lee, and S. U. Lee, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 33, no. 4, pp. 807–822, 2011.

Log-chromaticity Color Space [15](1/2) [15] Y. S. Heo, K. M. Lee, and S. U. Lee, “Robust stereo matching using adaptive normalized cross-correlation,” IEEE Trans. Pattern Analysis and Machine Intelligencea

Log-chromaticity Color Space (2/2)

SIFT

Joint probability density function (pdf) represents the statistical relationship between the left and right image color values. compute the joint pdf by means of the SIFT descriptors rather than pixel values to encode the spatial gradient information. Joint Probability Density Function (1/2)

Joint Probability Density Function (2/2)

Linear Function Estimation

Disparity Map Estimation (1/9) [34] Y. Boykov, O. Veksler, and R. Zabih, “Fast approximate energy minimization via graph cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222–1239, 2001.

Disparity Map Estimation (2/9)

Disparity Map Estimation (3/9)

[35] X. Hu and P. Mordohai, “Evaluation of stereo confidence indoors and outdoors,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition, Disparity Map Estimation (4/9)

Disparity Map Estimation (5/9)

[36] L. Hong and G. Chen, “Segment-based stereo matching using graph cuts,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition, [37] J. Sun, Y. Li, S. B. Kang, and H.-Y. Shum, “Symmetric stereo matching for occlusion handling,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition, [38] D. Comaniciu and P. Meer, “Mean shift: A robust approach toward feature space analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603–619, Disparity Map Estimation (6/9)

Disparity Map Estimation (7/9)

Disparity Map Estimation (8/9)

[34] Y. Boykov, O. Veksler, and R. Zabih, “Fast approximate energy minimization via graph cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222–1239, Disparity map estimation (9/9)

Fast approximate energy minimization via graph cuts [34] The minimum cut problem is to find the cut with smallest cost. There are numerous algorithms for this problem with low-order polynomial complexity. Using two move to refine that: swap and expansion. T. Gevers and H. Stokman, IEEE Trans. Pattern Analysis and Machine Intelligence, Jan

Occlusion Map Estimation [37] [37] J. Sun, Y. Li, S. B. Kang, and H.-Y. Shum, “Symmetric stereo matching for occlusion handling,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition, 2005.

Color Histogram Equalization (CHE)

Stereo Color Histogram Equalization (SCHE)

Boosting the Disparity Map Estimation Using SCHE Images The color consistency of the SCHE images is based on the accurate disparity map estimation. Conversely, the estimation of the disparity map can benefit from the color-consistent SCHE stereo images.

Experimental Results Using various test images with ground truth disparity map such as Aloe, Dolls, Moebius, Art, Laundry, Reindeer, Rocks1, and Cloth4 dataset in [40] that have different radiometric variations. Each data set has three different camera exposures (0~2) and three different configurations of the light source (1~3). The total running time of our method for Aloe images (size : 427 × 370, disparity range : 0-70), for example, is about 4 minutes on a PC with Intel(R) Core(TM) i7-2600K 4.5GHz CPU. “

Experimental for SCHE

Color consistency performance Computed the RMSE [39] images performed individually for the left and right original images. ‘CHE1’ means RMSE for the stereo images after individually performing CHE using original input stereo images. ‘CHE2’ means RMSE for the stereo images after individually performing CHE using stereo images in the log-chromaticity color space. [39] G. Finlayson, S. Hordley, G. Schaefer, and G. Y. Tian, “Illuminant and device invariant colour using histogram equalisation,” Pattern Recognition, vol. 38, no. 2, pp. 179–190, 2005.

Effects of SIFT Weight in MI Computation

Effects of Adaptive Weight

Stereo Matching Performance Comparison Census transform [41] Mutual Information (MI) [22] Normalized Cross Correlation (NCC) and Adaptive Normalized Cross Correlation (ANCC) [15]. To evaluate the effects of exposure changes, we only changed the index of exposure.

Stereo Matching Performance Comparison

Different Configurations of the Light Source Only changed the index of the light configuration while fixing the exposure.

Tests for Scenes With Different Cameras The left images were taken by Canon IXUS 870 IS, and the right images were taken by Sony Cyber-shot DSC-W570. The left images were taken with flash, while the right images were taken without flash. The exposure times of the left and right images were set 1/60 sec and 1/100 sec, respectively.