Target Tracking a Non-Linear Target Path Using Kalman Predictive Algorithm by James Dennis Musick.

Slides:



Advertisements
Similar presentations
Motivating Markov Chain Monte Carlo for Multiple Target Tracking
Advertisements

Linked Lists Linked Lists Representation Traversing a Linked List
Autonomous Tracking Unit John Berglund Randy Cuaycong Wesley Day Andrew Fikes Kamran Shah Professor: Dr. Rabi Mahapatra CPSC Spring 1999 Autonomous.
EC-211 DATA STRUCTURES LECTURE 2. EXISTING DATA STRUCTURES IN C/C++ ARRAYS – A 1-D array is a finite, ordered set of homogeneous elements – E.g. int a[100]
An On-Chip IP Address Lookup Algorithm Author: Xuehong Sun and Yiqiang Q. Zhao Publisher: IEEE TRANSACTIONS ON COMPUTERS, 2005 Presenter: Yu Hao, Tseng.
Learning Techniques for Video Shot Detection Under the guidance of Prof. Sharat Chandran by M. Nithya.
System Design Tricks for Low-Power Video Processing Jonah Probell, Director of Multimedia Solutions, ARC International.
Introduction To Tracking
מערכות לבדיקת איכות חקלאיות: מערכת למיון פרחים מערכת לזיהוי ירקות הטכניון - מכון טכנולוגי לישראל : הפקולטה להנדסת חשמל - המעבדה לבקרה ורובוטיקה מגישים:
Project Proposal Coffee delivery mission Oct, 3, 2007 NSH 3211 Hyun Soo Park, Iacopo Gentilini Robotic Motion Planning Potential Field Techniques.
Bitmap Index Buddhika Madduma 22/03/2010 Web and Document Databases - ACS-7102.
Adam Rachmielowski 615 Project: Real-time monocular vision-based SLAM.
Tracking Migratory Birds Around Large Structures Presented by: Arik Brooks and Nicholas Patrick Advisors: Dr. Huggins, Dr. Schertz, and Dr. Stewart Senior.
Active Simultaneous Localization and Mapping Stephen Tully, : Robotic Motion Planning This project is to actively control the.
SLAM: Simultaneous Localization and Mapping: Part I Chang Young Kim These slides are based on: Probabilistic Robotics, S. Thrun, W. Burgard, D. Fox, MIT.
MOVING OBJECTS SEGMENTATION AND ITS APPLICATIONS.
Target Tracking a Non-Linear Target Path Using Kalman Predictive Algorithm and Maximum Likelihood Estimation by James Dennis Musick.
Tracking using the Kalman Filter. Point Tracking Estimate the location of a given point along a sequence of images. (x 0,y 0 ) (x n,y n )
03/24/2004CSCI 315 Operating Systems Design1 Memory Management and Virtual Memory (Problem session)
Hand Movement Recognition By: Tokman Niv Levenbroun Guy Instructor: Todtfeld Ari.
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Jason Li Jeremy Fowers Ground Target Following for Unmanned Aerial Vehicles.
ICBV Course Final Project Arik Krol Aviad Pinkovezky.
Kalman Tracking for Image Processing Applications Student : Julius Oyeleke Supervisor : Dr Martin Glavin Co-Supervisor : Dr Fearghal Morgan.
Kalman filter and SLAM problem
Abstract Some Examples The Eye tracker project is a research initiative to enable people, who are suffering from Amyotrophic Lateral Sclerosis (ALS), to.
Particle Filter & Search
Disk Structure Disk drives are addressed as large one- dimensional arrays of logical blocks, where the logical block is the smallest unit of transfer.
Optical Tracking for VR Bertus Labuschagne Christopher Parker Russell Joffe.
Brian Renzenbrink Jeff Robble Object Tracking Using the Extended Kalman Particle Filter.
1. Introduction Motion Segmentation The Affine Motion Model Contour Extraction & Shape Estimation Recursive Shape Estimation & Motion Estimation Occlusion.
3D SLAM for Omni-directional Camera
CE Operating Systems Lecture 20 Disk I/O. Overview of lecture In this lecture we will look at: Disk Structure Disk Scheduling Disk Management Swap-Space.
CSC 196k Semester Project: Instance Based Learning
Computer Architecture Lecture 26 Fasih ur Rehman.
Image Editing II. Simple Blending =.7 x+.5 x Each pixel in a layer is multiplied by the same opacity value.
Action and Gait Recognition From Recovered 3-D Human Joints IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS— PART B: CYBERNETICS, VOL. 40, NO. 4, AUGUST.
Clustering Sequential Data: Research Paper Review Presented by Glynis Hawley April 28, 2003 On the Optimal Clustering of Sequential Data by Cheng-Ru Lin.
Copyright Howie Choset, Renata Melamud, Al Costa, Vincent Lee-Shue, Sean Piper, Ryan de Jonckheere. All Rights Reserved Computer Vision.
REC Georgia Tech University Savannah Feb Reduction in Space Complexity And Error Detection/Correction of a Fuzzy controller F. Vainstein Georgia.
Spatiotemporal Saliency Map of a Video Sequence in FPGA hardware David Boland Acknowledgements: Professor Peter Cheung Mr Yang Liu.
11 Intro to cache memory Kosarev Nikolay MIPT Nov, 2009.
Zack Nemes By: Clemence Larroche. To track and follow a car as it travels along a path.
Static Identification of Delinquent Loads V.M. Panait A. Sasturkar W.-F. Fong.
State Estimation and Kalman Filtering Zeeshan Ali Sayyed.
Intelligent Robotics Today: Vision & Time & Space Complexity.
Robust Localization Kalman Filter & LADAR Scans
Fast VLSI Implementation of Sorting Algorithm for Standard Median Filters Hyeong-Seok Yu SungKyunKwan Univ. Dept. of ECE, Vada Lab.
Lecture 11 Text mode video
Hierarchical Systolic Array Design for Full-Search Block Matching Motion Estimation Noam Gur Arie,August 2005.
infinity-project.org Engineering education for today’s classroom Outline Images Then and Now Digitizing Images Design Choices in Digital Images Better.
Particle filters for Robot Localization An implementation of Bayes Filtering Markov Localization.
Pipelining: Implementation CPSC 252 Computer Organization Ellen Walker, Hiram College.
Zhaoxia Fu, Yan Han Measurement Volume 45, Issue 4, May 2012, Pages 650–655 Reporter: Jing-Siang, Chen.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
Main Memory: Paging and Segmentation CSSE 332 Operating Systems Rose-Hulman Institute of Technology.
Instantaneous Geo-location of Multiple Targets from Monocular Airborne Video.
V4 – Video Tracker for Extremely Hard Night Conditions
Paper – Stephen Se, David Lowe, Jim Little
Contents Team introduction Project Introduction Applicability
Last update on June 15, 2010 Doug Young Suh
Probabilistic Robotics
Lecture 22 Chapter 9 Sets.
FIGURE 12-1 Memory Hierarchy
Representing Images 2.6 – Data Representation.
Dongkeun Oh Sanghamitra Roy
Particle filters for Robot Localization
Lecture 17 Kalman Filter.
Computer and Robot Vision I
Indexing, Access and Database System Architecture
Presentation transcript:

