Patch Based Synthesis for Single Depth Image Super-Resolution (ECCV 2012) Oisin Mac Aodha, Neill Campbell, Arun Nair and Gabriel J. Brostow Presented By:

Slides:



Advertisements
Similar presentations
A Robust Super Resolution Method for Images of 3D Scenes Pablo L. Sala Department of Computer Science University of Toronto.
Advertisements

Image Processing IB Paper 8 – Part A Ognjen Arandjelović Ognjen Arandjelović
CSCE 643 Computer Vision: Template Matching, Image Pyramids and Denoising Jinxiang Chai.
Image Super-resolution via Sparse Representation
Image and Video Upscaling from Local Self Examples
Analysis of Contour Motions Ce Liu William T. Freeman Edward H. Adelson Computer Science and Artificial Intelligence Laboratory Massachusetts Institute.
KinectFusion: Real-Time Dense Surface Mapping and Tracking
Hongliang Li, Senior Member, IEEE, Linfeng Xu, Member, IEEE, and Guanghui Liu Face Hallucination via Similarity Constraints.
Patch-based Image Deconvolution via Joint Modeling of Sparse Priors Chao Jia and Brian L. Evans The University of Texas at Austin 12 Sep
Real-Time Accurate Stereo Matching using Modified Two-Pass Aggregation and Winner- Take-All Guided Dynamic Programming Xuefeng Chang, Zhong Zhou, Yingjie.
Robust Object Tracking via Sparsity-based Collaborative Model
IMAGE RESTORATION AND REALISM MILLIONS OF IMAGES SEMINAR YUVAL RADO.
Image Super-Resolution Using Sparse Representation By: Michael Elad Single Image Super-Resolution Using Sparse Representation Michael Elad The Computer.
Effective Image Database Search via Dimensionality Reduction Anders Bjorholm Dahl and Henrik Aanæs IEEE Computer Society Conference on Computer Vision.
Gaussian KD-Tree for Fast High-Dimensional Filtering A. Adams, N. Gelfand, J. Dolson, and M. Levoy, Stanford University, SIGGRAPH 2009.
Last Time Pinhole camera model, projection
Soft Edge Smoothness Prior for Alpha Channel Super Resolution Shengyang Dai 1, Mei Han 2, Wei Xu 2, Ying Wu 1, Yihong Gong 2 1.EECS Department, Northwestern.
3D Multi-view Reconstruction Young Min Kim Karen Zhu CS 223B March 17, 2008.
Robust Super-Resolution Presented By: Sina Farsiu.
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
Technion - Israel Institute of Technology 1 On Interpolation Methods using Statistical Models RONEN SHER Supervisor: MOSHE PORAT.
Stereo & Iterative Graph-Cuts Alex Rav-Acha Vision Course Hebrew University.
Learning Low-Level Vision William T. Freeman Egon C. Pasztor Owen T. Carmichael.
High-Quality Video View Interpolation
Stereo Computation using Iterative Graph-Cuts
100+ Times Faster Weighted Median Filter [cvpr ‘14]
A Trainable Graph Combination Scheme for Belief Propagation Kai Ju Liu New York University.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
Multi-modal robotic perception Stephen Gould, Paul Baumstarck, Morgan Quigley, Andrew Ng, Daphne Koller PAIL, January 2008.
Stereo matching Class 10 Read Chapter 7 Tsukuba dataset.
Automatic Estimation and Removal of Noise from a Single Image
Seminar presented by: Tomer Faktor Advanced Topics in Computer Vision (048921) 12/01/2012 SINGLE IMAGE SUPER RESOLUTION.
Super-Resolution of Remotely-Sensed Images Using a Learning-Based Approach Isabelle Bégin and Frank P. Ferrie Abstract Super-resolution addresses the problem.
Super-Resolution Barak Zackay Yaron Kassner. Outline Introduction to Super-Resolution Reconstruction Based Super Resolution –An Algorithm –Limits on Reconstruction.
My Research Experience Cheng Qian. Outline 3D Reconstruction Based on Range Images Color Engineering Thermal Image Restoration.
1 Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University, Australia Visual Perception.
A General Framework for Tracking Multiple People from a Moving Camera
A Non-local Cost Aggregation Method for Stereo Matching
Scientific Writing Abstract Writing. Why ? Most important part of the paper Number of Readers ! Make people read your work. Sell your work. Make your.
Lecture 26: Single-Image Super-Resolution CAP 5415.
Jointly Optimized Regressors for Image Super-resolution Dengxin Dai, Radu Timofte, and Luc Van Gool Computer Vision Lab, ETH Zurich 1.
Fast Direct Super-Resolution by Simple Functions
Feature-Based Stereo Matching Using Graph Cuts Gorkem Saygili, Laurens van der Maaten, Emile A. Hendriks ASCI Conference 2011.
Structured Face Hallucination Chih-Yuan Yang Sifei Liu Ming-Hsuan Yang Electrical Engineering and Computer Science 1.
Epitomic Location Recognition A generative approach for location recognition K. Ni, A. Kannan, A. Criminisi and J. Winn In proc. CVPR Anchorage,
The 18th Meeting on Image Recognition and Understanding 2015/7/29 Depth Image Enhancement Using Local Tangent Plane Approximations Kiyoshi MatsuoYoshimitsu.
Templates, Image Pyramids, and Filter Banks
2D Texture Synthesis Instructor: Yizhou Yu. Texture synthesis Goal: increase texture resolution yet keep local texture variation.
Image Decomposition, Inpainting, and Impulse Noise Removal by Sparse & Redundant Representations Michael Elad The Computer Science Department The Technion.
Supervisor: Nakhmani Arie Semester: Winter 2007 Target Recognition Harmatz Isca.
R I T Rochester Institute of Technology Geometric Scene Reconstruction Using 3-D Point Cloud Data Feng Li and Steve Lach Advanced Digital Image Processing.
Demosaicking for Multispectral Filter Array (MSFA)
Multi Scale CRF Based RGB-D Image Segmentation Using Inter Frames Potentials Taha Hamedani Robot Perception Lab Ferdowsi University of Mashhad The 2 nd.
Contextual models for object detection using boosted random fields by Antonio Torralba, Kevin P. Murphy and William T. Freeman.
SuperResolution (SR): “Classical” SR (model-based) Linear interpolation (with post-processing) Edge-directed interpolation (simple idea) Example-based.
Efficient Belief Propagation for Image Restoration Qi Zhao Mar.22,2006.
Speaker Min-Koo Kang March 26, 2013 Depth Enhancement Technique by Sensor Fusion: MRF-based approach.
Jianchao Yang, John Wright, Thomas Huang, Yi Ma CVPR 2008 Image Super-Resolution as Sparse Representation of Raw Image Patches.
SUPER RESOLUTION USING NEURAL NETS Hila Levi & Eran Amar Weizmann Ins
Fast edge-directed single-image super-resolution
Summary of “Efficient Deep Learning for Stereo Matching”
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
A Neural Approach to Blind Motion Deblurring
Markov Random Fields with Efficient Approximations
Depth Map Upsampling by Self-Guided Residual Interpolation
Real Time Dense 3D Reconstructions: KinectFusion (2011) and Fusion4D (2016) Eleanor Tursman.
Nonparametric Semantic Segmentation
Fast Preprocessing for Robust Face Sketch Synthesis
Iterative Optimization
Topological Signatures For Fast Mobility Analysis
Presentation transcript:

