A total least squares framework for low-level analysis of dynamic scenes and processes

Size: px
Start display at page:

Download "A total least squares framework for low-level analysis of dynamic scenes and processes"

Transcription

1 A total least squares framework for low-level analysis of dynamic scenes and processes Horst Haußecker 1,2, Christoph Garbe 1, Hagen Spies 1,3, and Bernd Jähne 1 1 Interdisciplinary Center for Scientific Computing (IWR), University of Heidelberg Im Neuenheimer Feld 368, D Heidelberg, Germany {horst.haussecker,christoph.garbe,bernd.jaehne}@iwr.uni-heidelberg.de 2 Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA Dept. of Comp. Science, University of Western Ontario London, Ontario, N6G 5B7 Canada, hagen.spies@iwr.uni-heidelberg.de Abstract. We present a new method to simultaneously estimate optical flow fields and parameters of dynamic processes, violating the standard brightness change constraint equation. This technique constitutes a straightforward generalization of the standard brightness constancy assumption. Using TLS estimation the spatiotemporal brightness structure is analyzed in an entirely symmetric way with respect to the spatial and temporal coordinates. We directly incorporate nonlinear brightness changes based upon differential equations of the underlying processes. Keywords. optical flow, total least squares, brightness change model 1 Introduction The role of total least squares (TLS) parameter estimation ([13]) in motion analysis has been increasingly appreciated [8]. Although it is not always explicitly referred to, many recent approaches to optical flow computation (e. g. [1], [2], [12], [4], [10]) are based on TLS or related techniques. In differential-based optical flow techniques spatial gradients are related to temporal changes. Optical flow estimates are obtained by pooling local constraints over a small neighborhood in a least squares sense. Using standard least squares (LS) techniques the temporal derivatives are treated as (measured) observables and the spatial gradients are assumed to be error-free. However, both are prone to discretization errors and noise which leads to biased estimates in case of standard least squares techniques ([5]). As TLS estimation is symmetric in the spatial and temporal coordinates (see Appendix 1) it is unbiased in case of isotropic noise. Most optical flow methods are in fact model-based approaches. However, the underlying model is commonly the most simple assumption on the spatiotemporal brightness distribution, namely constant optical flow within a small spatial neighborhood, and conservation of image brightness along the path of objects. Our approach weakens these strong conservation laws and allows parameterized variations of both the motion field and the image brightness. In contrast to other approaches (e. g. [9],[11],[3]), temporal brightness variations of higher than linear order are allowed. Hence, the spatiotemporal image structure is analyzed in

2 an entirely symmetric way with respect to spatial and temporal coordinates. A major contribution of this paper is the generalized framework for incorporating brightness changes into motion analysis, based upon physical constraints in terms of differential equations of the underlying transport processes. It is capable of dealing with dynamically changing objects and constitutes a generalization of the brightness constancy assumption in a straightforward way. The work of this paper has been triggered by the need to quantitatively measure transport, exchange, and growth processes in scientific applications [7]. Here objects will change their shape and brightness, possibly within a few images. Standard brightness constancy assumptions inevitably lead to biased estimates of both the object motion and radiometric parameters. The new approach does not only allow to improve the accuracy of motion estimation but simultaneously yields physical parameters of the underlying transport processes. 2 Brightness constancy assumption Before we turn towards varying object brightness, we recall the basic brightness constancy assumption generally used in optical flow techniques. It requires the total time derivative of the object brightness g to equal zero, i.e. dg dt = g dx x dt + g dy y dt + g t =0, or, [g x,g y,g t ] f 1 f 2 1 =( g) T u=0, (1) where f =[f 1,f 2 ] T =[dx/dt, dy/dt] T ist the optical flow to be estimated, and u =[f 1,f 2,1] T is a 3-D vector in the spatiotemporal domain. With g i we denote the partial derivative of g with respect to the coordinate i {x, y, t}. All three partial derivatives are combined to the spatiotemporal gradient g. Equation (1) is known as the brightness change constraint equation (BCCE) [6]. It is ill-posed, as it constitutes only one equation in two unknowns. A common method to find a solution is to further constrain (1) by assuming that the optical flow f is constant within a small spatial neighborhood surrounding the pixel of interest. In order to further regularize the result, the neighborhood can as well be extended into the time domain 1. Given a set of N neighboring pixels, we get the following linear equation system: Du = 0 with D =[ g 1,..., g N ] T, (2) where D is a N 3 matrix made up from the gradients g n at the position n. The TLS solution of (2) is outlined in Appendix 1 and detailed in [5]. Although the BCCE model poses strict constraints that will be rarely fulfilled, the TLS estimation of (2) yields good results in a wide variety of applications with typically slow variations of both the object brightness and the spatial distribution of f. Such results are reported in [12], [4], [10], and [5]. 1 For enhanced brightness change models (Sect. 4) it is an important prerequisite to extend the neighborhood into the temporal domain. Otherwise no temporal brightness changes of higher than linear order can be estimated.

3 a b t x u u u u u u f f f f f f = 0 Fig. 1. A 1-D sinusoidal pattern is moving along the x-axis with a constant brightness and b linear brightness change. The optical flow f is the projection of the spatiotemporal parameter vector u onto the spatial coordinates (1). The dashed lines indicate the spatiotemporal path of the object, i. e. the correct direction of u. The influence of brightness changes is illustrated in Fig. 1 for 1-D constant motion of a sinusoidal pattern. In case of constant brightness (Fig. 1 a), all vectors u are pointing parallel and yield the correct optical flow f. For changing object brightness (Fig. 1 b), the algorithm still estimates u as the direction of constant brightness within the spatiotemporal neighborhood, although this deviates from the correct spatiotemporal path. This results in a biased estimate of f. 3 Parameterized flow model In a first step we allow the optical flow field to locally vary according to some parameterized function. Following [1] and [2], we replace the optical flow (translation) vector u by a generalized transformation S(r, a), where S =[S x,s y,s t ] T defines a 3-D invertible transformation acting on the spatiotemporal position r =[x, y, t] T : r = S(r, a), and r = S 1 (r, a). (3) With a =[a 1,...,a P ] T we denote the P -dimensional parameter vector of the transformation. For the moment we still require the brightness g to remain constant along the path of the object, i. e. g(r) =g(r )=g ( S 1 (r,a) ). (4) Successive application of S defines a trajectory through the sequence along which the brightness of g remains constant. If S is infinitely differentiable in r, and analytic in a, it forms a Lie group of transformations (LGOT). In this case, the vector r can be expanded about a =0: r=r + P i=1 a i S(r, a), with r = S(r, a =0), (5)