Target Tracking a Non-Linear Target Path Using Kalman Predictive Algorithm by James Dennis Musick

Agenda Introduction Problem Definition Centroid Algorithm Kalman Filter Target Discrimination Conclusion Future Work

Introduction In the field of biomechanical research there is a subcategory that studies human movement or activity by video-based analysis Markers used –Optical –RF –Passive reflective –Etc… Video based motion analysis 2D Analysis 3D analysis Golf swing example

Problem Definition In order to track the following have to be accomplished –Centroid calculation –Prediction –Discrimination

Problem Definition cont. Trials used –Walking Trial –Jumping Trial –Waving Wand Trial –Increasing complexity

Centroid Algorithm Introduction Scanning scheme

Centroid Algorithm cont. 640 x 480 –~ pixels 8-bit Gray-scale Block diagram ThresholdX/Y address location Target Discrimination Buffer Logic control and centroid calculation Centroid Value Memory

Centroid Algorithm cont. Threshold

Centroid Algorithm cont. x/y addressing

Centroid Algorithm cont. Target Pixel Discrimination Buffer –x_sum, y_sum, LS_target, RS_target, Bot_target, target_pixel_num

Centroid Algorithm cont. Logic Control and Centroid Calculation

Centroid Algorithm cont. Centroid Memory Buffer –Once a target is completed (defined as no pixels within the search criteria at the row just below the target), then the centroid data is stored in a memory array until the data is read out at the end of the number of pictures that are being analyzed. –The array would be structured in the following manner if there were three targets in each of 5 pictures: Target_Centroid_Array = (xy,Target #, Picture #) => (1:2, 1:3, 1:5).

Centroid Algorithm cont. Examples

Centroid Algorithm cont. Performance and Limitations –Three targets simultaneous –Total number

Centroid Algorithm cont. Measurement Uncertainty Correct (3.5,4)Correct (3.5,3) Blue missing (3.5,4)Red missing (3.8,3.17) Red missing (3.64, 4.21)

Kalman Filter Introduction –State Space representation

Kalman Filter cont.

Kalman Filter cont

Target Models: –Noisy Acceleration model

Kalman Filter cont Target Models: –Noisy Jerk model

Kalman Filter cont Selection of update time: T = 1

Kalman Filter cont b

Operation of the Kalman Filter

Kalman Filter cont Operation of the Kalman Filter

Kalman Filter cont Operation of the Kalman Filter

Kalman Filter cont Operation of the Kalman Filter

Kalman Filter cont Operation of the Kalman Filter

Kalman Filter cont Operation of the Kalman Filter

Target Discrimination Introduction –Goal

Target Discrimination Example

Target Discrimination Example cont

Target Discrimination Operation of algorithm

Target Discrimination Operation of algorithm cont

Target Discrimination Operation of algorithm cont Jumping Trial

Target Discrimination Operation of algorithm cont

Target Discrimination Occluded targets

Conclusion Centroid algorithm Kalman filter –Model Discrimination

Future Work Hardware implementation 3D application Other biomechanical target discrimination (segmentation, etc.) Other tracking application (space, robotics, etc.)