Improved Census Transforms for Resource-Optimized Stereo Vision

Slides:



Advertisements
Similar presentations
Wen-Hsiao Peng Chun-Chi Chen
Advertisements

Improved Census Transforms for Resource-Optimized Stereo Vision
Cuong Cao Pham and Jae Wook Jeon, Member, IEEE
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.
Stereo Matching Segment-based Belief Propagation Iolanthe II racing in Waitemata Harbour.
Does Color Really Help in Dense Stereo Matching?
Texture Segmentation Based on Voting of Blocks, Bayesian Flooding and Region Merging C. Panagiotakis (1), I. Grinias (2) and G. Tziritas (3)
H.264/AVC Baseline Profile Decoder Complexity Analysis Michael Horowitz, Anthony Joch, Faouzi Kossentini, and Antti Hallapuro IEEE TRANSACTIONS ON CIRCUITS.
CABAC Based Bit Estimation for Fast H.264 RD Optimization Decision
Boundary matting for view synthesis Samuel W. Hasinoff Sing Bing Kang Richard Szeliski Computer Vision and Image Understanding 103 (2006) 22–32.
Computing motion between images
Stereopsis Mark Twain at Pool Table", no date, UCR Museum of Photography.
Virtual Control of Optical Axis of the 3DTV Camera for Reducing Visual Fatigue in Stereoscopic 3DTV Presenter: Yi Shi & Saul Rodriguez March 26, 2008.
1 A Unified Rate-Distortion Analysis Framework for Transform Coding Student : Ho-Chang Wu Student : Ho-Chang Wu Advisor : Prof. David W. Lin Advisor :
1 An Efficient Mode Decision Algorithm for H.264/AVC Encoding Optimization IEEE TRANSACTION ON MULTIMEDIA Hanli Wang, Student Member, IEEE, Sam Kwong,
A Performance and Energy Comparison of FPGAs, GPUs, and Multicores for Sliding-Window Applications From J. Fowers, G. Brown, P. Cooke, and G. Stitt, University.
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 11, NOVEMBER 2011 Qian Zhang, King Ngi Ngan Department of Electronic Engineering, the Chinese university.
A Low-Power VLSI Architecture for Full-Search Block-Matching Motion Estimation Viet L. Do and Kenneth Y. Yun IEEE Transactions on Circuits and Systems.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
Stereo matching “Stereo matching” is the correspondence problem –For a point in Image #1, where is the corresponding point in Image #2? C1C1 C2C2 ? ? C1C1.
Computer Vision Spring ,-685 Instructor: S. Narasimhan WH 5409 T-R 10:30am – 11:50am Lecture #15.
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 Low-Textured Survey 1.Stereo Matching-Based Low-Textured Scene Reconstruction for Autonomous Land Vehicles (ALV) Navigation 2.A Robust.
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.
A Local Adaptive Approach for Dense Stereo Matching in Architectural Scene Reconstruction C. Stentoumis 1, L. Grammatikopoulos 2, I. Kalisperakis 2, E.
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.
IMAGE COMPRESSION USING BTC Presented By: Akash Agrawal Guided By: Prof.R.Welekar.
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
Cross-Based Local Multipoint Filtering
A Non-local Cost Aggregation Method for Stereo Matching
1 Security and Robustness Enhancement for Image Data Hiding Authors: Ning Liu, Palak Amin, and K. P. Subbalakshmi, Senior Member, IEEE IEEE TRANSACTIONS.
1 Optimal Resource Placement in Structured Peer-to-Peer Networks Authors: W. Rao, L. Chen, A.W.-C. Fu, G. Wang Source: IEEE Transactions on Parallel and.
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.
Low-Power H.264 Video Compression Architecture for Mobile Communication Student: Tai-Jung Huang Advisor: Jar-Ferr Yang Teacher: Jenn-Jier Lien.
Feature-Based Stereo Matching Using Graph Cuts Gorkem Saygili, Laurens van der Maaten, Emile A. Hendriks ASCI Conference 2011.
Area: VLSI Signal Processing.
A Region Based Stereo Matching Algorithm Using Cooperative Optimization Zeng-Fu Wang, Zhi-Gang Zheng University of Science and Technology of China Computer.
Window-based Approach For Fast Stereo Correspondence Raj Kumar Gupta, Siu-Yeung Cho IET Computer Vision,
Conclusions The success rate of proposed method is higher than that of traditional MI MI based on GVFI is robust to noise GVFI based on f1 performs better.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
An Efficient Linear Time Triple Patterning Solver Haitong Tian Hongbo Zhang Zigang Xiao Martin D.F. Wong ASP-DAC’15.
Image Compression Based On BTC-DPCM And It ’ s Data-Driven Parallel Implementation Author : Xiaoyan Yu 、 Iwata, M. Source : Image Processing, ICIP.
Fast Census Transform-based Stereo Algorithm using SSE2
Jason Li Jeremy Fowers 1. Speedups and Energy Reductions From Mapping DSP Applications on an Embedded Reconfigurable System Michalis D. Galanis, Gregory.
Lecture 16: Stereo CS4670 / 5670: Computer Vision Noah Snavely Single image stereogram, by Niklas EenNiklas Een.
IEEE Transactions on Consumer Electronics, Vol. 58, No. 2, May 2012 Kyungmin Lim, Seongwan Kim, Jaeho Lee, Daehyun Pak and Sangyoun Lee, Member, IEEE 報告者:劉冠宇.
Digital Image Processing
Efficient Stereo Matching Based on a New Confidence Metric
Vehicle Detection in Aerial Surveillance Using Dynamic Bayesian Networks Hsu-Yung Cheng, Member, IEEE, Chih-Chia Weng, and Yi-Ying Chen IEEE TRANSACTIONS.
A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.
1 Marco Carli VPQM /01/2007 ON BETWEEN-COEFFICIENT CONTRAST MASKING OF DCT BASIS FUNCTIONS Nikolay Ponomarenko (*), Flavia Silvestri(**), Karen.
Normalized Cuts and Image Segmentation Patrick Denis COSC 6121 York University Jianbo Shi and Jitendra Malik.
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
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.
An Implementation Method of the Box Filter on FPGA
Image camouflage by reversible image transformation
SoC and FPGA Oriented High-quality Stereo Vision System
A new data transfer method via signal-rich-art code images captured by mobile devices Source: IEEE Transactions on Circuits and Systems for Video Technology,
Fast Decision of Block size, Prediction Mode and Intra Block for H
Wavelet in POCS for image segment
Reduction of blocking artifacts in DCT-coded images
Source: IEEE Transactions on Circuits and Systems,
Dynamic improved pixel value ordering reversible data hiding
Presentation transcript:

