REU Project 4D Efficient Real-Time Graph Based Temporal Point Cloud Segmentation Steven Hickson.

Slides:



Advertisements
Similar presentations
Fast Algorithms For Hierarchical Range Histogram Constructions
Advertisements

Lecture 3 Nonparametric density estimation and classification
Different Tracking Techniques  1.Gaussian Mixture Model:  1.Construct the model of the Background.  2.Given sequence of background images find the.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
A New Block Based Motion Estimation with True Region Motion Field Jozef Huska & Peter Kulla EUROCON 2007 The International Conference on “Computer as a.
Video Table-of-Contents: Construction and Matching Master of Philosophy 3 rd Term Presentation - Presented by Ng Chung Wing.
Last Time Pinhole camera model, projection
Image Sequence Coding by Split and Merge Patrice Willemin, Todd R. Reed and Murat Kunt Presented by: Idan Shatz.
Hierarchical Region-Based Segmentation by Ratio-Contour Jun Wang April 28, 2004 Course Project of CSCE 790.
Efficient Moving Object Segmentation Algorithm Using Background Registration Technique Shao-Yi Chien, Shyh-Yih Ma, and Liang-Gee Chen, Fellow, IEEE Hsin-Hua.
Finding Aggregates from Streaming Data in Single Pass Medha Atre Course Project for CS631 (Autumn 2002) under Prof. Krithi Ramamritham (IITB).
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Detecting and Tracking Moving Objects for Video Surveillance Isaac Cohen and Gerard Medioni University of Southern California.
Semi-Supervised Learning Using Randomized Mincuts Avrim Blum, John Lafferty, Raja Reddy, Mugizi Rwebangira.
Distinctive Image Feature from Scale-Invariant KeyPoints
The plan for today Camera matrix
CSE 291 Final Project: Adaptive Multi-Spectral Differencing Andrew Cosand UCSD CVRR.
Automatic Camera Calibration for Image Sequences of a Football Match Flávio Szenberg (PUC-Rio) Paulo Cezar P. Carvalho (IMPA) Marcelo Gattass (PUC-Rio)
Dijkstra’s Algorithm Slide Courtesy: Uwash, UT 1.
1 Real Time, Online Detection of Abandoned Objects in Public Areas Proceedings of the 2006 IEEE International Conference on Robotics and Automation Authors.
Chapter 3: Cluster Analysis  3.1 Basic Concepts of Clustering  3.2 Partitioning Methods  3.3 Hierarchical Methods The Principle Agglomerative.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.
Module 04: Algorithms Topic 07: Instance-Based Learning
Distance Approximating Trees in Graphs
ICS 220 – Data Structures and Algorithms Week 7 Dr. Ken Cosh.
Introduction to Data Structures. Definition Data structure is representation of the logical relationship existing between individual elements of data.
M ULTIFRAME P OINT C ORRESPONDENCE By Naseem Mahajna & Muhammad Zoabi.
: Chapter 12: Image Compression 1 Montri Karnjanadecha ac.th/~montri Image Processing.
REU Project RGBD gesture recognition with the Microsoft Kinect Steven Hickson.
The Digital Image Dr. John Ryan.
An Efficient Approach to Clustering in Large Multimedia Databases with Noise Alexander Hinneburg and Daniel A. Keim.
REU Project 4D Efficient Real-Time Graph Based Temporal Point Cloud Segmentation Steven Hickson.
EXAMPLE 4 Solve a multi-step problem To construct what is known as a fractal tree, begin with a single segment (the trunk) that is 1 unit long, as in Step.
Data Analysis Sugar Content in Beverages. Step 1 – The Calibration Curve Page 2 of the procedure presents a table of “Percent Sugar” vs. “Density at 20°C.”
Recognizing Action at a Distance Alexei A. Efros, Alexander C. Berg, Greg Mori, Jitendra Malik Computer Science Division, UC Berkeley Presented by Pundik.
Memory Management during Run Generation in External Sorting – Larson & Graefe.
Motion Analysis using Optical flow CIS750 Presentation Student: Wan Wang Prof: Longin Jan Latecki Spring 2003 CIS Dept of Temple.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Epitomic Location Recognition A generative approach for location recognition K. Ni, A. Kannan, A. Criminisi and J. Winn In proc. CVPR Anchorage,
Virtual Light Field Group University College London Ray Tracing with the VLF (VLF-RT) Jesper Mortensen
MultiModality Registration Using Hilbert-Schmidt Estimators By: Srinivas Peddi Computer Integrated Surgery II April 6 th, 2001.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor : Dr. Hsu Graduate : Sheng-Hsuan Wang Author : Sanghamitra.
REU Project 4D Efficient Real-Time Graph Based Temporal Point Cloud Segmentation Steven Hickson.
Stereo Video 1. Temporally Consistent Disparity Maps from Uncalibrated Stereo Videos 2. Real-time Spatiotemporal Stereo Matching Using the Dual-Cross-Bilateral.
Ofir Luzon Supervisor: Prof. Michael Segal Longest Prefix Match For IP Lookup.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Real-Time Hierarchical Scene Segmentation and Classification Andre Uckermann, Christof Elbrechter, Robert Haschke and Helge Ritter John Grossmann.
Guidelines for building a bar graph in Excel and using it in a laboratory report IB Biology (December 2012)
Sorted Linked List Same objective as a linked list, but it should be sorted Sorting can be custom according to the type of nodes Offers speedups over non-sorted.
Vectors Vector vs Scalar Quantities and Examples
Range Image Segmentation for Modeling and Object Detection in Urban Scenes Cecilia Chen & Ioannis Stamos Computer Science Department Graduate Center, Hunter.
Tremor Detection Using Motion Filtering and SVM Bilge Soran, Jenq-Neng Hwang, Linda Shapiro, ICPR, /16/2018.
Discussion section #2 HW1 questions?
Globally Optimal Generalized Maximum Multi Clique Problem (GMMCP) using Python code for Pedestrian Object Tracking By Beni Mulyana.
Introduction Computer vision is the analysis of digital images
Amir Averbuch Yaki Tsaig School of Computer Science
A graphing calculator is required for some problems or parts of problems 2000.
Section 2.3 – Systems of Inequalities Graphing Calculator Required
Slide Courtesy: Uwash, UT
Section 9.4 – Systems of Inequalities Graphing Calculator Required
Slide Courtesy: Uwash, UT
Introduction Computer vision is the analysis of digital images
Quantizing Compression
Problem Image and Volume Segmentation:
Presentation transcript:

