Timed Fast Exact Euclidean Distance (tFEED) Maps January 2005 Theo Schouten Harco Kuppens Egon van den Broek.

Slides:



Advertisements
Similar presentations
When you see… Find the zeros You think…. To find the zeros...
Advertisements

Lecture 5 Rendering lines 1.Steps of line rendering 2.Scan-conversion for line segments 3.A1 tutorial CP411 Computer Graphics Fall 2007 Wilfrid Laurier.
Computer Graphics Tz-Huan Huang National Taiwan University (Slides are based on Prof. Chen’s)
MP3 Optimization Exploiting Processor Architecture and Using Better Algorithms Mancia Anguita Universidad de Granada J. Manuel Martinez – Lechado Vitelcom.
CS 352: Computer Graphics Chapter 7: The Rendering Pipeline.
Approximations of points and polygonal chains
Sorce: Suggestive Contours for Conveying Shape. (SIGGRAPH 2003) Doug DeCarlo, Adam Finkelstein, Szymon Rusinkiewicz, Anthony Santella. 1 Suggestive Contours.
Render Cache John Tran CS851 - Interactive Ray Tracing February 5, 2003.
Designing Facial Animation For Speaking Persian Language Hadi Rahimzadeh June 2005.
1.  Texturing is a core process for modeling surface details in computer graphics applications › Texture mapping › Surface texture synthesis › Procedural.
University of Houston Clear Lake Computer Applications UHCL Conference 2D & 3D Image Compression with Skeletonization Dr. Liwen Shih Sam Tran.
Computer graphics & visualization Jens Schneider Martin Kraus Rüdiger Westermann.
Delaunay Triangulation on the GPU Dan Maljovec. CPU Delaunay Triangulation Randomized Incremental Algorithm 1.Construct Bounding triangle 2.Choose point.
Hokkaido University Efficient Rendering of Lightning Taking into Account Scattering Effects due to Clouds and Atmospheric Particles Tsuyoshi Yamamoto Tomoyuki.
Binary Image Compression Using Efficient Partitioning into Rectangular Regions IEEE Transactions on Communications Sherif A.Mohamed and Moustafa M. Fahmy.
Motion Analysis (contd.) Slides are from RPI Registration Class.
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.
Fast Multi Class Distance Transforms for Video Surveillance January 2008 Theo Schouten Egon van den Broek.
Chamfer Matching & Hausdorff Distance Presented by Ankur Datta Slides Courtesy Mark Bouts Arasanathan Thayananthan.
Losslessy Compression of Multimedia Data Hao Jiang Computer Science Department Sept. 25, 2007.
Mark Waitser Computational Geometry Seminar December Iterated Snap Rounding.
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.
Euripides G.M. PetrakisIR'2001 Oulu, Sept Indexing Images with Multiple Regions Euripides G.M. Petrakis Dept.
Active Set Support Vector Regression
2007Theo Schouten1 Morphology Set theory is the mathematical basis for morphology. Sets in Euclidic space E 2 (or rather Z 2 : the set of pairs of integers)
2007Theo Schouten1 Compression "lossless" : f[x,y]  { g[x,y] = Decompress ( Compress ( f[x,y] ) | “lossy” : quality measures e 2 rms = 1/MN  ( g[x,y]
Digital Image Processing Final Project Compression Using DFT, DCT, Hadamard and SVD Transforms Zvi Devir and Assaf Eden.
Virtual Imaging Peripheral for Enhanced Reality Aaron Garrett, Ryan Hannah, Justin Huffaker, Brendon McCool.
CSC 589 Lecture 22 Image Alignment and least square methods Bei Xiao American University April 13.
JPEG C OMPRESSION A LGORITHM I N CUDA Group Members: Pranit Patel Manisha Tatikonda Jeff Wong Jarek Marczewski Date: April 14, 2009.
Frame by Frame Bit Allocation for Motion-Compensated Video Michael Ringenburg May 9, 2003.
Fast Approximate Energy Minimization via Graph Cuts
CSE 381 – Advanced Game Programming Basic 3D Graphics
Multiscale Moment-Based Painterly Rendering Diego Nehab and Luiz Velho
Zhejiang University Wavelet-based 3D mesh model watermarking Shi Jiao-Ying State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou
Image Restoration using Iterative Wiener Filter --- ECE533 Project Report Jing Liu, Yan Wu.
Image Compression Supervised By: Mr.Nael Alian Student: Anwaar Ahmed Abu-AlQomboz ID: IT College “Multimedia”
Evolutionary Art with Multiple Expression Programming By Quentin Freeman.
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Non-Photorealistic Rendering and Content- Based Image Retrieval Yuan-Hao Lai Pacific Graphics (2003)
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Dynamic Gaze-Contingent Rendering Complexity Scaling By Luke Paireepinart.
linear  2.3 Newton’s Method ( Newton-Raphson Method ) 1/12 Chapter 2 Solutions of Equations in One Variable – Newton’s Method Idea: Linearize a nonlinear.
Euripides G.M. PetrakisIR'2001 Oulu, Sept Indexing Images with Multiple Regions Euripides G.M. Petrakis Dept. of Electronic.
Graphcut Textures Image and Video Synthesis Using Graph Cuts
Delaunay Triangulation on the GPU
Approximate NN queries on Streams with Guaranteed Error/performance Bounds Nick AT&T labs-research Beng Chin Ooi, Kian-Lee Tan, Rui National.
Image Processing A Study in Pixel Averaging Building a Resolution Pyramid With Parallel Computing Denise Runnels and Farnaz Zand.
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Maarten Van Lier 2 e Master Computerwetenschappen.
Frank Bergschneider February 21, 2014 Presented to National Instruments.
Filtering of map images by context tree modeling Pavel Kopylov and Pasi Fränti UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND.
IS502:M ULTIMEDIA D ESIGN FOR I NFORMATION S YSTEM D IGITAL S TILL I MAGES Presenter Name: Mahmood A.Moneim Supervised By: Prof. Hesham A.Hefny Winter.
Soft Competitive Learning without Fixed Network Dimensionality Jacob Chakareski and Sergey Makarov Rice University, Worcester Polytechnic Institute.
You can check broken videos in this slide here :
SoC and FPGA Oriented High-quality Stereo Vision System
A segmentation and tracking algorithm
Fix Garmin GPS Map Update Error
Advisor: Chin-Chen Chang1, 2 Student: Wen-Chuan Wu2
MPEG4 Natural Video Coding
Limits of Accuracy.
Foundation of Video Coding Part II: Scalar and Vector Quantization
Limits of Accuracy.
Lecture 15: Least Square Regression Metric Embeddings
Transformations.
Moment of Brilliance Publishing Co.
Presentation transcript:

Timed Fast Exact Euclidean Distance (tFEED) Maps January 2005 Theo Schouten Harco Kuppens Egon van den Broek

tFEED Distance transformation distance map D(p) = min { dist(p,q), q  O }

tFEED Euclidean distance not by local operations using scans –approximations (city-block, chamfer) disconnected Voronoi tile semi-exact ED often wright sometimes wrong

tFEED Principle of FEED D(p) = if (p  O) then 0 else  for each q  O for each p: D(p) = min ( D(p), ED(q,p)) inverse of definition reduce number of q  O to feed distances: only the border pixels of O, not the “inside” pixels ED( (x q,y q ),(x p,y p )) = M(|x q -x p |,|y q -y p |) M can contain any non-decreasing f(ED) square (ED), floating point, rounded integer

tFEED Speed up, bisection lines reduce number of p to update per B search and bookkeeping < time gained

tFEED Search optimization pixels object 1725 border updates, 8.4 ms updates, 5.7 ms updates, 4.5 ms

tFEED Results FEED is about factor 2 faster than Shih & Wu 2-scan ED (CVIU 2004) –few % wrong, error 50% of chamfer 3,4 –FEED uses less memory FEED is about factor 2 slower than Borgefors chamfer 3,4 (CVGIP, 1986) FEED time depends more on content of image than the scan methods

tFEED Video generation generated with Macromedia Flash –vector oriented –preserve color maps

tFEED tFEED video distance maps D fixed+moving = min { D fixed, D moving } FEED on fixed objects per frame original FEED, but: –initialize with D fixed –B  O moving –up to d max in D fixed additional object does not increase max distance

tFEED Scan methods video distance maps the scan methods need a rectangle: –bounding box of moving object, extended with d max –moving object has no influence outside rectangle in rectangle D fixed+moving copy with min operator into D fixed

tFEED Video results tFEED factor 6 faster than FEED/frame factor faster than adapted Shih & Wu (semi) ED 20-50% faster than adapted Borgefors chamfer 3,4 which is often faster than the city-block which gets a larger rectangle

tFEED Video example further developments: –encoding fixed objects for faster search in FEED –faster locating the moving object more effect on tFEED

tFEED tFEED conclusions DT’s (FEED, scan methods) adapted for fast generation of distance maps for video tFEED: –gives exact ED –faster than city-block, chamfer 3,4 other (semi) ED –more complicated to implement

tFEED The End