4 i. e. a = 0 is the identity element of the transformation. The dependence of the brightness function g on the transformation parameters a i can be derived as g(r) = g x + g x y y + g t t = g S x + g S y + g S t = L i g(r), (6) x y t using (5). The operator L i, i {1,...,P}, is called an infinitesimal generator of the Lie group of transformations in a i and defined as: L i = S x x + S y y + S t t. (7) In a final step, we expand g about r with respect to the parameters a i : g(r) =g(r )+ P i=1 a i g = g(r )+ P a i L i g, (8) where (6) was used. With the initial assumption of brightness conservation (4), i. e. g(r) =g(r ), (8) reduces to: i=1 P a i L i g =0, or, (Lg) T a =0, (9) i=1 which constitutes a generalized brightness change constraint equation (GBCCE), where the 3-D spatiotemporal gradient is replaced by the P -dimensional vector of Lie-derivatives Lg =[L 1 g,...,l P g] T. In order to find a best estimate of a we assume a to be constant within a small neighborhood containing N pixels and get the following linear equation system La =0, with L =[Lg 1,...,Lg N ] T. (10) Minimization of (10) with respect to a can again be carried out by the general framework of TLS estimation (Appendix 1). Examples of the coordinate transformation S are affine flow or higher-order polynomials in the spatial coordinates [5]. As this paper focuses on parameterized brightness changes, we only illustrate a trivial example for a parameterized flow, and refer to the literature for further examples (e. g. [1],[2],[5]). Example 1 (Constant translation). For constant translation, the coordinate transformation S reads S(r, t) =r+t, (11) where t =[δx, δy, δt] T denotes the translation vector to be estimated. Letting a = t, the infinitesimal generators are given by (7) L 1 = L x = x, L 2 = L y = y, and L 3 = L t = t. (12) Thus, (9) automatically yields the standard BCCE (1): δx g x + δy g y + δt g =0. (13) t

5 4 Dynamic spatiotemporal brightness model It has already been emphasized that a constant brightness model has to be refined in order to account for changing object brightness. Along the correct direction in the spatiotemporal domain, the brightness does not remain constant but changes according to the underlying physical process (Fig. 1 b). Hence, we need to find the directions of brightness changes following the corresponding functional relationship, instead of searching iso-brightness lines in the spatiotemporal neighborhood. In the most simple case, the brightness change is known to be linear, consisting of an offset and multiplier field. In [3] and [11] it is shown, that a variety of radiometric transformations can be cast into a linear relationship. It is also evident, that slow brightness variations can be expressed as linear changes in a first-order approximation. In scientific applications, however, dynamic transport processes can lead to fast brightness changes of higher than linear order, such as e. g. exponential decay. Furthermore, some of the transport models are not known as analytical functions but rather as physical laws in terms of differential equations, combining the spatial structure of objects with temporal brightness changes (e. g. diffusion processes). In addition to the spatiotemporal transformation (4), we allow the brightness of moving patterns to change according to a parameterized analytical function h(g) along the spatiotemporal path, where h defines a scalar invertible transformation acting on the image brightness g: g(r )=h(g (r ),b), and g (r )=h 1 (g(r ),b). (14) With b =[b 1,...,b Q ] T we denote the Q-dimensional parameter vector of the brightness change. The primed brightness g (r ) equals the initial brightness g(r) g (r )=g(r), (15) shifted to the position r. Hence, the entire transformation of the spatiotemporal structure can be virtually separated into two steps: 1. transformation without brightness change, g(r) g (r ), according to (4), 2. adjustment of the brightness, g (r ) g(r ), according to (14). If h is analytic in b, we can expand the brightness variation about b =0: g(r )=g (r )+ Q k=1 b k h b k, with h (g (r ), b = 0) =g (r ), (16) where b = 0 is the identity element of the transformation. Let further the spatiotemporal transformation r r be given by a LGOT, i. e. the flow field can be modeled according to (4)-(10). Then, we can express g(r ) in (16) by (8) and get, using (15): g(r) g (r )= P Q h a i L i g b k =0, (17) b k i=1 k=1

6 which constitutes a further generalization of the BCCE for parameterized brightness changes. In case the object brightness remains constant (b = 0), (17) reduces to (9). Again, we can express (17) as a scalar product d T p =0, with d = [ (Lg) T, ( b h) T ] T and p = [ a T, b T ] T, (18) where p denotes the augmented (P + Q)-dimensional parameter vector, containing parameters of both, the spatiotemporal transformation S and the brightness transformation h. Correspondingly, the (P + Q)-dimensional vector d combines the Lie-derivatives in (9) and the gradient of h with respect to the parameters b k. The same way as (1) and (9), (18) is ill-posed and needs to be further constrained in order to estimate the parameter vector p. Assuming p to be constant within a neighborhood U, we can apply (18) to all N pixels of the neighborhood and get the following linear equation system: Gp =0, with G =[d 1,...,d N ] T. (19) Once more, minimization of (19) with respect to p can be carried out by the general framework of TLS estimation (Appendix 1). Example 2 (Translation with exponential decay). If g(r) can be modeled as an exponential decay the brightness variation has the analytical form h(g(r),κ)=g(r )=g(r) exp ( κδt), (20) where the parameter vector b reduces to the scalar decay constant κ. Hence, h(g(r),κ) = δt g(r) exp ( κδt)= δt g(r ). (21) κ Assuming the optical flow to be a constant translation, the Lie-derivatives are given by (12) and (18) reduces to: d T p =0, with d =[g x,g y,g t,g] T, and p =[δx,δy,δt,κδt] T. (22) Example 3 (Translation with diffusion). For patterns that are subject to isotropic diffusion, the temporal brightness variation depends on the spatial structure according to the following differential equation: dg dt = D g=d (g xx + g yy ), (23) where D is the diffusion constant, and g xx and g yy denote the second-order derivatives in the spatial coordinates. In order to turn (23) into an analytical function, we approximate the total differential dg/dt by the discrete difference dg/dt = δt 1 (g(r ) g(r)). Solving for g(r ) yields h(g(r),d)=g(r )=g(r)+dδt g, (24)

