Fast Multi Class Distance Transforms for Video Surveillance January 2008 Theo Schouten Egon van den Broek.

Slides:



Advertisements
Similar presentations
Wavelets Fast Multiresolution Image Querying Jacobs et.al. SIGGRAPH95.
Advertisements

MPEG4 Natural Video Coding Functionalities: –Coding of arbitrary shaped objects –Efficient compression of video and images over wide range of bit rates.
INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, ICT '09. TAREK OUNI WALID AYEDI MOHAMED ABID NATIONAL ENGINEERING SCHOOL OF SFAX New Low Complexity.
Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.
Whole-Program Linear-Constant Analysis with Applications to Link-Time Optimization Ludo Van Put – Dominique Chanet – Koen De Bosschere Ghent University.
Render Cache John Tran CS851 - Interactive Ray Tracing February 5, 2003.
3D Shape Histograms for Similarity Search and Classification in Spatial Databases. Mihael Ankerst,Gabi Kastenmuller, Hans-Peter-Kriegel,Thomas Seidl Univ.
Computer graphics & visualization Jens Schneider Martin Kraus Rüdiger Westermann.
2009/04/07 Yun-Yang Ma.  Overview  What is CUDA ◦ Architecture ◦ Programming Model ◦ Memory Model  H.264 Motion Estimation on CUDA ◦ Method ◦ Experimental.
2/7/2001Hofstra University – CSC290B1 Review: Math (Ch 4)
Binary Image Compression Using Efficient Partitioning into Rectangular Regions IEEE Transactions on Communications Sherif A.Mohamed and Moustafa M. Fahmy.
Background Estimation with Gaussian Distribution for Image Segmentation, a fast approach Gianluca Bailo, Massimo Bariani, Paivi Ijas, Marco Raggio IEEE.
M-HinTS: Mimicking Humans in Texture Sorting Egon L. van den Broek Eva M. van Rikxoort.
Video Surveillance using Distance Maps January 2006 Theo Schouten Harco Kuppens Egon van den Broek.
Chamfer Matching & Hausdorff Distance Presented by Ankur Datta Slides Courtesy Mark Bouts Arasanathan Thayananthan.
A neural approach to extract foreground from human movement images S.Conforto, M.Schmid, A.Neri, T.D’Alessio Compute Method and Programs in Biomedicine.
2007Theo Schouten1 Introduction. 2007Theo Schouten2 Human Eye Cones, Rods Reaction time: 0.1 sec (enough for transferring 100 nerve.
Three Dimensional Fast Exact Euclidean Distance (3D-FEED) Maps January 2006 Theo Schouten Harco Kuppens Egon van den Broek.
August 2004FEED1 Fast Exact Euclidean Distance (FEED) Transformation Theo Schouten Egon van den Broek Radboud University Nijmegen.
Gait Recognition Simon Smith Jamie Hutton Thomas Moore David Newman.
NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.
Timed Fast Exact Euclidean Distance (tFEED) Maps January 2005 Theo Schouten Harco Kuppens Egon van den Broek.
Roger Cheng (JPEG slides courtesy of Brian Bailey) Spring 2007
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Fast vector quantization image coding by mean value predictive algorithm Authors: Yung-Gi Wu, Kuo-Lun Fan Source: Journal of Electronic Imaging 13(2),
Yun CAO Xianfeng ZHAO Dengguo FENG Rennong SHENG Video Steganography with Perturbed Motion Estimation.
Tree-Based Density Clustering using Graphics Processors
COMP Bitmapped and Vector Graphics Pages Using Qwizdom.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 8 – JPEG Compression (Part 3) Klara Nahrstedt Spring 2012.
Image Compression Using Space-Filling Curves Michal Krátký, Tomáš Skopal, Václav Snášel Department of Computer Science, VŠB-Technical University of Ostrava.
1 Closest Pair of Points (from “Algorithm Design” by J.Kleinberg and E.Tardos) Closest pair. Given n points in the plane, find a pair with smallest Euclidean.
CS 4487/6587 Algorithms for Image Analysis
IIIT Hyderabad Scalable Clustering using Multiple GPUs K Wasif Mohiuddin P J Narayanan Center for Visual Information Technology International Institute.
Implementation II Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
SUPPLEMENTAL MATERIAL: Compression Experiments Factoring Repeated Content Within and Among Images (SIGGRAPH 2008 submission 0064)
Implementation II.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
AT91 Memory Interface. 2 Features –Up to 8 programmable chip select lines –Remap Command allows dynamic exception vectors –Glue-less for both 8-bit and.
Euripides G.M. PetrakisIR'2001 Oulu, Sept Indexing Images with Multiple Regions Euripides G.M. Petrakis Dept. of Electronic.
Isolating Objects From Image Stack Presented By: Md. Amjad Hossain and Raja Naresh.
FOR FURTHER INFORMATION REFERENCES 1.A.J.H. Mehnert & P.T. Jackway. “On Computing the Exact Euclidean Distance Transform on Rectangular and Hexagonal Grids”,
A Fast LBG Codebook Training Algorithm for Vector Quantization Presented by 蔡進義.
Computer Graphics I, Fall 2010 Implementation II.
Reporter :Chien-Wen Huang Date : Information Sciences, Vol. 176, No. 22, Nov. 2006, pp Received 29 December 2004; received in revised.
Tracking Groups of People for Video Surveillance Xinzhen(Elaine) Wang Advisor: Dr.Longin Latecki.
Dynamic Programming (DP), Shortest Paths (SP)
Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of.
Frank Bergschneider February 21, 2014 Presented to National Instruments.
How to identify complex events in the real world First part : Vision –Image segmentation –Checking for basic events : touching, intersecting, moving, pointing,
Implementing JPEG Encoder for FPGA ECE 734 PROJECT Deepak Agarwal.
Fast Subsequence Matching in Time-Series Databases.
Computer Graphics Implementation II
Adaptive Median Filter
Last update on June 15, 2010 Doug Young Suh
Steven Ge, Xinmin Tian, and Yen-Kuang Chen
Video-in-Video Insertion into a Pre-encoded Bit-stream
Simon Smith Jamie Hutton Thomas Moore David Newman
Content-Based Image Retrieval
Content-Based Image Retrieval
Implementation II Ed Angel Professor Emeritus of Computer Science
MPEG4 Natural Video Coding
Bin Ren, Gagan Agrawal, Brad Chamberlain, Steve Deitz
Parallelization of Sparse Coding & Dictionary Learning
Image Coding and Compression
Parallel build blocks.
Introduction to Computer Graphics with WebGL
Comparing Images Using Hausdorff Distance
Implementation II Ed Angel Professor Emeritus of Computer Science
Memory Management for Multimedia Signal Processing
Progress Report Alvaro Velasquez.
Presentation transcript:

Fast Multi Class Distance Transforms for Video Surveillance January 2008 Theo Schouten Egon van den Broek

Fast Multi Class DT for Video Distance Transformation distance map D(p) = min { dist(p,q), q  O }

Fast Multi Class DT for Video Multi Class DT class map C(p) = C(q), q  O, dist(p,q) == D(p)

Fast Multi Class DT for Video Used original distance transformation CH11: city-block DT of Rosenfeld and Pfaltz CH34: chamfer 3,4 of Borgefors EDT4: 4-scan semi-exact EDT of Shih and Liu EDT2: 2-scan semi-exact EDT of Shih and Wu EDLT: EDT method of Maurer, Qi and Raghavan –based on dimension reduction –proces first rows then columns –partial Voronoi diagram for each row, column FEED: or own EDT

Fast Multi Class DT for Video Fast Exact Euclidean Distance (FEED) each q  O feeds its ED to all p: D(p) = min ( D(p), ED(q,p)) border pixels bisection lines precalculate ED Faster than EDLT, EDT4, EDT2 More implementation effort more lines of code parameters and strategies

Fast Multi Class DT for Video Multi class extension scan methods (CH11, CH34, EDT4, EDT2): –compare d(p) with d’s of neighbours –add compare c(p) with c’s of neighbours EDLT: –add extra vector to contain class of Voronoi points –used to set class of filled-in points on row, column FEED: –change update step D(p) = min ( D(p), ED(q,p)) –if( ED(q,p) < D(p) ) D(p) = ED(q,p), C(p)=C(q)

Fast Multi Class DT for Video Timing Multi Class DT time in  s/pixel P-4 3 GHz 1024 MB 12 KuOps, 16KB; 2048 KB P-M 1.6 GHZ 512 MB 32 KB, 32 KB ; 2048 KB image size 640 x x x x x x 1920 FEED EDLT EDT CH

Fast Multi Class DT for Video Video frames D fixed+mov (p) = if( D fixed (p) < D mov (p) ) then D fixed+mov (p) = D fixed (p), C fixed+mov (p) = C fixed (p) else D fixed+mov (p) = D mov (p), C fixed+mov (p) = C mov (p)

Fast Multi Class DT for Video Fast moving part calculation fast location moving object –sequence of refining scans over the image –using RLE encoding of fixed objects use d max = max ( D fixed (p) ) to calculate D (C ) mov –only over part of the frame –bounding box of moving object extended by d max combining fixed and moving D (C ) only for part same memory locations for D fixed and D fixed+mov

Fast Multi Class DT for Video Extra speed-up for FEED merge the application of FEED on the moving object –with combining fixed and moving D (C ): –replace initialization D(p)= if( p  O ) 0 else  –by D(p) = D fixed (p) not possible for other methods –only partial evaluations of D during scans further the RLE encoding is used to speed-up FEED

Fast Multi Class DT for Video Timing video Multi Class DT time in  s/pixel P-4 3 GHz 1024 MB 12 KuOps, 16KB; 2048 KB P-M 1.6 GHZ 512 MB 32 KB, 32 KB ; 2048 KB 640 x fixed fullfixedvideofullfixedvideo FEED EDLT EDT CH

Fast Multi Class DT for Video Timing video MCDT time in  s/pixel P-4 3 GHz 1024 MB 12 KuOps, 16KB; 2048 KB P-M 1.6 GHZ 512 MB 32 KB, 32 KB ; 2048 KB 640 x fixed fullfixedvideofullfixedvideo FEED EDLT EDT CH

Fast Multi Class DT for Video Examples

Fast Multi Class DT for Video Conclusion extended several DT’s to –handle images with multi class objects –and to faster processing of video frames with fixed and one moving multi class objects extension methods applicable to all scans based DT’s our Fast Exact Euclidean Distance transformation –is faster (6-10) than other MC (semi-)exact EDT’s –on video frames even faster than city-block more implementation effort –tune to cache-systems, image characteristics