REU Project 4D Efficient Real-Time Graph Based Temporal Point Cloud Segmentation Steven Hickson

4D Segmentation Problems Noise causes grouping errors in the point clouds around the edges of data Solution: Error is somehow caused by the amount of Gaussian smoothing of the depth data. In order to fix this, the sigma value used to smooth is changed according to the number of frames included.

Volumetric Results

Cons Approximately 1 Frame/sec. Requires all of the data beforehand, ie good only for post processing. Limited length of video due to memory issues. Not as accurate as it could be 6 arbitrary values used to determine quality of segmentation

New Method New method is similar to a method Georgia Tech uses in their 2010 CVPR video segmentation paper. Do an over-segmentation of the spacio-temporal volume and then use regions and region graph- based merging for the segmentation. Instead of using volumes over time, use the new region segmentation to match the regions over time (past frame vs. current frame)

Region Trees A region tree is constructed by doing an over segmentation of the 3D volume. For each region of voxels, a branch is added onto the tree with pointers to all of the voxel data of the segmented cloud. While, the voxels are added, their LABD values are calculated (using Hunter LAB since it is faster). Each region stores the histogram of the LABD values, the 3D centroid, the 2D centroid, the area, it’s neighboring regions, and the regions beneath it or voxels beneath it. All of these values can be calculated while the tree is built and it allows the trees to become hierarchal.

Merging Region Trees Trees are merged over time using a method I call temporal correction. At fps, there is little movement between frames so the segmented regions should be similar. Therefore, the normal level of segmentation can be done and then the labels can be corrected using the region tree from the previous frame. The previous region tree and the current region tree are compared and the regions are matched based off the difference of the centroids, the difference of the size and the difference of the LABD histograms. This has been finished and results are good but can be improved.

Temporal Correction Results