Signal Processing and Representation Theory Lecture 3.

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

3D Geometry for Computer Graphics
Quantum One: Lecture Canonical Commutation Relations 3.
Signal , Weight Vector Spaces and Linear Transformations
Signal , Weight Vector Spaces and Linear Transformations
Symmetric Matrices and Quadratic Forms
Chapter 5 Orthogonality
Computer Graphics Recitation 5.
Computer Graphics Recitation 2. 2 The plan today Learn about rotations in 2D and 3D. Representing rotations by quaternions.
5.IV. Jordan Form 5.IV.1. Polynomials of Maps and Matrices 5.IV.2. Jordan Canonical Form.
Orthogonality and Least Squares
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
Lecture 2: Geometry vs Linear Algebra Points-Vectors and Distance-Norm Shang-Hua Teng.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
App III. Group Algebra & Reduction of Regular Representations 1. Group Algebra 2. Left Ideals, Projection Operators 3. Idempotents 4. Complete Reduction.
Stats & Linear Models.
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Orthogonal Functions and Fourier Series.
1 MAC 2103 Module 10 lnner Product Spaces I. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Define and find the.
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
6.837 Linear Algebra Review Patrick Nichols Thursday, September 18, 2003.
Signal Processing and Representation Theory Lecture 1.
Chapter 5: The Orthogonality and Least Squares
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Orthogonal Functions and Fourier Series.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Matrices and Vectors Objective.
Chapter 2: Vector spaces
Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma
Shape Analysis and Retrieval Statistical Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
AN ORTHOGONAL PROJECTION
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
Signal Processing and Representation Theory Lecture 4.
1 Fundamentals of Robotics Linking perception to action 2. Motion of Rigid Bodies 南台科技大學電機工程系謝銘原.
17. Group Theory 1.Introduction to Group Theory 2.Representation of Groups 3.Symmetry & Physics 4.Discrete Groups 5.Direct Products 6.Symmetric Groups.
Signal Processing and Representation Theory Lecture 2.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Chapter 10 Real Inner Products and Least-Square
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
Section 5.1 Length and Dot Product in ℝ n. Let v = ‹v 1­­, v 2, v 3,..., v n › and w = ‹w 1­­, w 2, w 3,..., w n › be vectors in ℝ n. The dot product.
Motivation: Wavelets are building blocks that can quickly decorrelate data 2. each signal written as (possibly infinite) sum 1. what type of data? 3. new.
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Mathematical Tools of Quantum Mechanics
Partial Shape Matching. Outline: Motivation Sum of Squared Distances.
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
1 MAC 2103 Module 11 lnner Product Spaces II. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Construct an orthonormal.
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
CS654: Digital Image Analysis Lecture 11: Image Transforms.
Spherical Extent Functions. Spherical Extent Function.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
An inner product on a vector space V is a function that, to each pair of vectors u and v in V, associates a real number and satisfies the following.
Beyond Vectors Hung-yi Lee. Introduction Many things can be considered as “vectors”. E.g. a function can be regarded as a vector We can apply the concept.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Kinematics 제어시스템 이론 및 실습 조현우
CS479/679 Pattern Recognition Dr. George Bebis
Aim: How do we multiply polynomials?
T. Chernyakova, A. Aberdam, E. Bar-Ilan, Y. C. Eldar
Lecture 03: Linear Algebra
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Signal & Weight Vector Spaces
Linear Algebra Lecture 40.
Signal & Weight Vector Spaces
Symmetric Matrices and Quadratic Forms
Quantum Two.
Lecture 13: Singular Value Decomposition (SVD)
Presentation transcript:

Signal Processing and Representation Theory Lecture 3

Outline: Review Spherical Harmonics Rotation Invariance Correlation and Wigner-D Functions

Representation Theory Review Given a representation  of a group G onto an inner product space V, decomposing V into the direct sum of irreducible sub-representations: V=V 1  …  V n makes it easier to: –Compute the correlation between two vectors: fewer multiplications are needed –Obtain G-invariant information: more transformation invariant norms can be obtained