Improved Census Transforms for Resource-Optimized Stereo Vision Speaker : Kai-Wen, Weng Author: Wade S. Fife, James K. Archibald Good afternoon, ladies and gentlemen. I’m Kai-Wen, Weng. Today, I’m going to give a talk on the Improved Census Transforms for Resource-Optimized Stereo Vision. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 23, NO. 1, JANUARY 2013

Outline Introduction Proposed Algorithm Experimental Results Sparse Census Transform Generalized Census Transform Experimental Results Conclusion First. I'll introduce the census transform of this paper. Next I’ll explain proposed algorithm on this paper At last, I’d like to highlight some of the experimental results and conclusions from this study. //// Next I’ll go on to outline the related work in this study.

Introduction

Introduction Computation costs algorithm: SAD (Sum of Absolute Differences) SSD (Sum of Squared Differences) NCC (Normalized Cross Correlation) CT (Census Transform) Reference Target Disparity

Introduction Census Transform : Color Gradient

Introduction After aggregation step: Census on colors Census on gradients

Introduction Sparse census[6] : Half of the bits The computation costs for the hamming distances are quite large. X [6] C. Zinner, M. Humenberger, K. Ambrosch, and W. Kubinger, “An optimized software-based implementation of a census-based stereo matching algorithm,” in Proc. 4th ISVC, 2008, pp. 216–227.

Introduction Mini-census[8] : X [8] N.-C. Chang, T.-H. Tsai, B.-H. Hsu, Y.-C. Chen, and T.-S. Chang,“Algorithm and architecture of disparity estimation with mini-census adaptive support weight,” IEEE Trans. Circuits Syst. Video Technol., vol. 20, no. 6, pp. 792–805, Jun. 2010.

Introduction Mini-census[8] : Mini-census adaptive support weight [8] N.-C. Chang, T.-H. Tsai, B.-H. Hsu, Y.-C. Chen, and T.-S. Chang,“Algorithm and architecture of disparity estimation with mini-census adaptive support weight,” IEEE Trans. Circuits Syst. Video Technol., vol. 20, no. 6, pp. 792–805, Jun. 2010.

Introduction The challenges: It is critical to… The enormous amount of computation required to identify the corresponding points in the images. It is critical to… maximize the accuracy and throughput of the stereo system while minimizing the resource requirements

Proposed Algorithm

Transform Point Selection Goal : minimize the size of the census transform vector Challenge: Must quantify how much each point in the transform window contributes to overall correlation accuracy Test correlation accuracy: Define a sparse census transform consisting of a single point (| 𝑵 | = 1) Determine how consistently this point leads to correct correlation 13 × 13 correlation window (aggregation)

Tsukuba Venus Teddy Cones

Transform Point Selection Go Tsukuba Venus Average Bright: Higher correlation accuracy 25 × 25 neighborhood Teddy Cones

Proposed Sparse Census Transform Very good correlation accuracy can be achieved using very sparse transforms. 16-point 12-point 8-point 4-point 2-point 1-point

Experimental Results

Generalized Census Transform Goal : greater freedom in choosing the census transform design Definition : redrawing the transform as a graph 3 × 3 correlation (aggregation) 3 × 3 census

Generalized Census Transform As.. (1)transform neighborhoods become more and more sparse (2)fewer pixels are used in the correlation process selection of points to include in the transform becomes more critical 如..(1)轉換的鄰點變得越來越稀疏(2)較少的像素中的相關處理中使用 選點在變換變得更重要,以包括 Horizontal + Vertical 2-edge 2-point

Generalized Census Transform symmetric

Proposed Generalized Census Transform Benefits : Often require a smaller census transform window (memory) Increased robustness under varying conditions (noise) 16-edge 12-edge 8-edge 4-edge 2-edge 1-edge

Experimental Results

Experimental Results

Experimental Results

Left Image Ground Truth Full 7x7 census 12-edge 4-edge

Left Image Ground Truth Full 7x7 census 12-edge 4-edge

Left Image Full 7x7 census 12-edge 4-edge

Experimental Results 𝟖𝟖%↓ 𝟔𝟏%↓ LUTs (look-up tables) : the amount of logic required to implement the method FFs : the number of 1-bit registers (the amount of pipelining used) RAMs : the number of 18-kbit block memories Freq. : the maximum operating frequency reported by synthesis

Conclusion

Conclusion Proposed and analyzed in this paper: A range of sparse census transforms reduce hardware resource requirements attempting to maximize correlation accuracy. often better than or nearly as good as the full census Generalized census transforms increased robustness in the presence of image noise 提出並在此進行了分析: 稀疏CT的範圍 減少硬體資源要求 試圖最大限度的相關精度。 比Full CT 轉換來的好 一般化的CT 在圖像noise的情況下提高了穩定性,

Q&A