7 a b c d frame #0 frame #6 (exponential) frame #6 (diffusion) #0 # 6, exponential # 6, diffusion normalized grey value pixel position Fig. 2. Test sequences for brightness changes. A Gaussian pattern is moving with the velocity [0.8, 0.8] T pixels/frame: a first frame of all sequences b exponential decay, c diffusion d cross sections through the maximum of the Gaussian at the actual position. and h(g(r),d) = δt g. (25) D Together with (12), assuming constant translation, we get from (18): d T p =0, with d =[g x,g y,g t, g] T, and p =[δx, δy, δt, Dδt] T. (26) 5 Results In order to illustrate the performance of the new technique, we applied it to both, computer-generated test sequences with ground-truth, as well as to application examples. The generated test sequences consist of a Gaussian pattern moving with constant translation of f =[0.8,0.8] T pixels/frame (Fig. 2). In addition to the constant brightness case, we created two sequences with the Gaussian being subject to exponential decay and diffusion, respectively. Figure 2 shows the resulting changes of the Gaussian pattern. Table 1 summarizes the results of three different parameterized models applied to all three sequences, namely constant brightness, exponential decay, and diffusion, respectively. It is obvious, that both the optical flow and the model parameters are estimated with high accuracy if the used model fits the underlying transport process. It can also be observed, that all models yield accurate results in case the object remains at constant brightness (first row). In this case, all models correctly estimate the model parameters to equal zero, as this was chosen to be the identity element of the dynamic brightness change. Figure 3 shows an application example from oceanography. The scientific task was to estimate the decay constant of an exponentially decaying heat spot on the ocean surface. In addition to the exponential decay the pattern is subject to deformation according to the underlying turbulent flow field. If the brightess is assumed to remain constant (Fig. 3 c), the estimated flow field is entirely unrealistic. However, using an exponential model for the dynamic changes (Fig. 3 d), the flow field can be accurately estimated together with the physically relevant decay constant κ.

8 Fig. 3. Exponentially decaying heat spot at a wavy water surface. a and b first and last frame of the sequence. c Optical flow field f estimated with the constant brightness assumption. d Optical flow field estimated with an exponential decay model. The decay rate κ is averaged over the area thresholded by the confidence measure. 6 Conclusions We presented a new approach to quantitatively analyze dynamic scenes and processes with high accuracy. The new technique is a straightforward extension of the standard brightness change constraint equation (BCCE) incorporating the spatiotemporal signature of dynamic processes. The presented framework allows to directly incorporate the underlying physical parameters in terms of differential equations. It is not restricted to physical transport processes but can be applied to all scenes that violate the brightness constancy assumption according to some known parametric model. Acknowledgements. We gratefully acknowledge financial support by the Deutsche Forschungsgemeinschaft, DFG, within the frame of the research unit Image Sequence Analysis to Investigate Dynamic Processes. References 1. Duc, B.: Feature design: applications to motion analysis and identity verification. PhD thesis, École Polytechnique Fédérale de Lausanne (1997) 2. Florac, L., W. Niessen, and M. Nielsen: The intrinsic structure of optical flow incorporating measurement duality. Intl. J. Comp. Vis., 27(3), (1998) Hager, G. D., and P. N. Belhumeur: Efficient region tracking with parametric models of geometry and illumination. IEEE PAMI, 20(10), (1998) Haußecker, H., and B. Jähne: A tensor approach for precise computation of dense displacement vector fields. In Informatik aktuell, Paulus, E., Wahl, F. M. (Hrsg.), Mustererkennung 1997, Springer-Verlag: Berlin, Heidelberg (1997) Haußecker, H., and H. Spies: Motion. In Handbook of Computer Vision and Applications, Jähne, B., Haußecker, H., and Geißler, P. (Eds.), Academic Press, (1999) 6. Horn, B. K., and B. G. Schunk: Determining optical flow. AI, 17, (1999) Jähne, B., H. Haußecker, H. Scharr, H. Spies, D. Schmundt, and U. Schurr: Study of dynamical processes with tensor-based spatiotemporal image processing techniques. Proc. ECCV 98 (Vol. 2), Burkhardt, H., and Neumann, B. (Eds.), Springer-Verlag: Berlin, Heidelberg (1998)

9 8. Mühlich, M., and R. Mester: The role of Total Least Squares in motion analysis. Proc. ECCV 98 (Vol. 2), Burkhardt, H., and Neumann, B. (Eds.), Springer-Verlag: Berlin, Heidelberg (1998) Nagel, H.-H.: On a constraint equation for the estimation of displacement rates in image sequences. IEEE PAMI, 11(1), (1989) Nagel, H.-H., and A. Gehrke: Bildbereichsbasierte Verfolgung von Straßenfahrzeugen durch adaptive Schätzung und Segmentierung von Optischen-Flußfeldern. In Informatik aktuell, Levi, P., Ahlers, R.-J., May, F., Schanz, M. (Hrsg.), Mustererkennung 1998, Springer-Verlag: Berlin, Heidelberg (1998) Negahdaripour, S.: Revised definition of optical flow: integration of radiometric and geometric clues for dynamic scene analysis. IEEE PAMI, 20(9), (1998) Ohta, N.: Optical flow detection using a general noise model. IEICE Trans. Inf. & Syst., Vol. E79-D, No. 7 July (1996) Van Huffel, S., and S. Vandewalle: The Total Least Squares Problem: Computational aspects and analysis. SIAM, (1991) Appendix 1: Total Least Squares Method Given the linear equation system Mp = 0, with an N P model Matrix M = [m 1,...,m N ] T, and a P -dimensional parameter vector p, N P, the total least squares method (TLS) seeks to minimize Mp 2. In order to avoid the trivial solution p = 0 we additionally require p T p = 1. Carrying out the minimization by the method of Lagrange multipliers we get p = arg min L(p,λ), L = Mp 2 +λ ( 1 p T p ) = p T Jp+λ ( 1 p T p ), (27) where J = M T M. For the constant brightness model (2), i. e. M = D, the matrix J is called structure tensor [4]. Eq. (27) is solved by forcing the partial derivatives of L with respect to all components of p to equal zero, which leads to the following eigenvalue problem: Jr = λr. It can be shown, that the vector r minimizing (27) is given by the eigenvector of J to the minimum eigenvalue [5]. This corresponds to the right singular vector to the smallest singular value of M ([13],[8]). Hence, the TLS solution can be found by an eigenvalue analysis of J or, alternatively by a singular value decomposition (SVD) of M. Without going further into detail, we want to point out, that confidence measures can be found by analyzing the relative size of the eigenvalues, or singular values, respectively ([4],[5],[10],[12]), which have been used to threshold the results in Fig. 3 and Tab. 1. The components of J are given by J pq = N 1 i=0 m ipm iq. In practical applications the summation can be replaced by a weighted average, i. e. J pq = m p m q = B (m p m q ), where B denotes a (typically binomial) smoothing operator applied to the pointwise product (m p m q ).

