IMAGE INVARIANTS. Andrej Košir, Jurij F. Tasič

Size: px
Start display at page:

Download "IMAGE INVARIANTS. Andrej Košir, Jurij F. Tasič"

Transcription

1 IMAGE INVARIANTS Andrej Košir, Jurij F. Tasič University of Ljubljana Faculty of Electrical Engineering Tržaška 25, Ljubljana, Slovenia ABSTRACT A pre-processing technique for image features extraction is presented in the paper. It is based on algebraic properties of image transform ψ that are invariant to a given geometrical transformation of an image. A vector space H of digital images is introduced. Image invariant is represented by a family of linear maps R. A linear transform ψ defined on a space of images H pertained to a given image invariant R is constructed. The main idea of this paper is contained in a property of map ψ, that maps all images sharing the same feature described by a family R into a single point. Gained information of the digital image extracted by the transform ψ is suitable for further analysis of image features. Some examples of families R are presented. An example of an introduced transform ψ pertained to a given family R is described. 1. INTRODUCTION An important part of image feature extraction is development of pre-processing techniques. Feature extraction can be seen as a controled loosing of information brought by a picture. In order to do so, we first have to disregard an irrelevant information and preserve an important part of it. This is the main goal of our proposed pre-processing technique. We describe a transform that maps all images sharing the same feature into a single point. Image invariants are object descriptors that remain unchanged under different image transformations, which appear in image acquisition and digital image processing. In this paper they are described in terms of a family of mappings R. Theoretical consideration and construction of a map ψ : H C for particular image invariants extraction is presented in the paper. A solution presented in the paper is construction of a linear map with desired properties which then can be applied as an on-line pre-processing algorithm. An important part of this paper is introduction of a vector space of images H that allows us theoretical consideration as well as comfortable implementation of the proposed technique. 2. VECTOR SPACE OF IMAGES In order to analyse image invariants we define a vector space H of digital images. A model for definition of a space H introduced here is a mechanism image intensity adjustment as implemented in a human eye. A computer representation of a digital image is n m matrix of intensity values ranging in an interval I. The difficulty here is that a vector space structure can not be simply added to a set I n m. We overcome this problem by introducing an equivalent relation, which defines a vector space of images, appropriate for theoretical consideration and computer representation. In order to achieve it we introduce a set l c ( Z 2 ) = {s : Z 2 IR; s(i, j) = 0 a.e.} of all functions on Z 2 with nonzero values at only finally many points (i, j) Z. We also introduce a map where Λ : l c ( Z 2 ) L 2 (IR 2 ) s s Sink, Sink(x, y) = c sin(ω 1x) sin(ω 2 y) x y and f g denotes a convolution of functions f and g. It is known that the map Λ is injective and though bijective on its image ImΛ L 2 (IR 2 ). It is desirable all images we are dealing with should have the same resolution. Let us now chose arbitrary but fixed m, n IN as an image resolution and define W R = [1, n] [1, m], W Z = W R Z 2. Since a map Λ is injective any image s l c ( Z 2 ) can be mapped into Λ(s) L 2 (IR 2 ) and then resample to a fixed resolution m n. If a procedure of resampling is denoted by Rs : l c ( Z 2 ) l c ( Z 2 ), a map P 1 = Λ Rs

2 is a projection on l c ( Z 2 ). A relation P1 2 = P 1 is obviously valid. From the construction of a projection P 1 we can see for any s l c ( Z 2 ) and (i, j) W Z the following relation holds, (P 1 s)(i, j) = 0. It is reasonable an image ImP 1 is denoted by ImP 1 = l(w Z ) = {s : W Z IR}. Now we can focus on suitable image intensity normalization. It is accomplished as follows. All intensity values s(i, j) of an image s l(w Z ) are linearly interpolated between their minima min s(i, j), (i, j W z ) and their maxima max s(i, j), (i, j W z ). Therefore a projection P 2 : l c ( Z 2 ) l c ( Z 2 ) defined by ( (P 2 s)(i, j) = ) {s(k, l)}s(i, j) + min{s(k, l)}(1 s(i, j)). max k,l i,j Clearly ImP 2 = l(w Z ). A construction of P 1 and P 2 shows that P 1 normalises a resolution of the digital image and P 2 normalises its intensity. Another important feature we have achieved is (P 2 s)(i, j) I for any s l c ( Z 2 ) and I is a bounded interval. From this we conclude it is suitable to project a set of images l c ( Z 2 ) by a projection P = P 2 P 1. A definition of a vector space of digital images we are introducing in this paper is based on this projection. First we point out that a set l c ( Z 2 ) has a canonical vector space structure over a field IR. We also observe that a relation s 1 s 2 d P (s 1 ) = P (s 2 ) is an equivalent relation on l c ( Z 2 ). Finally we define a vector space of images H = l c ( Z 2 )/. Its members are equivalent classes [s] = {s 1 l c ( Z 2 ) : s 1 s}, denoted by capital letters A, B,.... Space H inherits a vector space structure of l c ( Z 2 ) over a field IR and we have λ[s] = [λs], s l c ( Z 2 ), [s 1 ] + [s 2 ] = [s 1 + s 2 ] This concludes a definition of a vector space of images H. The obtained space is suitable for theoretical consideration. On the other side, a computer representation of a real matrix s l c ( Z 2 ) equals to P (s) H. From the equality P (E ij ) = E ij, where {E ij : ij} is a standard base of l(w Z ), follows that a base of the space H is again {E ij : ij} and its dimension equals to the dimension of L(W Z ). Note that multiplication by λ > 0 of an image A H results to the same image s and multiplication by λ < 0 results to a negative of an image A. This is rather strange but desirable property of introduced vector space of images H. 3. IMAGE INVARIANTS DESCRIPTION AND DECOMPOSITION OF H Image invariants are descriptors that remain unchanged under different geometrical image transformation which arise in image acquisition and digital image processing. We describe them in terms of a family of mappings on a vector space H and in terms of subsets of a space H. The most important examples of geometrical transformations are translation, rotation and scaling. First we introduce a parameter set T and denote a family of transforms on space H by R = {R(t) : H H; t T }. For example, when rotation is considered, for a given image A H a set of images {R(t)A; t T } is simply a set of rotated images A. About our notation, for s l c ( Z 2 ), A = P (s) we write R(t)A = R(t)[s] = [R(t)s]. An elegant way of describing family R is by embedding a set of image pixels indices {1,..., n} {1,..., m} into complex numbers C. A well known structure of Mobious transforms can be applied for description and for analysis of different image transforms. An aim of image invariants description is a decomposition of space H suitable for further image feature analysis. For obvious reasons we wish such a decomposition would be a partition, H = H 1... H n. Subsets H i are disjoint and should be generated by the introduced family R describing chosen geometrical transformations. Let us choose a family of maps R. There is a subset L A H pertained to a given image A H defined by L A = {R(t)A; t T }. We wish a subset L A be a vector subspace of H. Unfortunately, this is usually not possible to achieve. We still

