Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition


 Dwayne Robertson
 1 years ago
 Views:
Transcription
1 Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition VO KU 1
2 Optical Flow (I) Content Introduction Local approach (Lucas Kanade) Global approaches (HornSchunck, TVL1) Coarsetofine warping 2
3 What is Optical Flow? Optical Flow is a major task of every biological and artificial visual system Is the aparent motion in images sequenzes. Can be seen as a velocity field that transforms one image to the next image in a sequence 3
4 The apparent motion Optical flow is not the true 3D motion of the objects It is the 3D motion projected to the camera plane The true 3D motion is called the scene flow and additionally requires 3D information of the scene 4
5 5
6 Applications of Optical Flow Tracking Video Compression (Recent MPEG Standard) 3D Reconstruction (Stereo) Segmentation Object Detection Video Interpolation in time (The Matrix) 6
7 History Computing Optical Flow started in the early 80 s and is still a hot research topic 1980: Horn and Schunck (global approach) 1981: Lucas and Kanade (local approach) 1989: Shulman and Herve (discontinuity preserving) 1993: Black and Anandan (robust optical flow) 1999: Alvarez et al. (PDE model) 2003: Bruhn et al. (realtime optical flow using mulitgrid) 2004: Brox et al. (high accuracy using warping) 2007: Zach, Pock, Bischof: (duality based minimization) 7
8 Evaluation For a long time, the socalled Yosemite sequence (Barron et al. 1994) was used to evaluate the algorithms Yosemite Yosemite with clouds 8
9 Evaluation Middlebury optical flow benchmark (Baker et al. 2007) 9
10 Evaluation SINTEL open source synthetic movie, Butler et al
11 Basic assumptions Brightness constancy assumption The intensities remain constant, although the location might change. Problems by changing illumination Can be generalized to a feature constancy assumption Spatial coherence assumption Neighbouring pixels are likely to have the same motion Difficult to find a good model Temporal persistence Motion changes gradually over time Only useful in case of high frame rates (small motion) 11
12 Brightness constancy assumption We assume that intensity patterns only change their positions frame t frame t+1 12
13 Difficulties of the brightnes constancy assumption Aperture Problem: Only the normal flow can be estimated Untextured areas: No information in untextured areas 13
14 Changing illumination A changing illumination induces an optical flow that does not correspond to the motion of the object A changing illumination causes an optical flow although the object does not move 14
15 What to do if the brightness constancy assumption is violated? If the illumination changes from frame to frame, the brightness constancy assumption may be violated A simple idea is to perform a structuretexture decomposition Although the absolute intensity values might change, the texture part stays the same 1. Lowpass filter the images (e.g. total variation smoothing) 2. Subtract the lowpass filtered images from the original images 3. Work with the resulting images 15
16 Structure  Texture Decomposition 16
17 Structure  Texture Decomposition 17
18 Beyond the brightness constancy assumption What can we do if we want to compute the optical flow between such images? We can work on feature transforms such as SIFT Each pixel in the images is replaced by its SIFT feature. SIFTFlow [Liu, Yuen, Torralba, 2011] 18
19 Spatial coherence assumption Describes the apriori assumption about flow fields Can be learned from statistics of natural flow fields without spatial coherence with spatial coherence 19
20 Temporal persistency Idea: The motion of objects does not suddenly change for example, one can assume linear motion model between three frames Can be generalized to higherorder models Sometimes, it does not improve too much in practice 20
21 The optical flow constraint (OFC) Brightness constancy assumption Taylor development leads to the linearized Brightness Constancy Assumption Error function over the whole image Underdetermined problem 21
22 Warping In practice, we are given two images of an image sequence and an often an initial flow field The differential quantities are computed by Warping: Geometrically transform the second image by Compute on the warped second image 22
23 Linearization of the Image 23
24 The Linearized Data Term (p=2) 24
25 The Linearized Data Term (p=1) 25
26 General outlook We will now discuss three methods Lukas Kanade method Horn Schunck method TVL1 method All methods can only be used to estimate small motion We will first assume that we only have small motion Large motion can be computed using a coarsetofine warping framework Finally we will discuss Matlab implementations of all three methods 26
27 The Lucas Kanade (LK) method 27
28 A local approach Impossible to compute the flow by only using the optical flow constraint, hence we need additional constraints Assume that all pixels in a patch have the same motion This gives the following equations for each pixel in the patch Example: 5x5 patch would give us 25 equations instead of one! A: 25x2 d: 2x1 b: 25x1 28
29 LucasKanade optical flow We have more equations than unknowns Find least squares solution Solution is given by the pseudo inverse Note that the system to be solved is only 2x2 29
30 Conditions for solvability Optimal (u, v) satisfies LucasKanade equation When is this system solvable? is recognized to be the structure tensor Invertible, if both eigenvalues are sufficiently larger than zero 30
31 The Lucas Kanade (LK) method Advantages Only one parameter (window size) Very fast to compute (easily realtime) Can be done dense or sparse Disadvantages Each patch is independent, no global consensus The local window assumes a constant motion Sometimes bad results 31
32 The Horn and Schunck (HS) Method 32
33 The Horn and Schunck (HS) Method Global energy to be minimized is the regularization parameter The image is of size are column vectors is a finite differences approximation of the gradient operator 33
34 Optimality conditions: The linear system The optimality condition can be rearranged as the following linear system System is large but very sparse Suitable solvers are GaussSeidel, CG, or Matlab \ 34
35 The Horn and Schunck (HS) Method Advantages Easy and fast to solve due to quadratic functions Easy to implement Disadvantages Quadratic smoothnes term does not allow for sharp discontinuities in the motion field Quadratic data term does not allow for outliers in the optical flow constraint 35
36 The TVL1 approach 36
37 The TVL1 approach Due to the quadratic functions, the HS method does not allow for discontinuities in the flow field A good idea is to replacing the quadratic functions by norms Leads to the socalled TVL1 approach The first term is the socalled total variation of the flow field, the second term is the norm of the OFC 37
38 Minimizing the TVL1 energy The TVL1 energy is convex but nondifferentiable Standard gradient descent cannot be applied We can rely on recent advances in convex optimization We can apply two strategies: Smooth the total variation term and apply the FISTA algorithm Compute a saddlepoint formulation of the energy and apply a primaldual algorithm 38
39 The FISTA Algorithm Fast Iterative Shrinkage Thresholding Algorithm Proposed in 2008 by Beck and Teboulle Can be applied to the following class of convex optimization problems The function has a Lipschitz continuous gradient The function can be nonsmooth but has a simple to compute proximal operator 39
40 FISTA Convergence rate: 40
41 Application to the TVL1 energy (1) Smoothing of the TV term to make its gradient Lipschitz where denotes the Huber function, has a Lipschitz continuous gradient with 41
42 Application to the TVL1 energy (2) The nonsmooth function is given by the norm of the data term The solution of the proximal operator is given by where and 42
43 Primaldual optimization A firstorder primaldual algorithm proposed in Chambolle, Pock, 2011 Can be used to find a saddle point of the following class of convexconcave saddlepoint problems where is a linear operator, and are convex (nonsmooth) functions and have simple proximal operators Corresponds to a saddlepoint formulation of the primal and dual problems 43
44 The algorithm Step sizes:, Proximal operators 44
45 Saddlepoint formulation of TVL1 The total variation can be written as (convex conjugate) The TVL1 optical flow model is written as with Exactly falls into the class of the primaldual algorithm 45
46 The proximal operators The proximal operator with respect to is given by the same softshrinkage formula as before The proximal operator with respect to is a projection onto the Euclidean ball 46
47 The TVL1 approach Advantages TV regularization allows for discontinuities in the flow field The L1 data term allows for outliers (occlusions) Reasonable fast to compute (GPU leads to realtime) Disadvantages The method requires an iterative solver to compute the minimizer (FISTA, or PrimalDual) FISTA requires to smooth the TV PrimalDual can also deal with the pure TV Hard to find a good stopping criterion 47
48 Coarsetofine warping framework Due to the restrictions of the OFC, the discussed methods are only able to recover small motion How to extend the method for large motion? 1. Solving, warping, relinearization, solving, Implement the method on an image pyramide 48
49 Coarsetofine warping framework Compute image pyramids init Initialize the flow field solve Transform the moving image by the given flow field (warping) Perform linearization Apply one of the three methods (LK, HS, TVL1) prolongate Initialize the flow field on the next finer level using interpolation and rescaling of the motion vectors 49
50 Coarsetofine warping framework Advantages Allows to compute large motion Due to the logarithmic nature of pyramids, not much more to compute Disadvantages Large motion that is not captured at a coarse scale cannot be found on finer levels Dilemma: Large motion of small objects Different interpolation, rescaling, filtering schemes lead to different results Can lead to unstable results in practice BUT: What is the alternative? 50
51 Comparison of the three methods In the following, we will show an comparison of the three methods we covered so far We use the Army sequence of the Middlebury benchmark Input frames Ground truth flow 51
52 Structuretexture decomposition The data set contains changing illumination and shadows 52
53 LucasKanade 53
54 HornSchunck 54
55 TVL1 55
56 Realtime implementation Implementation of the TVL1 method on a GPU allows for realtime computation 56
57 Flow Games Jakob Santner et al. 57
58 Feature Flow How can we compute the motion between challenging sequences Large displacements Different modalities Image taken at different time points Images from objects of the same category 58
59 Feature Flow The idea is simple Replace each pixel in both images by a feature vector SIFT descriptor LBP Feature constancy assumption Linearize each feature channel individually 59
60 Some results using SIFT 60
61 Some results using SIFT 61
62 Some results using SIFT 62
63 Some results using SIFT 63
64 Some results using SIFT 64
65 Some results using SIFT 65
Optical Flow. Thomas Pock
Optical Flow Thomas Pock 1 Optical Flow (II) Content Global approaches (HornSchunck, TVL1) Coarsetofine warping 2 The Horn and Schunck (HS) Method 3 The Horn and Schunck (HS) Method Global energy to
More informationFeature Tracking and Optical Flow
02/09/12 Feature Tracking and Optical Flow Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem Many slides adapted from Lana Lazebnik, Silvio Saverse, who in turn adapted slides from Steve
More informationOptical Flow. Shenlong Wang CSC2541 Course Presentation Feb 2, 2016
Optical Flow Shenlong Wang CSC2541 Course Presentation Feb 2, 2016 Outline Introduction Variation Models Feature Matching Methods Endtoend Learning based Methods Discussion Optical Flow Goal: Pixel motion
More informationA Study on SURF Algorithm and RealTime Tracking Objects Using Optical Flow
, pp.233237 http://dx.doi.org/10.14257/astl.2014.51.53 A Study on SURF Algorithm and RealTime Tracking Objects Using Optical Flow Giwoo Kim 1, HyeYoun Lim 1 and DaeSeong Kang 1, 1 Department of electronices
More informationObject tracking & Motion detection in video sequences
Introduction Object tracking & Motion detection in video sequences Recomended link: http://cmp.felk.cvut.cz/~hlavac/teachpresen/17compvision3d/41imagemotion.pdf 1 2 DYNAMIC SCENE ANALYSIS The input to
More informationTwoFrame Motion Estimation Based on Polynomial Expansion
TwoFrame Motion Estimation Based on Polynomial Expansion Gunnar Farnebäck Computer Vision Laboratory, Linköping University, SE581 83 Linköping, Sweden gf@isy.liu.se http://www.isy.liu.se/cvl/ Abstract.
More informationROBUST VEHICLE TRACKING IN VIDEO IMAGES BEING TAKEN FROM A HELICOPTER
ROBUST VEHICLE TRACKING IN VIDEO IMAGES BEING TAKEN FROM A HELICOPTER Fatemeh Karimi Nejadasl, Ben G.H. Gorte, and Serge P. Hoogendoorn Institute of Earth Observation and Space System, Delft University
More informationDual Methods for Total VariationBased Image Restoration
Dual Methods for Total VariationBased Image Restoration Jamylle Carter Institute for Mathematics and its Applications University of Minnesota, Twin Cities Ph.D. (Mathematics), UCLA, 2001 Advisor: Tony
More informationA Learning Based Method for SuperResolution of Low Resolution Images
A Learning Based Method for SuperResolution of Low Resolution Images Emre Ugur June 1, 2004 emre.ugur@ceng.metu.edu.tr Abstract The main objective of this project is the study of a learning based method
More informationComputational Optical Imaging  Optique Numerique.  Deconvolution 
Computational Optical Imaging  Optique Numerique  Deconvolution  Winter 2014 Ivo Ihrke Deconvolution Ivo Ihrke Outline Deconvolution Theory example 1D deconvolution Fourier method Algebraic method
More informationVision based Vehicle Tracking using a high angle camera
Vision based Vehicle Tracking using a high angle camera Raúl Ignacio Ramos García Dule Shu gramos@clemson.edu dshu@clemson.edu Abstract A vehicle tracking and grouping algorithm is presented in this work
More informationA Duality Based Algorithm for TVL 1 OpticalFlow Image Registration
A Duality Based Algorithm for TVL 1 OpticalFlow Image Registration Thomas Pock 1, Martin Urschler 1, Christopher Zach 2, Reinhard Beichel 3, and Horst Bischof 1 1 Institute for Computer Graphics & Vision,
More informationBildverarbeitung und Mustererkennung Image Processing and Pattern Recognition
Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition 1. Image PreProcessing  Pixel Brightness Transformation  Geometric Transformation  Image Denoising 1 1. Image PreProcessing
More informationMOTION DETECTION FOR PC BASED SECURITY SYSTEM BY USING OPTICAL FLOW NUR NABILAH BT MOHAMAD HAMID
MOTION DETECTION FOR PC BASED SECURITY SYSTEM BY USING OPTICAL FLOW NUR NABILAH BT MOHAMAD HAMID This thesis is submitted as partial fulfillment of the requirement for the award of the Bachelor of Electrical
More informationAn Iterative Image Registration Technique with an Application to Stereo Vision
An Iterative Image Registration Technique with an Application to Stereo Vision Bruce D. Lucas Takeo Kanade Computer Science Department CarnegieMellon University Pittsburgh, Pennsylvania 15213 Abstract
More informationEFFICIENT VEHICLE TRACKING AND CLASSIFICATION FOR AN AUTOMATED TRAFFIC SURVEILLANCE SYSTEM
EFFICIENT VEHICLE TRACKING AND CLASSIFICATION FOR AN AUTOMATED TRAFFIC SURVEILLANCE SYSTEM Amol Ambardekar, Mircea Nicolescu, and George Bebis Department of Computer Science and Engineering University
More informationAutomatic Restoration Algorithms for 35mm film
P. Schallauer, A. Pinz, W. Haas. Automatic Restoration Algorithms for 35mm film. To be published in Videre, Journal of Computer Vision Research, web: http://mitpress.mit.edu/videre.html, 1999. Automatic
More information10. Proximal point method
L. Vandenberghe EE236C Spring 201314) 10. Proximal point method proximal point method augmented Lagrangian method MoreauYosida smoothing 101 Proximal point method a conceptual algorithm for minimizing
More informationDense Point Trajectories by GPUaccelerated Large Displacement Optical Flow
Dense Point Trajectories by GPUaccelerated Large Displacement Optical Flow Narayanan Sundaram, Thomas Brox, and Kurt Keutzer University of California at Berkeley {narayans,brox,keutzer}@eecs.berkeley.edu
More informationAccurate and robust image superresolution by neural processing of local image representations
Accurate and robust image superresolution by neural processing of local image representations Carlos Miravet 1,2 and Francisco B. Rodríguez 1 1 Grupo de Neurocomputación Biológica (GNB), Escuela Politécnica
More informationMetrics on SO(3) and Inverse Kinematics
Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction
More informationFace Model Fitting on Low Resolution Images
Face Model Fitting on Low Resolution Images Xiaoming Liu Peter H. Tu Frederick W. Wheeler Visualization and Computer Vision Lab General Electric Global Research Center Niskayuna, NY, 1239, USA {liux,tu,wheeler}@research.ge.com
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEYINTERSCIENCE A John Wiley & Sons, Inc.,
More informationVideo stabilization for high resolution images reconstruction
Advanced Project S9 Video stabilization for high resolution images reconstruction HIMMICH Youssef, KEROUANTON Thomas, PATIES Rémi, VILCHES José. Abstract Superresolution reconstruction produces one or
More informationIlluminationInvariant Tracking via Graph Cuts
IlluminationInvariant Tracking via Graph Cuts Daniel Freedman and Matthew W. Turek Computer Science Department, Rensselaer Polytechnic Institute, Troy, NY 12180 Abstract Illumination changes are a ubiquitous
More informationParallel algorithms to a parallel hardware: Designing vision algorithms for a GPU
Parallel algorithms to a parallel hardware: Designing vision algorithms for a GPU JunSik Kim, Myung Hwangbo and Takeo Kanade Robotics Institute Carnegie Mellon University {kimjs,myung,tk}@cs.cmu.edu Abstract
More informationEdge tracking for motion segmentation and depth ordering
Edge tracking for motion segmentation and depth ordering P. Smith, T. Drummond and R. Cipolla Department of Engineering University of Cambridge Cambridge CB2 1PZ,UK {pas1001 twd20 cipolla}@eng.cam.ac.uk
More informationConstrained curve and surface fitting
Constrained curve and surface fitting Simon Flöry FSPMeeting Strobl (June 20, 2006), floery@geoemtrie.tuwien.ac.at, Vienna University of Technology Overview Introduction Motivation, Overview, Problem
More informationBig Data  Lecture 1 Optimization reminders
Big Data  Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data  Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics
More informationGeometric and Radiometric Camera Calibration
Geometric and Radiometric Camera Calibration Shape From Stereo requires geometric knowledge of: Cameras extrinsic parameters, i.e. the geometric relationship between the two cameras. Camera intrinsic parameters,
More informationOBJECT TRACKING USING LOGPOLAR TRANSFORMATION
OBJECT TRACKING USING LOGPOLAR TRANSFORMATION A Thesis Submitted to the Gradual Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillment of the requirements
More informationSuperResolution for Traditional and Omnidirectional Image Sequences
Acta Polytechnica Hungarica Vol. 6, No. 1, 2009 SuperResolution for Traditional and Omnidirectional Image Sequences Attila Nagy, Zoltán Vámossy Institute of Software Technology, John von Neumann Faculty
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
More informationMeanShift Tracking with Random Sampling
1 MeanShift Tracking with Random Sampling Alex Po Leung, Shaogang Gong Department of Computer Science Queen Mary, University of London, London, E1 4NS Abstract In this work, boosting the efficiency of
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationA Methodology for Obtaining SuperResolution Images and Depth Maps from RGBD Data
A Methodology for Obtaining SuperResolution Images and Depth Maps from RGBD Data Daniel B. Mesquita, Mario F. M. Campos, Erickson R. Nascimento Computer Science Department Universidade Federal de Minas
More informationSingle Image 3D Reconstruction of Ball Motion and Spin From Motion Blur
Single Image 3D Reconstruction of Ball Motion and Spin From Motion Blur An Experiment in Motion from Blur Giacomo Boracchi, Vincenzo Caglioti, Alessandro Giusti Objective From a single image, reconstruct:
More informationEpipolar Geometry. Readings: See Sections 10.1 and 15.6 of Forsyth and Ponce. Right Image. Left Image. e(p ) Epipolar Lines. e(q ) q R.
Epipolar Geometry We consider two perspective images of a scene as taken from a stereo pair of cameras (or equivalently, assume the scene is rigid and imaged with a single camera from two different locations).
More informationUnwrap Mosaics: A new representation for video editing
Unwrap Mosaics: A new representation for video editing Alex RavAcha, Pushmeet Kohli, Carsten Rother, Andrew Fitzgibbon Microsoft Research SIGGRAPH 2008 http://research.microsoft.com/enus/um/cambridge/projects/visionimagevideoediting/unwrap/
More informationTracking Moving Objects In Video Sequences Yiwei Wang, Robert E. Van Dyck, and John F. Doherty Department of Electrical Engineering The Pennsylvania State University University Park, PA16802 Abstract{Object
More informationA Prototype For EyeGaze Corrected
A Prototype For EyeGaze Corrected Video Chat on Graphics Hardware Maarten Dumont, Steven Maesen, Sammy Rogmans and Philippe Bekaert Introduction Traditional webcam video chat: No eye contact. No extensive
More informationComputer Vision  part II
Computer Vision  part II Review of main parts of Section B of the course School of Computer Science & Statistics Trinity College Dublin Dublin 2 Ireland www.scss.tcd.ie Lecture Name Course Name 1 1 2
More information3. Proximal gradient method
Algorithms for largescale convex optimization DTU 2010 3. Proximal gradient method introduction proximal mapping proximal gradient method convergence analysis accelerated proximal gradient method forwardbackward
More informationBuilding an Advanced Invariant RealTime Human Tracking System
UDC 004.41 Building an Advanced Invariant RealTime Human Tracking System Fayez Idris 1, Mazen Abu_Zaher 2, Rashad J. Rasras 3, and Ibrahiem M. M. El Emary 4 1 School of Informatics and Computing, GermanJordanian
More informationTowards License Plate Recognition: Comparying Moving Objects Segmentation Approaches
1 Towards License Plate Recognition: Comparying Moving Objects Segmentation Approaches V. J. OliveiraNeto, G. CámaraChávez, D. Menotti UFOP  Federal University of Ouro Preto Computing Department Ouro
More informationA REVIEW OF FAST l 1 MINIMIZATION ALGORITHMS FOR ROBUST FACE RECOGNITION
A REVIEW OF FAST l 1 MINIMIZATION ALGORITHMS FOR ROBUST FACE RECOGNITION ALLEN Y. YANG, ARVIND GANESH, ZIHAN ZHOU, S. SHANKAR SASTRY, AND YI MA Abstract. l 1 minimization refers to finding the minimum
More informationAn Introduction to Applied Mathematics: An Iterative Process
An Introduction to Applied Mathematics: An Iterative Process Applied mathematics seeks to make predictions about some topic such as weather prediction, future value of an investment, the speed of a falling
More informationLecture 19 Camera Matrices and Calibration
Lecture 19 Camera Matrices and Calibration Project Suggestions Texture Synthesis for InPainting Section 10.5.1 in Szeliski Text Project Suggestions Image Stitching (Chapter 9) Face Recognition Chapter
More informationNumerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and NonSquare Systems
Numerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and NonSquare Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420001,
More informationNumerical Methods For Image Restoration
Numerical Methods For Image Restoration CIRAM Alessandro Lanza University of Bologna, Italy Faculty of Engineering CIRAM Outline 1. Image Restoration as an inverse problem 2. Image degradation models:
More informationTracking of Small Unmanned Aerial Vehicles
Tracking of Small Unmanned Aerial Vehicles Steven Krukowski Adrien Perkins Aeronautics and Astronautics Stanford University Stanford, CA 94305 Email: spk170@stanford.edu Aeronautics and Astronautics Stanford
More informationSubspace Analysis and Optimization for AAM Based Face Alignment
Subspace Analysis and Optimization for AAM Based Face Alignment Ming Zhao Chun Chen College of Computer Science Zhejiang University Hangzhou, 310027, P.R.China zhaoming1999@zju.edu.cn Stan Z. Li Microsoft
More informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science  Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: WireFrame Representation Object is represented as as a set of points
More informationTESLA Report 200303
TESLA Report 233 A multigrid based 3D spacecharge routine in the tracking code GPT Gisela Pöplau, Ursula van Rienen, Marieke de Loos and Bas van der Geer Institute of General Electrical Engineering,
More informationConvolution. 1D Formula: 2D Formula: Example on the web: http://www.jhu.edu/~signals/convolve/
Basic Filters (7) Convolution/correlation/Linear filtering Gaussian filters Smoothing and noise reduction First derivatives of Gaussian Second derivative of Gaussian: Laplacian Oriented Gaussian filters
More informationEdgebased Template Matching and Tracking for Perspectively Distorted Planar Objects
Edgebased Template Matching and Tracking for Perspectively Distorted Planar Objects Andreas Hofhauser, Carsten Steger, and Nassir Navab TU München, Boltzmannstr. 3, 85748 Garching bei München, Germany
More informationAlgorithm (DCABES 2009)
People Tracking via a Modified CAMSHIFT Algorithm (DCABES 2009) Fahad Fazal Elahi Guraya, PierreYves Bayle and Faouzi Alaya Cheikh Department of Computer Science and Media Technology, Gjovik University
More informationHigh Quality Image Magnification using CrossScale SelfSimilarity
High Quality Image Magnification using CrossScale SelfSimilarity André Gooßen 1, Arne Ehlers 1, Thomas Pralow 2, RolfRainer Grigat 1 1 Vision Systems, Hamburg University of Technology, D21079 Hamburg
More informationEfficient Belief Propagation for Early Vision
Efficient Belief Propagation for Early Vision Pedro F. Felzenszwalb and Daniel P. Huttenlocher Department of Computer Science, Cornell University {pff,dph}@cs.cornell.edu Abstract Markov random field models
More informationFace Recognition using Principle Component Analysis
Face Recognition using Principle Component Analysis Kyungnam Kim Department of Computer Science University of Maryland, College Park MD 20742, USA Summary This is the summary of the basic idea about PCA
More informationLinear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
More informationStructured light systems
Structured light systems Tutorial 1: 9:00 to 12:00 Monday May 16 2011 Hiroshi Kawasaki & Ryusuke Sagawa Today Structured light systems Part I (Kawasaki@Kagoshima Univ.) Calibration of Structured light
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More information3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials
3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines
More informationBayesian Image SuperResolution
Bayesian Image SuperResolution Michael E. Tipping and Christopher M. Bishop Microsoft Research, Cambridge, U.K..................................................................... Published as: Bayesian
More informationOverview of Math Standards
Algebra 2 Welcome to math curriculum design maps for Manhattan Ogden USD 383, striving to produce learners who are: Effective Communicators who clearly express ideas and effectively communicate with diverse
More informationRealtime Traffic Congestion Detection Based on Video Analysis
Journal of Information & Computational Science 9: 10 (2012) 2907 2914 Available at http://www.joics.com Realtime Traffic Congestion Detection Based on Video Analysis Shan Hu a,, Jiansheng Wu a, Ling Xu
More informationCloud tracking with optical flow for shortterm solar forecasting
Cloud tracking with optical flow for shortterm solar forecasting Philip WoodBradley, José Zapata, John Pye Solar Thermal Group, Australian National University, Canberra, Australia Corresponding author:
More informationOpenFOAM Optimization Tools
OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov h.rusche@wikkigmbh.de and a.jemcov@wikki.co.uk Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisation
More information3D Model based Object Class Detection in An Arbitrary View
3D Model based Object Class Detection in An Arbitrary View Pingkun Yan, Saad M. Khan, Mubarak Shah School of Electrical Engineering and Computer Science University of Central Florida http://www.eecs.ucf.edu/
More informationBig Data Analytics: Optimization and Randomization
Big Data Analytics: Optimization and Randomization Tianbao Yang, Qihang Lin, Rong Jin Tutorial@SIGKDD 2015 Sydney, Australia Department of Computer Science, The University of Iowa, IA, USA Department of
More informationA NEW SUPER RESOLUTION TECHNIQUE FOR RANGE DATA. Valeria Garro, Pietro Zanuttigh, Guido M. Cortelazzo. University of Padova, Italy
A NEW SUPER RESOLUTION TECHNIQUE FOR RANGE DATA Valeria Garro, Pietro Zanuttigh, Guido M. Cortelazzo University of Padova, Italy ABSTRACT Current TimeofFlight matrix sensors allow for the acquisition
More informationBlind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections
Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections Maximilian Hung, Bohyun B. Kim, Xiling Zhang August 17, 2013 Abstract While current systems already provide
More information2.2 Creaseness operator
2.2. Creaseness operator 31 2.2 Creaseness operator Antonio López, a member of our group, has studied for his PhD dissertation the differential operators described in this section [72]. He has compared
More informationGI01/M055 Supervised Learning Proximal Methods
GI01/M055 Supervised Learning Proximal Methods Massimiliano Pontil (based on notes by Luca Baldassarre) (UCL) Proximal Methods 1 / 20 Today s Plan Problem setting Convex analysis concepts Proximal operators
More informationLatest Results on HighResolution Reconstruction from Video Sequences
Latest Results on HighResolution Reconstruction from Video Sequences S. Lertrattanapanich and N. K. Bose The Spatial and Temporal Signal Processing Center Department of Electrical Engineering The Pennsylvania
More informationFLEXSYS Motionbased Traffic Analysis and Incident Detection
FLEXSYS Motionbased Traffic Analysis and Incident Detection Authors: Lixin Yang and Hichem Sahli, IBBT/VUBETRO Contents.1 Introduction......................................... 1.2 Traffic flow modelling
More informationA network flow algorithm for reconstructing. binary images from discrete Xrays
A network flow algorithm for reconstructing binary images from discrete Xrays Kees Joost Batenburg Leiden University and CWI, The Netherlands kbatenbu@math.leidenuniv.nl Abstract We present a new algorithm
More informationTracking in flussi video 3D. Ing. Samuele Salti
Seminari XXIII ciclo Tracking in flussi video 3D Ing. Tutors: Prof. Tullio Salmon Cinotti Prof. Luigi Di Stefano The Tracking problem Detection Object model, Track initiation, Track termination, Tracking
More informationDigital Image Processing
Digital Image Processing Using MATLAB Second Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive Steven L. Eddins The MathWorks, Inc. Gatesmark Publishing A Division
More informationINTRODUCTION TO NEURAL NETWORKS
INTRODUCTION TO NEURAL NETWORKS Pictures are taken from http://www.cs.cmu.edu/~tom/mlbookchapterslides.html http://research.microsoft.com/~cmbishop/prml/index.htm By Nobel Khandaker Neural Networks An
More informationApplications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is
More informationStatistical machine learning, high dimension and big data
Statistical machine learning, high dimension and big data S. Gaïffas 1 14 mars 2014 1 CMAP  Ecole Polytechnique Agenda for today Divide and Conquer principle for collaborative filtering Graphical modelling,
More informationAnalyzing Facial Expressions for Virtual Conferencing
IEEE Computer Graphics & Applications, pp. 7078, September 1998. Analyzing Facial Expressions for Virtual Conferencing Peter Eisert and Bernd Girod Telecommunications Laboratory, University of Erlangen,
More informationFast and efficient dense variational stereo on GPU
Fast and efficient dense variational stereo on GPU Julien Mairal, Renaud Keriven and Alexandre Chariot CERTIS ENPC 77455 MarnelaVallee cedex 2 France julien.mairal@m4x.org, keriven@certis.enpc.fr, chariot@certis.enpc.fr
More informationFace detection is a process of localizing and extracting the face region from the
Chapter 4 FACE NORMALIZATION 4.1 INTRODUCTION Face detection is a process of localizing and extracting the face region from the background. The detected face varies in rotation, brightness, size, etc.
More informationProbabilistic Latent Semantic Analysis (plsa)
Probabilistic Latent Semantic Analysis (plsa) SS 2008 Bayesian Networks Multimedia Computing, Universität Augsburg Rainer.Lienhart@informatik.uniaugsburg.de www.multimediacomputing.{de,org} References
More informationTemplatebased Eye and Mouth Detection for 3D Video Conferencing
Templatebased Eye and Mouth Detection for 3D Video Conferencing Jürgen Rurainsky and Peter Eisert Fraunhofer Institute for Telecommunications  HeinrichHertzInstitute, Image Processing Department, Einsteinufer
More informationSimultaneous Gamma Correction and Registration in the Frequency Domain
Simultaneous Gamma Correction and Registration in the Frequency Domain Alexander Wong a28wong@uwaterloo.ca William Bishop wdbishop@uwaterloo.ca Department of Electrical and Computer Engineering University
More informationImage Segmentation and Registration
Image Segmentation and Registration Dr. Christine Tanner (tanner@vision.ee.ethz.ch) Computer Vision Laboratory, ETH Zürich Dr. Verena Kaynig, Machine Learning Laboratory, ETH Zürich Outline Segmentation
More informationMonash University Clayton s School of Information Technology CSE3313 Computer Graphics Sample Exam Questions 2007
Monash University Clayton s School of Information Technology CSE3313 Computer Graphics Questions 2007 INSTRUCTIONS: Answer all questions. Spend approximately 1 minute per mark. Question 1 30 Marks Total
More informationFACTS  A Computer Vision System for 3D Recovery and Semantic Mapping of Human Factors
FACTS  A Computer Vision System for 3D Recovery and Semantic Mapping of Human Factors Lucas Paletta, Katrin Santner, Gerald Fritz, Albert Hofmann, Gerald Lodron, Georg Thallinger, Heinz Mayer 2 Human
More informationThe Image Deblurring Problem
page 1 Chapter 1 The Image Deblurring Problem You cannot depend on your eyes when your imagination is out of focus. Mark Twain When we use a camera, we want the recorded image to be a faithful representation
More informationDepth from a single camera
Depth from a single camera Fundamental Matrix Essential Matrix Active Sensing Methods School of Computer Science & Statistics Trinity College Dublin Dublin 2 Ireland www.scss.tcd.ie 1 1 Geometry of two
More informationParameter Estimation for Bingham Models
Dr. Volker Schulz, Dmitriy Logashenko Parameter Estimation for Bingham Models supported by BMBF Parameter Estimation for Bingham Models Industrial application of ceramic pastes Material laws for Bingham
More informationEnvironmental Remote Sensing GEOG 2021
Environmental Remote Sensing GEOG 2021 Lecture 4 Image classification 2 Purpose categorising data data abstraction / simplification data interpretation mapping for land cover mapping use land cover class
More informationGeometric Camera Parameters
Geometric Camera Parameters What assumptions have we made so far? All equations we have derived for far are written in the camera reference frames. These equations are valid only when: () all distances
More informationDetecting and Tracking Moving Objects for Video Surveillance
IEEE Proc. Computer Vision and Pattern Recognition Jun. 35, 1999. Fort Collins CO Detecting and Tracking Moving Objects for Video Surveillance Isaac Cohen Gérard Medioni University of Southern California
More informationDETECTION OF PLANAR PATCHES IN HANDHELD IMAGE SEQUENCES
DETECTION OF PLANAR PATCHES IN HANDHELD IMAGE SEQUENCES Olaf Kähler, Joachim Denzler FriedrichSchillerUniversity, Dept. Mathematics and Computer Science, 07743 Jena, Germany {kaehler,denzler}@informatik.unijena.de
More informationCHAPTER 6 TEXTURE ANIMATION
CHAPTER 6 TEXTURE ANIMATION 6.1. INTRODUCTION Animation is the creating of a timed sequence or series of graphic images or frames together to give the appearance of continuous movement. A collection of
More information