10 Table 1. Results of different parameterized brightness constraint models (columns) used to estimate motion and brightness change parameters of test sequences (rows) with constant brightness, exponential decay, and diffusion, respectively. Every sequence is evaluated with all three models. Errors are given for the estimated optical flow field (E f ) and for the model parameters (exponential decay constant E k, and diffusion constant E D; no BC parameter indicates that no additional brightness change parameter is estimated for the constant model). All errors are relative errors (in per cent) and show the mean and standard deviation across an area thresholded by the confidence measure. Dynamic model used for motion and brightness change estimation constant exponential diffusion constant E f =(6.5±7.9) 10 4 no BC parameter E f =(1.4±1.7) 10 2 E k =(6.7±8.2) 10 4 E f =(1.1±1.1) 10 3 E D =(4.8±5.9) 10 3 exponential E f =(4.7±2.6) 10 1 no BC parameter E f =(3.7±3.3) 10 2 E f =(1.9±1.0) 10 1 E k =(2.1±1.1) 10 1 E D =(5.3±0.9) 10 4 diffusion E f =(0.5±1.2) 10 3 no BC parameter E f =(5.8±1.5) 10 2 E k =(1.0±0.0) 10 2 E f =(1.2±0.5) 10 1 E D =(6.7±3.5) 10 2

An Adaptive Confidence Measure for Optical Flows Based on Linear Subspace Projections

An Adaptive Confidence Measure for Optical Flows Based on Linear Subspace Projections An Adaptive Confidence Measure for Optical Flows Based on Linear Subspace Projections Claudia Kondermann, Daniel Kondermann, Bernd Jähne, Christoph Garbe Interdisciplinary Center for Scientific Computing

More information

A New Scheme for Anisotropic Diffusion: Performance Evaluation of Rotation Invariance, Dissipativity and Efficiency no author given no address given A

A New Scheme for Anisotropic Diffusion: Performance Evaluation of Rotation Invariance, Dissipativity and Efficiency no author given no address given A A New Scheme for Anisotropic Diffusion: Performance Evaluation of Rotation Invariance, Dissipativity and Efficiency Hanno Scharr 1 and Joachim Weickert 1 Interdisciplinary Center for Scientific Computing,

More information

Estimation of Surface Flow and Net Heat Flux from Infrared Image Sequences

Estimation of Surface Flow and Net Heat Flux from Infrared Image Sequences Journal of Mathematical Imaging and Vision 19: 159 174, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Estimation of Surface Flow and Net Heat Flux from Infrared Image Sequences

More information

NONLINEAR DIFFUSION PDES

NONLINEAR DIFFUSION PDES NONLINEAR DIFFUSION PDES Erkut Erdem Hacettepe University March 5 th, 0 CONTENTS Perona-Malik Type Nonlinear Diffusion Edge Enhancing Diffusion 5 References 7 PERONA-MALIK TYPE NONLINEAR DIFFUSION The

More information

Sensitivity Curve Approximation using Linear Algebra

Sensitivity Curve Approximation using Linear Algebra Sensitivity Curve Approximation using inear Algebra D. Paulus 1, V. Hong 1, C. Idler 1, J. Hornegger 2,. Csink 3 Universität Koblenz-andau 1 Computervisualistik Universitätsstr. 1 567 Koblenz, Germany

More information

Lucas-Kanade Optical Flow. Computer Vision Carnegie Mellon University (Kris Kitani)

Lucas-Kanade Optical Flow. Computer Vision Carnegie Mellon University (Kris Kitani) Lucas-Kanade Optical Flow Computer Vision 16-385 Carnegie Mellon University (Kris Kitani) I x u + I y v + I t =0 I x = @I @x I y = @I u = dx v = dy I @y t = @I dt dt @t spatial derivative optical flow

More information

Motion Estimation (I) Ce Liu Microsoft Research New England

Motion Estimation (I) Ce Liu Microsoft Research New England Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion

More information

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Stefano Soatto Shankar Sastry Department of EECS, UC Berkeley Department of Computer Sciences, UCLA 30 Cory Hall,

More information

Air-Water Gas Transfer in Coastal Waters

Air-Water Gas Transfer in Coastal Waters LONG-TERM GOAL Air-Water Gas Transfer in Coastal Waters Bernd Jaehne and Jochen Klinke Physical Oceanography Research Division 0230 Scripps Institution of Oceanography La Jolla, CA 92093-0230 phone: (619)

More information

Pose estimation from point and line correspondences

Pose estimation from point and line correspondences Pose estimation from point and line correspondences Giorgio Panin October 17, 008 1 Problem formulation Estimate (in a LSE sense) the pose of an object from N correspondences between known object points

More information

A Riemannian Framework for Denoising Diffusion Tensor Images

A Riemannian Framework for Denoising Diffusion Tensor Images A Riemannian Framework for Denoising Diffusion Tensor Images Manasi Datar No Institute Given Abstract. Diffusion Tensor Imaging (DTI) is a relatively new imaging modality that has been extensively used

More information

A Generative Model Based Approach to Motion Segmentation

A Generative Model Based Approach to Motion Segmentation A Generative Model Based Approach to Motion Segmentation Daniel Cremers 1 and Alan Yuille 2 1 Department of Computer Science University of California at Los Angeles 2 Department of Statistics and Psychology

More information

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented

More information

Lecture 3: The Shape Context

Lecture 3: The Shape Context Lecture 3: The Shape Context Wesley Snyder, Ph.D. UWA, CSSE NCSU, ECE Lecture 3: The Shape Context p. 1/2 Giant Quokka Lecture 3: The Shape Context p. 2/2 The Shape Context Need for invariance Translation,

More information

WINDS FROM METEOSAT AND GMS WV-IMAGERY USING VARIATIONAL TECHNIQUES. M. Rohn. Institut für Meteorologie, Freie Universität Berlin Berlin, F.R.G.

