I A few questions about doing a Gaussian Fit

btb4198
Messages
570
Reaction score
10
A few questions about doing a Gaussian Fit :

1) Is gaussian fit and gaussian regression the same thing ?
2) I have a gaussian function that will return a list of gaussian numbers giving an initial list length. So if you input 5 you will get:
1,2,6,4,1.
My question is if I have an image and I want to do a gaussian fit on the Rows and the Columns and graph them separately.
would I :
A) Add up all values in rows 1- 5, than multiply the value from row 1 to 1, multiply the value from row 2 to 2 , row 3 to 6, row 4 to 1, and row 5 to 1 and then repeat for the columns?
or
B) Add up all the values in my rows, then solve for the mean value, and then I am not sure what would come next ...

or is there something else I should do?
 
Physics news on Phys.org
Can you define exactly what a Gaussian fit is?
 
Office_Shredder said:
Can you define exactly what a Gaussian fit is?

When you take data from an image and you fit it into a Bell curve.
Actually when you take any given data.
I am told you do this, because if your data can fit in a bell curve, then you can do other, statistical Analysis to it.
 
Oh cool!
but could someone answer my questions ?
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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...

Similar threads

Back
Top