3 consider this situation here in order to examine desired properties of such decomposition. To do so we have to guarantee a conclusion λ 1 A 1 + λ 2 A 2 L A. For any A 1, A 2 L A and λ 1, λ 2 IR, there must exist such t T and λ IR that λr(t)a = λ 1 R(t 1 )A + λ 2 R(t 2 )A, where R(t 1 )A = A 1 and R(t 2 )A = A 2. In order to satisfy the above condition, family R should meet the following property, for any λ 1, λ 2 IR and t 1, t 2 T there must exists λ IR and t T such that λ 1 R(t 1 ) + λ 2 R(t 2 ) = λr(t). (1) When the above conclusion is valid for a chosen family R, we can define a subset L R H independently from a chosen image A H, and binary operation on H satisfying a relation where L A = L R A, L R A = {B A; B L}. An example of operation could be matrix multiplication. We have got another description of image invariant in terms of a subsets of a space H given by L R H when L A is a subset in H for any A H 4. GROUP ACTION AND FAMILY R In previous section we have shown that the introduced family R brings a desirable decomposition of a vector space of images H. If a set L A is not a subspace in H, we have to apply new techniques for describing a decomposition of H. In this paper we propose to use a group action technique. First we briefly introduce it, for more information see [4]. Let (G, ) be a group and let M be a set. A group action of a group (G, ) on set M is a map G M M (g, u) g u for which the following is valid: (i) e u = u for group identity e and u M; (ii) g (h u) = (g h) u for any g, h G and u M; There are two sets playing the major role here, a stabilisator of u M S(u) = {g G : g u = u} and an orbit of u M O(u) = {g u : g G}. Their meaning derives from the following facts. S(u) is an invariant subgroup of a group G and in the case G is finite an index of a subgroup S(u) equals to the number of elements in orbit O(u), we write [G : S(u)] = O(u). Since orbits are disjoined sets and any element of M is contained in some orbit, a space M can be decomposed, M = O(u). u M We apply a group action to describe a decomposition of the space H regarding a family R = {R(t) : t T } by introducing a group structure to a parameter set T. If a group operation is again denoted by, then a group action of a group (T, ) on a space of images H is defined by t A = R(t)A, t T, A H. An aim of such decomposition is exactly the same as in described in the previous section. In the case of different image analysis like object recognition the same property should be assigned to all images from an orbit S(u). A presence and absence of one particular object of the digital image does not depend on its rotation, for instance. We can introduce an equivalent relation to a space of images H regarding a family R, A R B. It is reasonable to define an object extraction map not on H but on a quotient space H/ R. We will consider such definition later. 5. DESCRIPTION OF A FAMILY R In this section a description of image invariants as a family of maps R is presented. We can not simply describe it as a map on a set of indices Z 2. For instance, in the case where a rotation is considered, it may happen that for (i, j) Z 2 a rotated index (i cos(t) + j sin(t), i cos(t) + j sin(t)) is not a point of a set Z 2. This is the reason why we have to move from a set of indices Z 2 to a IR 2, perform a transformation on IR 2 and then project a result back on Z 2. Let g : IR 2 IR 2 be a bounded function (both coordinates are bounded in IR). The following diagram shows how a function g defines an image transformation on l c ( Z 2 ), l c ( Z 2 ) Λ L 2 (IR 2 ) Γ h L 2 (IR 2 ) Rs l c ( Z 2 ),