WINDS FROM METEOSAT AND GMS WV-IMAGERY USING VARIATIONAL TECHNIQUES. M. Rohn. Institut für Meteorologie, Freie Universität Berlin Berlin, F.R.G. WINDS FROM METEOSAT AND GMS WV-IMAGERY USING VARIATIONAL TECHNIQUES M. Rohn Institut für Meteorologie, Freie Universität Berlin 14195 Berlin, F.R.G. ABSTRACT A new method is described where motion analysis

More information

Deformation and Viewpoint Invariant Color Histograms

Deformation and Viewpoint Invariant Color Histograms 1 Deformation and Viewpoint Invariant Histograms Justin Domke and Yiannis Aloimonos Computer Vision Laboratory, Department of Computer Science University of Maryland College Park, MD 274, USA domke@cs.umd.edu,

More information

Convex Hodge Decomposition of Image Flows

Convex Hodge Decomposition of Image Flows Convex Hodge Decomposition of Image Flows Jing Yuan 1, Gabriele Steidl 2, Christoph Schnörr 1 1 Image and Pattern Analysis Group, Heidelberg Collaboratory for Image Processing, University of Heidelberg,

More information

CS4495/6495 Introduction to Computer Vision. 6B-L1 Dense flow: Brightness constraint

CS4495/6495 Introduction to Computer Vision. 6B-L1 Dense flow: Brightness constraint CS4495/6495 Introduction to Computer Vision 6B-L1 Dense flow: Brightness constraint Motion estimation techniques Feature-based methods Direct, dense methods Motion estimation techniques Direct, dense methods

More information

EE Camera & Image Formation

EE Camera & Image Formation Electric Electronic Engineering Bogazici University February 21, 2018 Introduction Introduction Camera models Goal: To understand the image acquisition process. Function of the camera Similar to that of

More information

Linear Algebra Practice Problems

Linear Algebra Practice Problems Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a

More information

Optical Flow Estimation from Monogenic Phase

Optical Flow Estimation from Monogenic Phase Optical Flow Estimation from Monogenic Phase Michael Felsberg Linköping University, Computer Vision Laboratory, SE-58183 Linköping, Sweden, mfe@isy.liu.se, http://www.isy.liu.se/cvl/ Abstract. The optical

More information

Determining the Translational Speed of a Camera from Time-Varying Optical Flow

Determining the Translational Speed of a Camera from Time-Varying Optical Flow Determining the Translational Speed of a Camera from Time-Varying Optical Flow Anton van den Hengel, Wojciech Chojnacki, and Michael J. Brooks School of Computer Science, Adelaide University, SA 5005,

More information

The GET Operator. LiTH-ISY-R-2633

The GET Operator. LiTH-ISY-R-2633 The GET Operator Michael Felsberg Linköping University, Computer Vision Laboratory, SE-58183 Linköping, Sweden, mfe@isy.liu.se, http://www.isy.liu.se/cvl/ October 4, 004 LiTH-ISY-R-633 Abstract In this

More information

(a)

(a) Chapter 8 Subspace Methods 8. Introduction Principal Component Analysis (PCA) is applied to the analysis of time series data. In this context we discuss measures of complexity and subspace methods for

More information

Linear Diffusion and Image Processing. Outline

Linear Diffusion and Image Processing. Outline Outline Linear Diffusion and Image Processing Fourier Transform Convolution Image Restoration: Linear Filtering Diffusion Processes for Noise Filtering linear scale space theory Gauss-Laplace pyramid for

More information

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2. APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product

More information

Video and Motion Analysis Computer Vision Carnegie Mellon University (Kris Kitani)

Video and Motion Analysis Computer Vision Carnegie Mellon University (Kris Kitani) Video and Motion Analysis 16-385 Computer Vision Carnegie Mellon University (Kris Kitani) Optical flow used for feature tracking on a drone Interpolated optical flow used for super slow-mo optical flow

More information

Motion Estimation (I)

Motion Estimation (I) Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion

More information

Erkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5.

Erkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5. LINEAR DIFFUSION Erkut Erdem Hacettepe University February 24 th, 2012 CONTENTS 1 Linear Diffusion 1 2 Appendix - The Calculus of Variations 5 References 6 1 LINEAR DIFFUSION The linear diffusion (heat)

More information

COMP 558 lecture 18 Nov. 15, 2010

COMP 558 lecture 18 Nov. 15, 2010 Least squares We have seen several least squares problems thus far, and we will see more in the upcoming lectures. For this reason it is good to have a more general picture of these problems and how to

More information

A Factorization Method for 3D Multi-body Motion Estimation and Segmentation

A Factorization Method for 3D Multi-body Motion Estimation and Segmentation 1 A Factorization Method for 3D Multi-body Motion Estimation and Segmentation René Vidal Department of EECS University of California Berkeley CA 94710 rvidal@eecs.berkeley.edu Stefano Soatto Dept. of Computer

More information

MATH 205C: STATIONARY PHASE LEMMA

MATH 205C: STATIONARY PHASE LEMMA MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)

More information

The structure tensor in projective spaces

The structure tensor in projective spaces The structure tensor in projective spaces Klas Nordberg Computer Vision Laboratory Department of Electrical Engineering Linköping University Sweden Abstract The structure tensor has been used mainly for

More information

Fluid Extensions for Optical Flow and Diffusion-based Image Registration

Fluid Extensions for Optical Flow and Diffusion-based Image Registration Fluid Extensions for Optical Flow and Diffusion-based Image Registration Jens-Peer Kuska 1, Patrick Scheibe 2, Ulf-Dietrich Braumann 2 1 Interdisciplinary Centre for Bioinformatics, University Leipzig,

More information

Computer Vision Motion

Computer Vision Motion Computer Vision Motion Professor Hager http://www.cs.jhu.edu/~hager 12/1/12 CS 461, Copyright G.D. Hager Outline From Stereo to Motion The motion field and optical flow (2D motion) Factorization methods

More information

Calculus of Variations and Computer Vision

Calculus of Variations and Computer Vision Calculus of Variations and Computer Vision Sharat Chandran Page 1 of 23 Computer Science & Engineering Department, Indian Institute of Technology, Bombay. http://www.cse.iitb.ernet.in/ sharat January 8,

More information

A Probabilistic Definition of Intrinsic Dimensionality for Images

A Probabilistic Definition of Intrinsic Dimensionality for Images A Probabilistic Definition of Intrinsic Dimensionality for Images Michael Felsberg 1 and Norbert Krüger 2 1 Computer Vision Laboratory, Dept. of Electrical Engineering, Linköping University SE-58183 Linköping,

More information

Discriminative Direction for Kernel Classifiers