Patch Based Synthesis for Single Depth Image Super-Resolution (ECCV 2012) Oisin Mac Aodha, Neill Campbell, Arun Nair and Gabriel J. Brostow Presented By: Itzik Ben ShabatJanuary 2014

Contents  Problem & Motivation  SR General Overview  Related Work  The Proposed Method  Results  Qualitative  Quantitative  Future Work  Paper review

Problem & Motivation  How do we convert a Low Resolution (LR) image to High Resolution (HR) ?  Get a better camera (Sensor)

Problem & Motivation  Cant get a better camera? Super Resolve the image! (SR)

Problem & Motivation  Now do it in RGB-D ! ! ! PMD CamCube - 200X200 PointGrey BumbleBee x480 at 48fps MS Kinect - 640x480

SR General Overview Common approaches:  Take multiple LR images from different angles and reconstruct the additional information (requires multiple images)

SR General Overview Common approaches:  Use a LR to HR database (requires a database)  Focus on this approach

Related Work  Intensity Images  EbSR [15] - Freeman, W.T., Liu, C.: Example-based super resolution. In: Advances in Markov Random Fields for Vision and Image Processing. MIT Press (2011)  Similar:  Filter input  Normalized Patch matching  Solving minimum energy problem (using BP)  Different  Not Designed for RGB-D images  Matching HR and interpolated LR patches Create LR- HR database Perform bicubic interpolation on input image Desaturate and High- pass filtered Normalize contrast Solve patch minimum energy problem using BP Add back low frequency and color