4 where for w L 2 (IR) we write (Γ h w)(x, y) = w(h(x, y)). When a function h is given, a pertained image transformation R is defined by a compositum R = Rs Γ h Λ : l c ( Z 2 ) l c ( Z 2 ). A transformation on a space H is then given by a commutative diagram l c ( Z 2 ) Λ L 2 (IR 2 ) P H 6. EXAMPLES OF INVARIANTS The most important image invariants are rotation, translation and scaling. Since we will need their definition later we introduce a pertained functions on IR 2 describing them in terms of a previous section. To a given function h : L 2 (IR 2 ) L 2 (IR 2 ) a parameter t T must be added in order to describe a family of image invariants R = {R(t) : t T }. So we have h : L 2 (IR 2 ) T L 2 (IR 2 ). Since the family of invariants is uniquely defined by a family of maps h all is left to be described is such a family of maps ROTATION For the case of rotation we chose T [0, 1] and define h 1 R(x, y, t) = x cos(2πt) + y sin(2πt), h 2 R(x, y, t) = x sin(2πt) + y cos(2πt) TRANSLATION If a maximum possible shift toward main axes are chosen N x, N y respectively, we chose T [0, 1] 2 and h 1 H(x, y, t 1, t 2 ) = x + t 1 N x, h 2 H(x, y, t 1, t 2 ) = y + t 2 N y SCALING A parameter space for scaling is chosen T [0, 1]. If a maximum scaling factor equals to N we define h 1 S(x, y, t) = tnx, h 2 S(x, y, t) = tny. 7. MAP ψ Up to this point we have prepared all what is needed for description of properties of a map ψ : H H. It is said a family R = {R(t) : t T } is invariant for a map Ψ if for any A H the following is valid, ψ(a) = ψ(r(t)a), t T. The reason for such definition is obvious. In order to extract a given feature of the digital image for which a rotation of an image is irrelevant, an information on rotation should be disregarded. To ignore such a property, all images containing the same object should be mapped into a single point. When different positions of an object of an image A H is described as R(t)A, the above definition gives us desired properties to a map ψ. In terms of group action, we introduce a group structure to a parameter space T. The above definition then says an image ψ(o(a)) of an orbit O(A) must be a single point. A group action techniques is then a useful tool for constructing maps on H possesing desired invariants. 7.1 AN EXAMPLE OF MAP ψ To conclude this section we briefly describe a construction of a map on H with invariants described above, i.e. translation, rotation and scaling. Let A H and A = P (s). A construction is evolved on an image r l c ( Z). Consider a rotated, scaled and translated replica s(x, y) = r(h S (h H (h R (x, y, α), x 0, y 0 ), ))) = r((x cos(α) + y sin(α)) x 0, ( x sin(α) + y cos(α)) y 0 ), where α is rotation angle, scale factor and x 0, y 0 transitional offsets. The Fourier transforms of r and s are related by S(u, v) = e iφ(u,v) 1 R(ρ 1 (u cos(α) + v sin(α)) x 2 0, 1 ( u sin(α) + v cos(α)) y 0 ), In order to derive a transformation possessing desired properties, we have to eliminate parameters describing geometrical transformations, i.e. rotation angle α, scale factor s and translation offsets x 0 and y 0. We observe that spectral magnitude S(u, v) is translation invariant. Let us denote r p (θ, ρ) = R(ρ cos θ, ρ sin θ) s p (θ, ρ) = S(ρ cos θ, ρ sin θ). Spectral magnitude is a periodic function of the polar angle θ. Since the original image is real, r p (θ + kπ, ρ) = r p (θ, ρ), k Z.

5 Half of the magnitude field is then sufficient to preserve required information. Trigonometric relations 1 (u cos(α) + v sin(α)) = ρ cos(θ α) 1 ( u sin(α) + v cos(α)) = ρ sin(θ α) lead us to s p (θ, ρ) = 1 2 r p(θ α, ρ/). Image rotation shifts the function s p (θ, ρ) along the angular axis and it can be reduced by using a logarithmic scale for radial coordinates. For λ = log(ρ) and κ = log() we define polar-logaritmic representations r pl (θ, λ) = r p (θ, ρ) s pl (θ, λ) = s p (θ, ρ) = 1 ρ 2 r pl(t α, λ κ). By Fourier transforming the above relations we obtain 9. REFERENCES [1] E. Rivilin, I. Weis Local Invariants for Recognition IEEE Transaction on pattern analysis and machine intelligence, vol. 17, No. 3, January [2] F. Heijden Edge and Line Feature Extraction Based on Covariance Models IEEE Transaction on pattern analysis and machine intelligence, vol. 17, No. 1, January [3] Q. Chen, M. Defrise, F. Deconinck Symetric Phase-Only Matched Filtering of Fourier-Mellin Transform for Image Registration and Recognition IEEE Transactions on pattern analysis and machine intelligence, vol. 16, No. 12, December [4] I. A. Faradžev Investigations in algebraic theory of combinatorial objects Kluwer & Co., Boston S pl (ζ, ξ) = 1 2 e 2πi(ζκ+ξα) R pl (ζ, ξ). We have acchived rotation and scaling now appear as phase shifts. It shows that a description r pl (θ, λ) is independent of parameters ρ, l, x 0 and y 0 and a map r(x, y) r pl (θ, λ) is then invariant to rotation, shift and scaling what was our goal. If we define ( ψr)(x, y) = r pl (ζ, ξ), a map ψ is obviously invariant on translation, rotation and scaling. Finally we define ψ(a) = [ ψs] = P ( ψs), where s l c ( Z 2 ) and A = [s] = P (s) H. 8. CONCLUSION We have proposed a pre-processing technique for digital image features extraction. It is based on an introduced map ψ that is invariant to a given geometrical transformation of a digital image. An example of such a map with desired properties is presented in a paper. It is defined on an introduced vector space of images H suitable for theoretical consideration as well as for a computer implementation. A description of image invariance is also included in the paper. An aim of a map ψ is an extraction an irrelevant information from a digital image and is used as a pre-processing for different image feature extraction, mainly object recognition.