Discriminative Direction for Kernel Classifiers Discriminative Direction for Kernel Classifiers Polina Golland Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139 polina@ai.mit.edu Abstract In many scientific and engineering

More information

Do We Really Have to Consider Covariance Matrices for Image Feature Points?

Do We Really Have to Consider Covariance Matrices for Image Feature Points? Electronics and Communications in Japan, Part 3, Vol. 86, No. 1, 2003 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J85-A, No. 2, February 2002, pp. 231 239 Do We Really Have to Consider Covariance

More information

Augmented Reality VU Camera Registration. Prof. Vincent Lepetit

Augmented Reality VU Camera Registration. Prof. Vincent Lepetit Augmented Reality VU Camera Registration Prof. Vincent Lepetit Different Approaches to Vision-based 3D Tracking [From D. Wagner] [From Drummond PAMI02] [From Davison ICCV01] Consider natural features Consider

More information

Affine Normalization of Symmetric Objects

Affine Normalization of Symmetric Objects Affine Normalization of Symmetric Objects Tomáš Suk and Jan Flusser Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 4, 182 08 Prague 8, Czech

More information

II. DIFFERENTIABLE MANIFOLDS. Washington Mio CENTER FOR APPLIED VISION AND IMAGING SCIENCES

II. DIFFERENTIABLE MANIFOLDS. Washington Mio CENTER FOR APPLIED VISION AND IMAGING SCIENCES II. DIFFERENTIABLE MANIFOLDS Washington Mio Anuj Srivastava and Xiuwen Liu (Illustrations by D. Badlyans) CENTER FOR APPLIED VISION AND IMAGING SCIENCES Florida State University WHY MANIFOLDS? Non-linearity

More information

Dense Optical Flow Estimation from the Monogenic Curvature Tensor

Dense Optical Flow Estimation from the Monogenic Curvature Tensor Dense Optical Flow Estimation from the Monogenic Curvature Tensor Di Zang 1, Lennart Wietzke 1, Christian Schmaltz 2, and Gerald Sommer 1 1 Department of Computer Science, Christian-Albrechts-University

More information

Determining Constant Optical Flow

Determining Constant Optical Flow Determining Constant Optical Flow Berthold K.P. Horn Copyright 003 The original optical flow algorithm [1] dealt with a flow field that could vary from place to place in the image, as would typically occur

More information

Non-linear Dimensionality Reduction

Non-linear Dimensionality Reduction Non-linear Dimensionality Reduction CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Introduction Laplacian Eigenmaps Locally Linear Embedding (LLE)

More information

DISCRIMINATION AND IDENTIFICATION OF UNEXPLODED ORDINANCES (UXO) USING AIRBORNE MAGNETIC GRADIENTS

DISCRIMINATION AND IDENTIFICATION OF UNEXPLODED ORDINANCES (UXO) USING AIRBORNE MAGNETIC GRADIENTS DISCRIMINATION AND IDENTIFICATION OF UNEXPLODED ORDINANCES (UXO) USING AIRBORNE MAGNETIC GRADIENTS M.C. Jeoffreys Abstract The problem of discriminating the magnetic dipoles of objects on the surface of

More information

Nonlinear Diffusion. Journal Club Presentation. Xiaowei Zhou

Nonlinear Diffusion. Journal Club Presentation. Xiaowei Zhou 1 / 41 Journal Club Presentation Xiaowei Zhou Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology 2009-12-11 2 / 41 Outline 1 Motivation Diffusion process

More information

Spectral Processing. Misha Kazhdan

Spectral Processing. Misha Kazhdan Spectral Processing Misha Kazhdan [Taubin, 1995] A Signal Processing Approach to Fair Surface Design [Desbrun, et al., 1999] Implicit Fairing of Arbitrary Meshes [Vallet and Levy, 2008] Spectral Geometry

More information

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Review of Edge Detectors #2 Today s Lecture Interest Points Detection What do we mean with Interest Point Detection in an Image Goal:

More information

CN780 Final Lecture. Low-Level Vision, Scale-Space, and Polyakov Action. Neil I. Weisenfeld

CN780 Final Lecture. Low-Level Vision, Scale-Space, and Polyakov Action. Neil I. Weisenfeld CN780 Final Lecture Low-Level Vision, Scale-Space, and Polyakov Action Neil I. Weisenfeld Department of Cognitive and Neural Systems Boston University chapter 14.2-14.3 May 9, 2005 p.1/25 Introduction

More information

Human Pose Tracking I: Basics. David Fleet University of Toronto

Human Pose Tracking I: Basics. David Fleet University of Toronto Human Pose Tracking I: Basics David Fleet University of Toronto CIFAR Summer School, 2009 Looking at People Challenges: Complex pose / motion People have many degrees of freedom, comprising an articulated

More information

6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005

6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005 6.869 Advances in Computer Vision Prof. Bill Freeman March 1 2005 1 2 Local Features Matching points across images important for: object identification instance recognition object class recognition pose

More information

Nonlinear Autonomous Systems of Differential

Nonlinear Autonomous Systems of Differential Chapter 4 Nonlinear Autonomous Systems of Differential Equations 4.0 The Phase Plane: Linear Systems 4.0.1 Introduction Consider a system of the form x = A(x), (4.0.1) where A is independent of t. Such

More information

APPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS

APPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS APPROXIMATE SOLUTION OF A SYSTEM OF LINEAR EQUATIONS WITH RANDOM PERTURBATIONS P. Date paresh.date@brunel.ac.uk Center for Analysis of Risk and Optimisation Modelling Applications, Department of Mathematical

More information

Lecture 7: Edge Detection

Lecture 7: Edge Detection #1 Lecture 7: Edge Detection Saad J Bedros sbedros@umn.edu Review From Last Lecture Definition of an Edge First Order Derivative Approximation as Edge Detector #2 This Lecture Examples of Edge Detection

More information

Nonlinear Diffusion. 1 Introduction: Motivation for non-standard diffusion

Nonlinear Diffusion. 1 Introduction: Motivation for non-standard diffusion Nonlinear Diffusion These notes summarize the way I present this material, for my benefit. But everything in here is said in more detail, and better, in Weickert s paper. 1 Introduction: Motivation for

More information

Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations

Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations Lihi Zelnik-Manor Michal Irani Dept. of Computer Science and Applied Math The Weizmann Institute of Science

More information

100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX

100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX 100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX.1 Norms If we have an approximate solution at a given point and we want to calculate the absolute error, then we simply take the magnitude

