Question about projection matrices

pamparana
Messages
123
Reaction score
0
Hello,

I am looking at some code which creates a projection matrix and I can verify that it is indeed correct as P^2 = P.

The way they do is as follows:

There is a 4x4 matrix which is an affine map between two coordinate systems (takes one from image space to world space). It is a transformation in 3D and the last row is [0 0 0 1] to accommodate for translation.

The procedure is as follows:

They take the 3x3 part of the matrix (so removing the translation bit) and also an appropriate transformation matrix is created. So for example if we only want to have the projection along the "z" plane, it would be:

I = [0 0 0; 0 0 0; 0 0 1]

The final projection matrix is gicen by:

A * I * inverse(A) where A is the 3x3 part.

I can verify that the resulting matrix indeed fulfills the properties of a projection matrix but am unable to get an intuitive feel of why this is so...

I would be very grateful if someone here can shed some light on this...

Thanks,

Luca
 
Physics news on Phys.org
Let's take the problem as this:You have a vector space that is spanned by columns of matrix ##A##; call it ##c(A)##.

Also, you have a vector ##b## that may or may not be in ##c(A)## and you want to find its orthogonal projection on ##c(A)##.

Then, let ##\hat{x}## be the solution such that ##A\hat{x}## is the orthogonal projection of ##b## on ##c(A)##.

So we have vector ##(A\hat{x}-b)## orthogonal to ##c(A)## such that the inner product ##<A\hat{x}-b,v> = 0##, where ##v\in c(A)##.Since columns of ##A## are elements of ##c(A)##, thus...
\begin{align*}<br /> A^T(A\hat{x}-b)&amp;=0\\<br /> A^TA\hat{x}&amp;=A^Tb<br /> \end{align*}If ##A^TA## has an inverse, then...
\begin{align*}<br /> \hat{x}&amp;=(A^TA)^{-1}A^Tb\\<br /> A\hat{x}&amp;=A(A^TA)^{-1}A^Tb<br /> \end{align*}And the projection matrix,
\begin{align*}<br /> P&amp;=A(A^TA)^{-1}A^T\\<br /> &amp;=AA^{-1}_{left}<br /> \end{align*}Again, provided that the inverse exists, you can prove that for any positive integer n, ##P^n=P##.
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top