A Method for Blur and Similarity Transform Invariant Object Recognition

A Method for Blur and Similarity Transform Invariant Object Recognition A Method for Blur and Similarity Transform Invariant Object Recognition Ville Ojansivu and Janne Heikkilä Machine Vision Group, Department of Electrical and Information Engineering, University of Oulu,

More information

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition

More information

= ϕ r cos θ. 0 cos ξ sin ξ and sin ξ cos ξ. sin ξ 0 cos ξ

= ϕ r cos θ. 0 cos ξ sin ξ and sin ξ cos ξ. sin ξ 0 cos ξ 8. The Banach-Tarski paradox May, 2012 The Banach-Tarski paradox is that a unit ball in Euclidean -space can be decomposed into finitely many parts which can then be reassembled to form two unit balls

More information

Math 396. Bijectivity vs. isomorphism

Math 396. Bijectivity vs. isomorphism Math 396. Bijectivity vs. isomorphism 1. Motivation Let f : X Y be a C p map between two C p -premanifolds with corners, with 1 p. Assuming f is bijective, we would like a criterion to tell us that f 1

More information

4.2. ORTHOGONALITY 161

4.2. ORTHOGONALITY 161 4.2. ORTHOGONALITY 161 Definition 4.2.9 An affine space (E, E ) is a Euclidean affine space iff its underlying vector space E is a Euclidean vector space. Given any two points a, b E, we define the distance

More information

Invariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features

Invariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features Invariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features G. Y. Chen and B. Kégl Department of Computer Science and Operations Research, University of Montreal, CP 6128 succ.

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

Fact: Every matrix transformation is a linear transformation, and vice versa.

Fact: Every matrix transformation is a linear transformation, and vice versa. Linear Transformations Definition: A transformation (or mapping) T is linear if: (i) T (u + v) = T (u) + T (v) for all u, v in the domain of T ; (ii) T (cu) = ct (u) for all scalars c and all u in the

More information

Honors Advanced Math Final Exam 2009

Honors Advanced Math Final Exam 2009 Name Answer Key. Teacher/Block (circle): Kelly/H Olsen/C Olsen/F Verner/G Honors Advanced Math Final Exam 009 Lexington High School Mathematics Department This is a 90-minute exam, but you will be allowed

More information

Image Recognition Using Modified Zernike Moments

Image Recognition Using Modified Zernike Moments Sensors & Transducers 204 by IFSA Publishing S. L. http://www.sensorsportal.com Image Recognition Using Modified ernike Moments Min HUANG Yaqiong MA and Qiuping GONG School of Computer and Communication

More information

Lecture Notes 1: Vector spaces

Lecture Notes 1: Vector spaces Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector

More information

MATH 583A REVIEW SESSION #1

MATH 583A REVIEW SESSION #1 MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),

More information

5. Connectedness. Corollary 5.4. Connectedness is a topological property.

5. Connectedness. Corollary 5.4. Connectedness is a topological property. 5. Connectedness We begin our introduction to topology with the study of connectedness traditionally the only topic studied in both analytic and algebraic topology. C. T. C. Wall, 197 The property at the

More information

Master Algèbre géométrie et théorie des nombres Final exam of differential geometry Lecture notes allowed