More information

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Last Lecture : Edge Detection Preprocessing of image is desired to eliminate or at least minimize noise effects There is always tradeoff

More information

Feature Vector Similarity Based on Local Structure

Feature Vector Similarity Based on Local Structure Feature Vector Similarity Based on Local Structure Evgeniya Balmachnova, Luc Florack, and Bart ter Haar Romeny Eindhoven University of Technology, P.O. Box 53, 5600 MB Eindhoven, The Netherlands {E.Balmachnova,L.M.J.Florack,B.M.terHaarRomeny}@tue.nl

More information

Optic Flow Computation with High Accuracy

Optic Flow Computation with High Accuracy Cognitive Computer Vision Colloquium Prague, January 12 13, 2004 Optic Flow Computation with High ccuracy Joachim Weickert Saarland University Saarbrücken, Germany joint work with Thomas Brox ndrés Bruhn

More information

Chapter 3 Numerical Methods

Chapter 3 Numerical Methods Chapter 3 Numerical Methods Part 3 3.4 Differential Algebraic Systems 3.5 Integration of Differential Equations 1 Outline 3.4 Differential Algebraic Systems 3.4.1 Constrained Dynamics 3.4.2 First and Second

More information

Image Analysis. Feature extraction: corners and blobs

Image Analysis. Feature extraction: corners and blobs Image Analysis Feature extraction: corners and blobs Christophoros Nikou cnikou@cs.uoi.gr Images taken from: Computer Vision course by Svetlana Lazebnik, University of North Carolina at Chapel Hill (http://www.cs.unc.edu/~lazebnik/spring10/).

More information

Nonlinear stabilization via a linear observability

Nonlinear stabilization via a linear observability via a linear observability Kaïs Ammari Department of Mathematics University of Monastir Joint work with Fathia Alabau-Boussouira Collocated feedback stabilization Outline 1 Introduction and main result

More information

PROBABILISTIC CONTINUOUS EDGE DETECTION USING LOCAL SYMMETRY

PROBABILISTIC CONTINUOUS EDGE DETECTION USING LOCAL SYMMETRY PROBABILISTIC CONTINUOUS EDGE DETECTION USING LOCAL SYMMETRY Gerald Mwangi, Paul Fieguth, Christoph S. Garbe : University of Heidelberg, Germany, : University of Waterloo, Canada ABSTRACT We describe a

More information

Approximating the Best Linear Unbiased Estimator of Non-Gaussian Signals with Gaussian Noise

Approximating the Best Linear Unbiased Estimator of Non-Gaussian Signals with Gaussian Noise IEICE Transactions on Information and Systems, vol.e91-d, no.5, pp.1577-1580, 2008. 1 Approximating the Best Linear Unbiased Estimator of Non-Gaussian Signals with Gaussian Noise Masashi Sugiyama (sugi@cs.titech.ac.jp)

More information

EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6)

EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6) EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement to the material discussed in

More information

Non Linear Observation Equation For Motion Estimation

Non Linear Observation Equation For Motion Estimation Non Linear Observation Equation For Motion Estimation Dominique Béréziat, Isabelle Herlin To cite this version: Dominique Béréziat, Isabelle Herlin. Non Linear Observation Equation For Motion Estimation.

More information

Incremental identification of transport phenomena in wavy films

Incremental identification of transport phenomena in wavy films 17 th European Symposium on Computer Aided Process Engineering ESCAPE17 V. Plesu and P.S. Agachi (Editors) 2007 Elsevier B.V. All rights reserved. 1 Incremental identification of transport phenomena in

More information

Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction

Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction Problem Jörg-M. Sautter Mathematisches Institut, Universität Düsseldorf, Germany, sautter@am.uni-duesseldorf.de

More information

DUAL REGULARIZED TOTAL LEAST SQUARES SOLUTION FROM TWO-PARAMETER TRUST-REGION ALGORITHM. Geunseop Lee

DUAL REGULARIZED TOTAL LEAST SQUARES SOLUTION FROM TWO-PARAMETER TRUST-REGION ALGORITHM. Geunseop Lee J. Korean Math. Soc. 0 (0), No. 0, pp. 1 0 https://doi.org/10.4134/jkms.j160152 pissn: 0304-9914 / eissn: 2234-3008 DUAL REGULARIZED TOTAL LEAST SQUARES SOLUTION FROM TWO-PARAMETER TRUST-REGION ALGORITHM

More information

A NEW NONLINEAR FILTER

A NEW NONLINEAR FILTER COMMUNICATIONS IN INFORMATION AND SYSTEMS c 006 International Press Vol 6, No 3, pp 03-0, 006 004 A NEW NONLINEAR FILTER ROBERT J ELLIOTT AND SIMON HAYKIN Abstract A discrete time filter is constructed

More information

. D CR Nomenclature D 1

. D CR Nomenclature D 1 . D CR Nomenclature D 1 Appendix D: CR NOMENCLATURE D 2 The notation used by different investigators working in CR formulations has not coalesced, since the topic is in flux. This Appendix identifies the

More information

Foundations of Computer Vision

Foundations of Computer Vision Foundations of Computer Vision Wesley. E. Snyder North Carolina State University Hairong Qi University of Tennessee, Knoxville Last Edited February 8, 2017 1 3.2. A BRIEF REVIEW OF LINEAR ALGEBRA Apply

More information

Introduction to motion correspondence

Introduction to motion correspondence Introduction to motion correspondence 1 IPAM - UCLA July 24, 2013 Iasonas Kokkinos Center for Visual Computing Ecole Centrale Paris / INRIA Saclay Why estimate visual motion? 2 Tracking Segmentation Structure

More information

Performance Evaluation of Generalized Polynomial Chaos

Performance Evaluation of Generalized Polynomial Chaos Performance Evaluation of Generalized Polynomial Chaos Dongbin Xiu, Didier Lucor, C.-H. Su, and George Em Karniadakis 1 Division of Applied Mathematics, Brown University, Providence, RI 02912, USA, gk@dam.brown.edu

More information

q t = F q x. (1) is a flux of q due to diffusion. Although very complex parameterizations for F q

q t = F q x. (1) is a flux of q due to diffusion. Although very complex parameterizations for F q ! Revised Tuesday, December 8, 015! 1 Chapter 7: Diffusion Copyright 015, David A. Randall 7.1! Introduction Diffusion is a macroscopic statistical description of microscopic advection. Here microscopic