Related Work  EbSR looking closer Ground trouth EbSR Output

 Intensity Images  ScSr [17] - Yang, J., Wright, J., Huang, T.S., Ma, Y.: Image super-resolution via sparse representation. IEEE Transactions on Image Processing (2010)  Similar:  Use patches and minimization problem  Different:  Not designed for RGB-D images  Two dictionaries  Database structure (sparse representation)  Solves 2 minimization problems separately – global and local  No noise reduction implementation Learn 2 dictionaries (LR- HR) For each input patch - Find LR representation Apply representation to HR pairs Solve global optimization problem Related Work

 Depth + Intensity Hybrids  Cross Bilateral [1] - Yang, Q., Yang, R., Davis, J., Nister, D.: Spatial-depth super resolution for range images. In: CVPR. (2007)  Similar:  Specific for RGB-D  Use bilateral filter  Different:  Requires additional input (destination resolution image)  Doesn’t use patches  Solves a fusion problem

Construct Multi- Resolution MRF grid Formulate optimization problem Bilinear filter for y initial guess Solve iteratively Related Work  Depth + Intensity Hybrids  MRF SR [25]- Diebel, J., Thrun, S.: An application of markov random fields to range sensing. In: NIPS. (2005)  Similar:  Uses MRF  Different:  Uses multi-resolution MRF  Requires additional input (destination resolution image)  Doesn’t use patches  Solves a fusion problem

The Proposed Method  Challenges  Construct database  Noise  “Flying pixels” at discontinuities  Wrong depths for specular or dark materials  Edges – jarring artifacts (different than rgb image)

The Proposed Method - Overview Construct Database Filter Input Generate Patches of input image Find Match Candidates Solve Minimum Energy Problem Reconstruct ImagePost Processing Filtering

The Proposed Method – Database  Constructing the database  Less sources for database construction than rgb images  Considered synthetic Vs. Real datasets  Database uses 30 scenes of 800x800 (scenes flipped left to right) – 5.3 million patches  Pruning to remove redundant patches (planar surfaces) SyntheticLaser Scan

The Proposed Method - Overview Construct Database Filter Input Generate Patches of input image Find Match Candidates Solve Minimum Energy Problem Reconstruct ImagePost Processing Filtering

The Proposed Method - Filtering  Noise Reduction  Assumption – High frequency=noise  A. Bilateral filter on input patches before patch normalization  Edge preserving  Noise reducing  Nonlinear  Weighted average of intensity values from nearby pixels  *Used in Adobe Photoshop “Blur” function  B. Bicubic filter on database HR patches before down-sampling

The Proposed Method - Filtering Input After Bilateral filtering

The Proposed Method - Filtering  Noise Reduction  Pro – Cleaner image for patching  Con – Some data is lost

The Proposed Method - Overview Construct Database Filter Input Generate Patches of input image Find Match Candidates Solve Minimum Energy Problem Reconstruct ImagePost Processing Filtering