Master Algèbre géométrie et théorie des nombres Final exam of differential geometry Lecture notes allowed Université de Bordeaux U.F. Mathématiques et Interactions Master Algèbre géométrie et théorie des nombres Final exam of differential geometry 2018-2019 Lecture notes allowed Exercise 1 We call H (like

More information

Designing Information Devices and Systems I Discussion 2A

Designing Information Devices and Systems I Discussion 2A EECS 16A Spring 218 Designing Information Devices and Systems I Discussion 2A 1. Visualizing Matrices as Operations This problem is going to help you visualize matrices as operations. For example, when

More information

Invariant Scattering Convolution Networks

Invariant Scattering Convolution Networks Invariant Scattering Convolution Networks Joan Bruna and Stephane Mallat Submitted to PAMI, Feb. 2012 Presented by Bo Chen Other important related papers: [1] S. Mallat, A Theory for Multiresolution Signal

More information

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.

More information

Classification of handwritten digits using supervised locally linear embedding algorithm and support vector machine

Classification of handwritten digits using supervised locally linear embedding algorithm and support vector machine Classification of handwritten digits using supervised locally linear embedding algorithm and support vector machine Olga Kouropteva, Oleg Okun, Matti Pietikäinen Machine Vision Group, Infotech Oulu and

More information

Review of similarity transformation and Singular Value Decomposition

Review of similarity transformation and Singular Value Decomposition Review of similarity transformation and Singular Value Decomposition Nasser M Abbasi Applied Mathematics Department, California State University, Fullerton July 8 7 page compiled on June 9, 5 at 9:5pm

More information

Image preprocessing in spatial domain

Image preprocessing in spatial domain Image preprocessing in spatial domain Sampling theorem, aliasing, interpolation, geometrical transformations Revision: 1.3, dated: December 7, 2005 Tomáš Svoboda Czech Technical University, Faculty of

More information

Representations and Linear Actions

Representations and Linear Actions Representations and Linear Actions Definition 0.1. Let G be an S-group. A representation of G is a morphism of S-groups φ G GL(n, S) for some n. We say φ is faithful if it is a monomorphism (in the category

More information

Joseph Muscat Universal Algebras. 1 March 2013

Joseph Muscat Universal Algebras. 1 March 2013 Joseph Muscat 2015 1 Universal Algebras 1 Operations joseph.muscat@um.edu.mt 1 March 2013 A universal algebra is a set X with some operations : X n X and relations 1 X m. For example, there may be specific

More information

φ(a + b) = φ(a) + φ(b) φ(a b) = φ(a) φ(b),

φ(a + b) = φ(a) + φ(b) φ(a b) = φ(a) φ(b), 16. Ring Homomorphisms and Ideals efinition 16.1. Let φ: R S be a function between two rings. We say that φ is a ring homomorphism if for every a and b R, and in addition φ(1) = 1. φ(a + b) = φ(a) + φ(b)

More information

CSE 291. Assignment Spectral clustering versus k-means. Out: Wed May 23 Due: Wed Jun 13

CSE 291. Assignment Spectral clustering versus k-means. Out: Wed May 23 Due: Wed Jun 13 CSE 291. Assignment 3 Out: Wed May 23 Due: Wed Jun 13 3.1 Spectral clustering versus k-means Download the rings data set for this problem from the course web site. The data is stored in MATLAB format as

More information

Sophus Lie s Approach to Differential Equations

Sophus Lie s Approach to Differential Equations Sophus Lie s Approach to Differential Equations IAP lecture 2006 (S. Helgason) 1 Groups Let X be a set. A one-to-one mapping ϕ of X onto X is called a bijection. Let B(X) denote the set of all bijections

More information

Rings and groups. Ya. Sysak

Rings and groups. Ya. Sysak Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...

More information

Image preprocessing in spatial domain

Image preprocessing in spatial domain Image preprocessing in spatial domain Sampling theorem, aliasing, interpolation, geometrical transformations Revision: 1.4, dated: May 25, 2006 Tomáš Svoboda Czech Technical University, Faculty of Electrical

More information

Handlebody Decomposition of a Manifold

Handlebody Decomposition of a Manifold Handlebody Decomposition of a Manifold Mahuya Datta Statistics and Mathematics Unit Indian Statistical Institute, Kolkata mahuya@isical.ac.in January 12, 2012 contents Introduction What is a handlebody

More information

Master of Intelligent Systems - French-Czech Double Diploma. Hough transform

Master of Intelligent Systems - French-Czech Double Diploma. Hough transform Hough transform I- Introduction The Hough transform is used to isolate features of a particular shape within an image. Because it requires that the desired features be specified in some parametric form,

More information

Surfaces of Arbitrary Constant Negative Gaussian Curvature and Related Sine-Gordon Equations

Surfaces of Arbitrary Constant Negative Gaussian Curvature and Related Sine-Gordon Equations Mathematica Aeterna, Vol.1, 011, no. 01, 1-11 Surfaces of Arbitrary Constant Negative Gaussian Curvature and Related Sine-Gordon Equations Paul Bracken Department of Mathematics, University of Texas, Edinburg,

More information

Numerical Linear Algebra Chap. 2: Least Squares Problems

Numerical Linear Algebra Chap. 2: Least Squares Problems Numerical Linear Algebra Chap. 2: Least Squares Problems Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Numerical Simulation TUHH Heinrich Voss Numerical Linear Algebra

More information

DIFFERENTIAL GEOMETRY 1 PROBLEM SET 1 SOLUTIONS

DIFFERENTIAL GEOMETRY 1 PROBLEM SET 1 SOLUTIONS DIFFERENTIAL GEOMETRY PROBLEM SET SOLUTIONS Lee: -4,--5,-6,-7 Problem -4: If k is an integer between 0 and min m, n, show that the set of m n matrices whose rank is at least k is an open submanifold of

More information

Salmon: Lectures on partial differential equations

Salmon: Lectures on partial differential equations 6. The wave equation Of the 3 basic equations derived in the previous section, we have already discussed the heat equation, (1) θ t = κθ xx + Q( x,t). In this section we discuss the wave equation, () θ

More information

EE 16B Final, December 13, Name: SID #:

EE 16B Final, December 13, Name: SID #: EE 16B Final, December 13, 2016 Name: SID #: Important Instructions: Show your work. An answer without explanation is not acceptable and does not guarantee any credit. Only the front pages will be scanned

More information

2 Lie Groups. Contents

2 Lie Groups. Contents 2 Lie Groups Contents 2.1 Algebraic Properties 25 2.2 Topological Properties 27 2.3 Unification of Algebra and Topology 29 2.4 Unexpected Simplification 31 2.5 Conclusion 31 2.6 Problems 32 Lie groups

More information

Algebra: Groups. Group Theory a. Examples of Groups. groups. The inverse of a is simply a, which exists.

Algebra: Groups. Group Theory a. Examples of Groups. groups. The inverse of a is simply a, which exists. Group Theory a Let G be a set and be a binary operation on G. (G, ) is called a group if it satisfies the following. 1. For all a, b G, a b G (closure). 2. For all a, b, c G, a (b c) = (a b) c (associativity).

More information

Review of Linear System Theory

Review of Linear System Theory Review of Linear System Theory The following is a (very) brief review of linear system theory and Fourier analysis. I work primarily with discrete signals. I assume the reader is familiar with linear algebra

More information

Foundations of Matrix Analysis

Foundations of Matrix Analysis 1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the

More information

WORKSHEET #13 MATH 1260 FALL 2014

WORKSHEET #13 MATH 1260 FALL 2014 WORKSHEET #3 MATH 26 FALL 24 NOT DUE. Short answer: (a) Find the equation of the tangent plane to z = x 2 + y 2 at the point,, 2. z x (, ) = 2x = 2, z y (, ) = 2y = 2. So then the tangent plane equation

More information

Lifting Smooth Homotopies of Orbit Spaces of Proper Lie Group Actions

Lifting Smooth Homotopies of Orbit Spaces of Proper Lie Group Actions Journal of Lie Theory Volume 15 (2005) 447 456 c 2005 Heldermann Verlag Lifting Smooth Homotopies of Orbit Spaces of Proper Lie Group Actions Marja Kankaanrinta Communicated by J. D. Lawson Abstract. By

More information

A Lie Group. These notes introduce SU(2) as an example of a compact Lie group. SU(2) = { A A a 2 2 complex matrix,deta = 1,AA = A A = 1l }

A Lie Group. These notes introduce SU(2) as an example of a compact Lie group. SU(2) = { A A a 2 2 complex matrix,deta = 1,AA = A A = 1l } A Lie Group The Definition These notes introduce SU2) as an example of a compact Lie group. The definition of SU2) is SU2) { A A 2 complex matrixdeta 1AA A A 1l } In the name SU2) the S stands for special