Representation Theory Review In the case that the group G is commutative, the irreducible sub-representations V i are all one- complex-dimensional, (Schur’s Lemma). Example: If V is the space of functions on a circle, represented by n- dimensional arrays, and G is the group of 2D rotations: –Correlation can be done in O(n log n) time (using the FFT) –We can obtain n/2-dimensional, rotation invariant descriptors

Representation Theory What happens when the group G is not commutative? Example: If V is the space of functions on a sphere and G is the group of 3D rotations: –How quickly can we correlate? –How much rotation invariant information can we get?

Outline: Review Spherical Harmonics Rotation Invariance Correlation and Wigner-D Functions

Representation Theory Spherical Harmonic Decomposition Goal: Find the irreducible sub-representations of the group of 3D rotation acting on the space of spherical functions.

Representation Theory Spherical Harmonic Decomposition Preliminaries: If f is a function defined in 3D, we can get a function on the unit sphere by looking at the restriction of f to points with norm 1.

Representation Theory Spherical Harmonic Decomposition Preliminaries: A polynomial p(x,y,z) is homogenous of degree d if it is the linear sum of monomials of degree d:

Representation Theory Spherical Harmonic Decomposition Preliminaries: We can think of the space of homogenous polynomials of degree d in x, y, and z as: where P d (x,y) is the space of homogenous polynomials of degreed d in x and y.

Representation Theory Spherical Harmonic Decomposition Preliminaries: If we let P d (x,y,z) be the set of homogenous polynomials of degree d, then P d (x,y,z) is a vector- space of dimension:

Representation Theory Spherical Harmonic Decomposition Observation: If M is any 3x3 matrix, and p(x,y,z) is a homogenous polynomial of degree d: then p(M(x,y,z)) is also a homogenous polynomial of degree d:

Representation Theory Spherical Harmonic Decomposition If V is the space of functions on the sphere, we can consider the sub-space of functions on the sphere that are restrictions of homogenous polynomials of degree d. Since a rotation will map a homogenous polynomial of degree d back to a homogenous polynomial of degree d, these sub-spaces are sub-representations.

Representation Theory Spherical Harmonic Decomposition In general, the space of homogenous polynomials of degree d has dimension (d+1)+(d)+(d-1)+…+1:

Representation Theory Spherical Harmonic Decomposition If (x,y,z) is a point on the sphere, we know that this point satisfies: Thus, if q(x,y,z)  P d (x,y,z), then even though in general, the polynomial: is a homogenous polynomial of degree d+2, its restriction to the sphere is actually a homogenous polynomial of degree d.

Representation Theory Spherical Harmonic Decomposition So, while the sub-spaces P d (x,y,z) are sub- representations, they are not irreducible as P d-2 (x,y,z)  P d (x,y,z). To get the irreducible sub-representations, we look at the spaces:

Representation Theory Spherical Harmonic Decomposition And the dimension of these sub-representations is:

Representation Theory Spherical Harmonic Decomposition The spherical harmonics of frequency d are an orthonormal basis for the space of functions V d. If we represent a point on a sphere in terms of its angle of elevation and azimuth: with 0  π and 0  <2π …

Representation Theory Spherical Harmonic Decomposition The spherical harmonics are functions Y l m, with l  0 and -l  m  l spanning the sub-representations V l :

Representation Theory Spherical Harmonic Decomposition Fact: If we have a function defined on the sphere, sampled on a regular nxn grid of angles of elevation and azimuth, the forward and inverse spherical harmonic transforms can be computed in O(n 2 log 2 n). Like the FFT, the fast spherical harmonic transform can be thought of as a change of basis, and a brute force method would take O(n 4 ) time.

Representation Theory What are the spherical harmonics Y l m ( ,  )?

Representation Theory What are the spherical harmonics Y l m ? Conceptually: The Y l m are the different homogenous polynomials of degree l:

Representation Theory What are the spherical harmonics Y l m ? Technically: Where the P l m are the associated Legendre polynomials: Where the P l are the Legendre polynomials:

Representation Theory What are the spherical harmonics Y l m ? Functionally: The Y l m are the eigen-values of the Laplacian operator:

Representation Theory What are the spherical harmonics Y l m ? Visually: The Y l m are spherical functions whose number of lobes get larger as the frequency, l, gets bigger: l=1l=1 l=2l=2 l=3l=3 l=0l=0

Representation Theory What are the spherical harmonics Y l m ? What is important about the spherical harmonics is that they are an orthonormal basis for the (2d+1)- dimensional sub-representations, V d, of the group of 3D rotations acting on the space of spherical functions.

Representation Theory Sub-Representations

Representation Theory Sub-Representations

Representation Theory Sub-Representations

Representation Theory Sub-Representations

Outline: Review Spherical Harmonics Rotation Invariance Correlation and Wigner-D Functions

Representation Theory Invariance Given a spherical function f, we can obtain a rotation invariant representation by expressing f in terms of its spherical harmonic decomposition: where each f l  V l :

Representation Theory Invariance We can then obtain a rotation invariant representation by storing the size of each f l independently: where:

Representation Theory Invariance Spherical Harmonic Decomposition + +=+

Representation Theory Invariance + +=+ +++ Constant1 st Order2 nd Order 3 rd Order

Representation Theory Invariance +++ Constant1 st Order2 nd Order 3 rd Order Ψ

Representation Theory Invariance Limitations: By storing only the energy in the different frequencies, we discard information that does not depend on the pose of the model: –Inter-frequency information –Intra-frequency information

+ Representation Theory Invariance Inter-Frequency information: 22.5 o 90 o = = +

Representation Theory Invariance Intra-Frequency information:

Representation Theory Invariance … … … O(n2)O(n2) O(n)O(n)

Representation Theory Invariance … … … O(n2)O(n2) O(n)O(n)

Representation Theory Invariance … … … O(n2)O(n2) O(n)O(n)

Representation Theory Invariance … … … O(n2)O(n2) O(n)O(n)

Representation Theory Invariance … … … O(n2)O(n2) O(n)O(n)

Outline: Review Spherical Harmonics Rotation Invariance Correlation and Wigner-D Functions

Representation Theory Wigner-D Functions The Wigner-D functions are an orthogonal basis of complex-valued functions defined on the space of rotations: with l  0 and -l  m,m’  l.

Representation Theory Wigner-D Functions Fact: If we are given a function defined on the group of 3D rotations, sampled on a regular nxnxn grid of Euler angles, the forward and inverse spherical harmonic transforms can be computed in O(n 4 ) time. Like the FFT and the FST, the fast Wigner-D transform can be thought of as a change of basis, and a brute force method would take O(n 6 ) time.

Representation Theory Motivation Given two spherical functions f and g we would like to compute the distance between f and g at every rotation. To do this, we need to be able to compute the correlation: Corr(f,g,R)=  f,R(g)  at every rotation R.

Representation Theory Correlation If we express f and g in terms of their spherical harmonic decompositions:

Representation Theory Correlation Then the correlation of f with g at a rotation R is given by:

Representation Theory Correlation So that we get an expression for the correlation of f with g as some linear combination of the Wigner-D functions:

Representation Theory Correlation The complexity of correlating two spherical functions sampled on a regular nxn grid is: –Forward spherical harmonic transform: O(n 2 log 2 n)

Representation Theory Correlation The complexity of correlating two spherical functions sampled on a regular nxn grid is: –Forward spherical harmonic transform: O(n 2 log 2 n) –Multiplying frequency terms:O(n 3 )

Representation Theory Correlation The complexity of correlating two spherical functions sampled on a regular nxn grid is: –Forward spherical harmonic transform: O(n 2 log 2 n) –Multiplying frequency terms:O(n 3 ) –Inverse Wigner-D transform:O(n 4 )

Representation Theory Correlation The complexity of correlating two spherical functions sampled on a regular nxn grid is: –Forward spherical harmonic transform: O(n 2 log 2 n) –Multiplying frequency terms:O(n 3 ) –Inverse Wigner-D transform:O(n 4 ) Total complexity of correlation is: O(n 4 ) (Note that a brute force approach would take O(n 5 ): For each of O(n 3 ) rotations we would have to perform an O(n 2 ) dot-product computation.)