More information

Change of Ordering for Regular Chains in Positive Dimension

Change of Ordering for Regular Chains in Positive Dimension Change of Ordering for Regular Chains in Positive Dimension X. Dahan, X. Jin, M. Moreno Maza, É. Schost University of Western Ontario, London, Ontario, Canada. École polytechnique, 91128 Palaiseau, France.

More information

Structural Dynamics Lecture 4. Outline of Lecture 4. Multi-Degree-of-Freedom Systems. Formulation of Equations of Motions. Undamped Eigenvibrations.

Structural Dynamics Lecture 4. Outline of Lecture 4. Multi-Degree-of-Freedom Systems. Formulation of Equations of Motions. Undamped Eigenvibrations. Outline of Multi-Degree-of-Freedom Systems Formulation of Equations of Motions. Newton s 2 nd Law Applied to Free Masses. D Alembert s Principle. Basic Equations of Motion for Forced Vibrations of Linear

More information

4. Complex Oscillations

4. Complex Oscillations 4. Complex Oscillations The most common use of complex numbers in physics is for analyzing oscillations and waves. We will illustrate this with a simple but crucially important model, the damped harmonic

More information

Energy Tensors: Quadratic, Phase Invariant Image Operators

Energy Tensors: Quadratic, Phase Invariant Image Operators Energy Tensors: Quadratic, Phase Invariant Image Operators Michael Felsberg and Erik Jonsson Linköping University, Computer Vision Laboratory, SE-58183 Linköping, Sweden Abstract. In this paper we briefly

More information

Lecture No 1 Introduction to Diffusion equations The heat equat

Lecture No 1 Introduction to Diffusion equations The heat equat Lecture No 1 Introduction to Diffusion equations The heat equation Columbia University IAS summer program June, 2009 Outline of the lectures We will discuss some basic models of diffusion equations and

More information

Using Hankel structured low-rank approximation for sparse signal recovery

Using Hankel structured low-rank approximation for sparse signal recovery Using Hankel structured low-rank approximation for sparse signal recovery Ivan Markovsky 1 and Pier Luigi Dragotti 2 Department ELEC Vrije Universiteit Brussel (VUB) Pleinlaan 2, Building K, B-1050 Brussels,

More information

Maximum variance formulation

Maximum variance formulation 12.1. Principal Component Analysis 561 Figure 12.2 Principal component analysis seeks a space of lower dimensionality, known as the principal subspace and denoted by the magenta line, such that the orthogonal

More information

CLASS NOTES Computational Methods for Engineering Applications I Spring 2015

CLASS NOTES Computational Methods for Engineering Applications I Spring 2015 CLASS NOTES Computational Methods for Engineering Applications I Spring 2015 Petros Koumoutsakos Gerardo Tauriello (Last update: July 27, 2015) IMPORTANT DISCLAIMERS 1. REFERENCES: Much of the material

More information

ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT

ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT ENERGY METHODS IN IMAGE PROCESSING WITH EDGE ENHANCEMENT PRASHANT ATHAVALE Abstract. Digital images are can be realized as L 2 (R 2 objects. Noise is introduced in a digital image due to various reasons.

More information

Linear Algebra Review (Course Notes for Math 308H - Spring 2016)

Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Dr. Michael S. Pilant February 12, 2016 1 Background: We begin with one of the most fundamental notions in R 2, distance. Letting (x 1,

More information

Math 302 Outcome Statements Winter 2013

Math 302 Outcome Statements Winter 2013 Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a

More information

Single-Image-Based Rain and Snow Removal Using Multi-guided Filter

Single-Image-Based Rain and Snow Removal Using Multi-guided Filter Single-Image-Based Rain and Snow Removal Using Multi-guided Filter Xianhui Zheng 1, Yinghao Liao 1,,WeiGuo 2, Xueyang Fu 2, and Xinghao Ding 2 1 Department of Electronic Engineering, Xiamen University,

More information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Dr Gerhard Roth COMP 40A Winter 05 Version Linear algebra Is an important area of mathematics It is the basis of computer vision Is very widely taught, and there are many resources

More information

ROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES

ROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES ROBUST BLIND CALIBRATION VIA TOTAL LEAST SQUARES John Lipor Laura Balzano University of Michigan, Ann Arbor Department of Electrical and Computer Engineering {lipor,girasole}@umich.edu ABSTRACT This paper

More information

A New Efficient Method for Producing Global Affine Invariants

A New Efficient Method for Producing Global Affine Invariants A New Efficient Method for Producing Global Affine Invariants Esa Rahtu, Mikko Salo 2, and Janne Heikkilä Machine Vision Group, Department of Electrical and Information Engineering, P.O. Box 45, 94 University

More information

Image enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding

Image enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding 13 Why image enhancement? Image enhancement Example of artifacts caused by image encoding Computer Vision, Lecture 14 Michael Felsberg Computer Vision Laboratory Department of Electrical Engineering 12

More information

Camera Models and Affine Multiple Views Geometry

Camera Models and Affine Multiple Views Geometry Camera Models and Affine Multiple Views Geometry Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in May 29, 2001 1 1 Camera Models A Camera transforms a 3D

More information

DS-GA 1002 Lecture notes 10 November 23, Linear models

DS-GA 1002 Lecture notes 10 November 23, Linear models DS-GA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.

More information

A Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing

A Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 12, NO. 5, SEPTEMBER 2001 1215 A Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing Da-Zheng Feng, Zheng Bao, Xian-Da Zhang

More information

Statistical Geometry Processing Winter Semester 2011/2012

Statistical Geometry Processing Winter Semester 2011/2012 Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian

More information

Let us recall in a nutshell the definition of some important algebraic structure, increasingly more refined than that of group.

Let us recall in a nutshell the definition of some important algebraic structure, increasingly more refined than that of group. Chapter 1 SOME MATHEMATICAL TOOLS 1.1 Some definitions in algebra Let us recall in a nutshell the definition of some important algebraic structure, increasingly more refined than that of group. Ring A

More information

Simulation of CESR-c Luminosity from Beam Functions

Simulation of CESR-c Luminosity from Beam Functions Simulation of CESR-c Luminosity from Beam Functions Abhijit C. Mehta Trinity College, Duke University, Durham, North Carolina, 27708 (Dated: August 13, 2004) It is desirable to have the ability to compute

More information

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros Corners, Blobs & Descriptors With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros Motivation: Build a Panorama M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 How do we build panorama?

More information