More information

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016 Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:

More information

21 Gaussian spaces and processes

21 Gaussian spaces and processes Tel Aviv University, 2010 Gaussian measures : infinite dimension 1 21 Gaussian spaces and processes 21a Gaussian spaces: finite dimension......... 1 21b Toward Gaussian random processes....... 2 21c Random

More information

SYMMETRIES IN R 3 NAMITA GUPTA

SYMMETRIES IN R 3 NAMITA GUPTA SYMMETRIES IN R 3 NAMITA GUPTA Abstract. This paper will introduce the concept of symmetries being represented as permutations and will proceed to explain the group structure of such symmetries under composition.

More information

Notes on the Banach-Tarski Paradox

Notes on the Banach-Tarski Paradox Notes on the Banach-Tarski Paradox Donald Brower May 6, 2006 The Banach-Tarski paradox is not a logical paradox, but rather a counter intuitive result. It says that a ball can be broken into a finite number

More information

BASIC GROUP THEORY : G G G,

BASIC GROUP THEORY : G G G, BASIC GROUP THEORY 18.904 1. Definitions Definition 1.1. A group (G, ) is a set G with a binary operation : G G G, and a unit e G, possessing the following properties. (1) Unital: for g G, we have g e

More information

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007) Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1

More information

SPHERICAL UNITARY REPRESENTATIONS FOR REDUCTIVE GROUPS

SPHERICAL UNITARY REPRESENTATIONS FOR REDUCTIVE GROUPS SPHERICAL UNITARY REPRESENTATIONS FOR REDUCTIVE GROUPS DAN CIUBOTARU 1. Classical motivation: spherical functions 1.1. Spherical harmonics. Let S n 1 R n be the (n 1)-dimensional sphere, C (S n 1 ) the

More information

Structure Groups of Pseudo-Riemannian Algebraic Curvature Tensors

Structure Groups of Pseudo-Riemannian Algebraic Curvature Tensors Structure Groups of Pseudo-Riemannian Algebraic Curvature Tensors Joseph Palmer August 20, 2010 Abstract We study the group of endomorphisms which preserve given model spaces under precomposition, known

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

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions

More information

Quaternions 2 AUI Course Denbigh Starkey

Quaternions 2 AUI Course Denbigh Starkey Quaternions 2 AUI Course Denbigh Starkey 1. Background 2 2. Some Basic Quaternion Math 4 3. The Justification of the Quaternion Rotation Formula 5 4. Interpolation between two Unit Quaternions SLERP vs.

More information

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I Physics 342 Lecture 2 Linear Algebra I Lecture 2 Physics 342 Quantum Mechanics I Wednesday, January 27th, 21 From separation of variables, we move to linear algebra Roughly speaking, this is the study

More information

Part 1a: Inner product, Orthogonality, Vector/Matrix norm

Part 1a: Inner product, Orthogonality, Vector/Matrix norm Part 1a: Inner product, Orthogonality, Vector/Matrix norm September 19, 2018 Numerical Linear Algebra Part 1a September 19, 2018 1 / 16 1. Inner product on a linear space V over the number field F A map,

More information

(1) is an invertible sheaf on X, which is generated by the global sections

(1) is an invertible sheaf on X, which is generated by the global sections 7. Linear systems First a word about the base scheme. We would lie to wor in enough generality to cover the general case. On the other hand, it taes some wor to state properly the general results if one

More information

Infinite elementary divisor structure-preserving transformations for polynomial matrices

Infinite elementary divisor structure-preserving transformations for polynomial matrices Infinite elementary divisor structure-preserving transformations for polynomial matrices N P Karampetakis and S Vologiannidis Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki

More information

Vector Space Concepts

Vector Space Concepts Vector Space Concepts ECE 174 Introduction to Linear & Nonlinear Optimization Ken Kreutz-Delgado ECE Department, UC San Diego Ken Kreutz-Delgado (UC San Diego) ECE 174 Fall 2016 1 / 25 Vector Space Theory

More information

Math 370 Homework 2, Fall 2009