The Proposed Method – Matching Input Depth Image

N non overlapping low resolution input patches x i For each x i we wish to find its corresponding high resolution y i Patches are normalized The Proposed Method – Matching Input Depth Image

The Proposed Method – Matching High Resolution Database

Output Depth Image The Proposed Method – Matching Input Depth Image High Resolution Database

Output Depth Image High Resolution Database The Proposed Method – Matching Input Depth Image

Output Depth Image High Resolution Database The Proposed Method – Matching

Output Depth Image … The Proposed Method – Matching Input Depth Image High Resolution Database

Output Depth Image High Resolution Database … The Proposed Method – Matching Input Depth Image

Output Depth Image … The Proposed Method – Matching Input Depth Image High Resolution Database

Output Depth Image … The Proposed Method – Matching Input Depth Image High Resolution Database

Output Depth Image … … The Proposed Method – Matching Input Depth Image High Resolution Database

The Proposed Method - Matching  Matching Patches to database  Matching is done between LR patches  Kd tree is used for speeding up the process

The Proposed Method - Overview Construct Database Filter Input Generate Patches of input image Find Match Candidates Solve Minimum Energy Problem Reconstruct ImagePost Processing Filtering

The Proposed Method - Reconstruction  Solving minimum energy problem  Solved using TRW-S algorithm (based on belief propagation)  E d -Unary Potential - Difference between normalized matching LR patches

The Proposed Method - Reconstruction  E s -Pairwise Potential - Difference between un-normalized HR patch overlaps

The Proposed Method - Reconstruction yiyi yjyj  E s - Pairwise Potential -

yiyi yjyj The Proposed Method - Reconstruction  E s - Pairwise Potential -

yiyi yjyj The Proposed Method - Reconstruction  E s - Pairwise Potential -

yiyi yjyj The Proposed Method - Reconstruction  E s - Pairwise Potential -

-- E s =( + ( )2)2 )2)2 yiyi yjyj The Proposed Method - Reconstruction

 Normalization – is un-normalized based on the input patch min and max values

The Proposed Method - Overview Construct Database Filter Input Generate Patches of input image Find Match Candidates Solve Minimum Energy Problem Reconstruct ImagePost Processing Filtering

The Proposed Method – Filter Results  Noise reduction  C. Post processing Denoising – Outlier detection and correction using threshold Result Result after denoising input

Results - Qualitative  Exp 1:  Used Middleburry stereo dataset  Down-sampled the ground truth (X2,X4)  Reconstructed  Compared RMSE  Exp 2:  3 laser scans  Upsampled by 4  Ground touth comparison  Exp 3:  Use synthetic Vs. real database

Results - Qualitative  Proposed method Vs. Other Methods (Exp. 2) Proposed Method

Results - Qualitative  Proposed method - Real Vs. Synthetic training data (Exp. 3)

Results - Quantitative  Reminder: MRF RS Cross BilateralScSREbSR Upsampling factor Method used RMSE RGB-D image used Method used RGB-D image used

Results - Qualitative Results Movie

Conclusions  1 st or 2 nd best from intensity based methods  MRF RS, Cross Bilateral are better but require more data  Speed is not realtime compatible  Super resolving moving depth videos  Synthetic data exhibit better results than scanned data for training.

Future work  Extend to exploit temporal context (in video)  Exploit context when querying the database  Develop a sensor specific noise model for better results

Paper review  Pros  Self contained  Well referenced  Novel approach  Available resources – website, data, code  Good experimental results  Cons  Non chronological order of subjects (training after method, implementation notes after results, etc.)  Supplied code insufficient

Questions?

References  Some of the slides and images were taken from the original paper presentation, paper and website 

Appendix - filters  Bicubic filter -  Interpolate data points on a two dimensional regular grid  Smoother  Fewer interpolation artifacts  Uses 16 pixels (4X4) Bicubic Bilinear Nearest neighbor