Math 370 Homework 2, Fall 2009 Math 370 Homework 2, Fall 2009 (1a) Prove that every natural number N is congurent to the sum of its decimal digits mod 9. PROOF: Let the decimal representation of N be n d n d 1... n 1 n 0 so that N =

More information

Figure 10: Tangent vectors approximating a path.

Figure 10: Tangent vectors approximating a path. 3 Curvature 3.1 Curvature Now that we re parametrizing curves, it makes sense to wonder how we might measure the extent to which a curve actually curves. That is, how much does our path deviate from being

More information

MIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???

MIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:??? MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present

More information

Spatial Statistics with Image Analysis. Lecture L02. Computer exercise 0 Daily Temperature. Lecture 2. Johan Lindström.

Spatial Statistics with Image Analysis. Lecture L02. Computer exercise 0 Daily Temperature. Lecture 2. Johan Lindström. C Stochastic fields Covariance Spatial Statistics with Image Analysis Lecture 2 Johan Lindström November 4, 26 Lecture L2 Johan Lindström - johanl@maths.lth.se FMSN2/MASM2 L /2 C Stochastic fields Covariance

More information

The New Graphic Description of the Haar Wavelet Transform

The New Graphic Description of the Haar Wavelet Transform he New Graphic Description of the Haar Wavelet ransform Piotr Porwik and Agnieszka Lisowska Institute of Informatics, Silesian University, ul.b dzi ska 39, 4-00 Sosnowiec, Poland porwik@us.edu.pl Institute

More information

Solving Systems of Equations Row Reduction

Solving Systems of Equations Row Reduction Solving Systems of Equations Row Reduction November 19, 2008 Though it has not been a primary topic of interest for us, the task of solving a system of linear equations has come up several times. For example,

More information

DRAFT - Math 102 Lecture Note - Dr. Said Algarni

DRAFT - Math 102 Lecture Note - Dr. Said Algarni Math02 - Term72 - Guides and Exercises - DRAFT 7 Techniques of Integration A summery for the most important integrals that we have learned so far: 7. Integration by Parts The Product Rule states that if

More information

The Hurewicz Theorem

The Hurewicz Theorem The Hurewicz Theorem April 5, 011 1 Introduction The fundamental group and homology groups both give extremely useful information, particularly about path-connected spaces. Both can be considered as functors,

More information

arxiv: v2 [math.ag] 24 Jun 2015

arxiv: v2 [math.ag] 24 Jun 2015 TRIANGULATIONS OF MONOTONE FAMILIES I: TWO-DIMENSIONAL FAMILIES arxiv:1402.0460v2 [math.ag] 24 Jun 2015 SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV Abstract. Let K R n be a compact definable set

More information

A UNIFIED THEORY FOR STEERABLE AND QUADRATURE FILTERS

A UNIFIED THEORY FOR STEERABLE AND QUADRATURE FILTERS A UNIFIED THEORY FOR STEERABLE AND QUADRATURE FILTERS Kai Krajsek J. W. Goethe University, Visual Sensorics and Information Processing Lab Robert Mayer Str.2-4, D-60054 Frankfurt am Main, Germany krajsek@vsi.cs.uni-frankfurt.de

More information

1. INTRODUCTION. Yen-Chung Chiu. Wen-Hsiang Tsai.

1. INTRODUCTION. Yen-Chung Chiu. Wen-Hsiang Tsai. Copyright Protection by Watermarking for Color Images against Rotation and Scaling Attacks Using Coding and Synchronization of Peak Locations in DFT Domain Yen-Chung Chiu Department of Computer and Information

More information

Mathematical foundations - linear algebra

Mathematical foundations - linear algebra Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar

More information

Math 676. A compactness theorem for the idele group. and by the product formula it lies in the kernel (A K )1 of the continuous idelic norm

Math 676. A compactness theorem for the idele group. and by the product formula it lies in the kernel (A K )1 of the continuous idelic norm Math 676. A compactness theorem for the idele group 1. Introduction Let K be a global field, so K is naturally a discrete subgroup of the idele group A K and by the product formula it lies in the kernel

More information

2. Matrix Algebra and Random Vectors

2. Matrix Algebra and Random Vectors 2. Matrix Algebra and Random Vectors 2.1 Introduction Multivariate data can be conveniently display as array of numbers. In general, a rectangular array of numbers with, for instance, n rows and p columns

More information

Numerical Methods for Inverse Kinematics

Numerical Methods for Inverse Kinematics Numerical Methods for Inverse Kinematics Niels Joubert, UC Berkeley, CS184 2008-11-25 Inverse Kinematics is used to pose models by specifying endpoints of segments rather than individual joint angles.

More information

Introduction to Matrix Algebra

Introduction to Matrix Algebra Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p

More information

Linear Algebra Massoud Malek

Linear Algebra Massoud Malek CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product

More information

Distance Between Ellipses in 2D

Distance Between Ellipses in 2D Distance Between Ellipses in 2D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To

More information

Some notes on Coxeter groups

Some notes on Coxeter groups Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three

More information

2-Dimensional Density Matrices

2-Dimensional Density Matrices A Transformational Property of -Dimensional Density Matrices Nicholas Wheeler January 03 Introduction. This note derives from recent work related to decoherence models described by Zurek and Albrecht.

More information

Elementary linear algebra

Elementary linear algebra Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The

More information

PULLBACK MODULI SPACES

PULLBACK MODULI SPACES PULLBACK MODULI SPACES FRAUKE M. BLEHER AND TED CHINBURG Abstract. Geometric invariant theory can be used to construct moduli spaces associated to representations of finite dimensional algebras. One difficulty

More information

Algebra I Fall 2007

Algebra I Fall 2007 MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary

More information

Algebraic structures I

Algebraic structures I MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one

More information

1 Holomorphic functions

1 Holomorphic functions Robert Oeckl CA NOTES 1 15/09/2009 1 1 Holomorphic functions 11 The complex derivative The basic objects of complex analysis are the holomorphic functions These are functions that posses a complex derivative

More information

Linear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University Math 8530, Spring 2017

Linear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University  Math 8530, Spring 2017 Linear maps Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8530, Spring 2017 M. Macauley (Clemson) Linear maps Math 8530, Spring 2017

More information

Math 334 A1 Homework 3 (Due Nov. 5 5pm)

Math 334 A1 Homework 3 (Due Nov. 5 5pm) Math 334 A1 Homework 3 Due Nov. 5 5pm No Advanced or Challenge problems will appear in homeworks. Basic Problems Problem 1. 4.1 11 Verify that the given functions are solutions of the differential equation,

More information

:25 1. Rotations. A rotation is in general a transformation of the 3D space with the following properties:

:25 1. Rotations. A rotation is in general a transformation of the 3D space with the following properties: 2011-02-17 12:25 1 1 Rotations in general Rotations A rotation is in general a transformation of the 3D space with the following properties: 1. does not change the distances between positions 2. does not

More information

MATRIX LIE GROUPS AND LIE GROUPS

MATRIX LIE GROUPS AND LIE GROUPS MATRIX LIE GROUPS AND LIE GROUPS Steven Sy December 7, 2005 I MATRIX LIE GROUPS Definition: A matrix Lie group is a closed subgroup of Thus if is any sequence of matrices in, and for some, then either

More information

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as

More information

OPERATOR PENCIL PASSING THROUGH A GIVEN OPERATOR

OPERATOR PENCIL PASSING THROUGH A GIVEN OPERATOR OPERATOR PENCIL PASSING THROUGH A GIVEN OPERATOR A. BIGGS AND H. M. KHUDAVERDIAN Abstract. Let be a linear differential operator acting on the space of densities of a given weight on a manifold M. One

More information

1 Stochastic Dynamic Programming

1 Stochastic Dynamic Programming 1 Stochastic Dynamic Programming Formally, a stochastic dynamic program has the same components as a deterministic one; the only modification is to the state transition equation. When events in the future

More information

THE NUMBER OF POLYNOMIAL SOLUTIONS OF POLYNOMIAL RICCATI EQUATIONS

THE NUMBER OF POLYNOMIAL SOLUTIONS OF POLYNOMIAL RICCATI EQUATIONS This is a preprint of: The number of polynomial solutions of polynomial Riccati equations, Armengol Gasull, Joan Torregrosa, Xiang Zhang, J. Differential Equations, vol. 261, 5071 5093, 2016. DOI: [10.1016/j.jde.2016.07.019]

More information

COMBINATORIALLY CONVEX MODULI AND AN EXAMPLE OF GÖDEL

COMBINATORIALLY CONVEX MODULI AND AN EXAMPLE OF GÖDEL Pioneer Journal of Algebra, Number Theory and its Applications Volume, Number, 2017, Pages This paper is available online at http://www.pspchv.com/content_pjanta.html COMBINATORIALLY CONVEX MODULI AND

More information

(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d

(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers

More information

The Fundamental Group and The Van Kampen Theorem

The Fundamental Group and The Van Kampen Theorem The Fundamental Group and The Van Kampen Theorem Ronald Alberto Zúñiga Rojas Universidade de Coimbra Departamento de Matemática Topologia Algébrica Contents 1 Some Basic Definitions 2 The Fundamental Group

More information

8 Complete fields and valuation rings

8 Complete fields and valuation rings 18.785 Number theory I Fall 2017 Lecture #8 10/02/2017 8 Complete fields and valuation rings In order to make further progress in our investigation of finite extensions L/K of the fraction field K of a

More information

Formal power series rings, inverse limits, and I-adic completions of rings

Formal power series rings, inverse limits, and I-adic completions of rings Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely

More information

1 Last time: multiplying vectors matrices

1 Last time: multiplying vectors matrices MATH Linear algebra (Fall 7) Lecture Last time: multiplying vectors matrices Given a matrix A = a a a n a a a n and a vector v = a m a m a mn Av = v a a + v a a v v + + Rn we define a n a n a m a m a mn

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

Weyl s Character Formula for Representations of Semisimple Lie Algebras

Weyl s Character Formula for Representations of Semisimple Lie Algebras Weyl s Character Formula for Representations of Semisimple Lie Algebras Ben Reason University of Toronto December 22, 2005 1 Introduction Weyl s character formula is a useful tool in understanding the

More information

1 Matrices and matrix algebra

1 Matrices and matrix algebra 1 Matrices and matrix algebra 1.1 Examples of matrices A matrix is a rectangular array of numbers and/or variables. For instance 4 2 0 3 1 A = 5 1.2 0.7 x 3 π 3 4 6 27 is a matrix with 3 rows and 5 columns

More information

7. Dimension and Structure.

7. Dimension and Structure. 7. Dimension and Structure 7.1. Basis and Dimension Bases for Subspaces Example 2 The standard unit vectors e 1, e 2,, e n are linearly independent, for if we write (2) in component form, then we obtain

More information