Difference between revisions of "Numerical Analysis of Interference Patterns"
Jump to navigation
Jump to search
(→ParSA) |
(→ParSA) |
||
| Line 41: | Line 41: | ||
{|width="50%" | {|width="50%" | ||
|align="right"| | |align="right"| | ||
| − | <math>T=\bar{\Delta C^{(|)}}\left(ln | + | <math>T=\bar{\Delta C^{(|)}}\left(ln \frac{m_2}{m_2\chi_0-(1-\chi_0)m_1}\right)^{-1}</math> |
|align="center" width="80"|(2) | |align="center" width="80"|(2) | ||
|} | |} | ||
Revision as of 17:57, 19 September 2007
This page is currently a work in progress.
Phase Shifting Technique
- requires three phase shifted fringe patterns
- the phase shift must be known
- carefully controlled conditions must be maintained
Fourier Analysis Method
- requires carrier frequency, narrow frequency, low noise and open fringes
- estimates the phase wrapped (via arctan)
Phase-Locked Loop Algorithm
- computer simulated oscillator (VCO) needed
- phase error b/w the fringe pattern and the VCO vanishes
Artificial Neural Network Method
- requires carrier phase
- non-algorithmic (i.e. must have learning phase)
- types of learning include: supervised, unsupervised and reinforcement
- multi-layer: input, output, hidden neurons present
Genetic Algorithm
Simulated Annealing
ParSA
Here [1] is the link the the ParSA documentation.
The ParSA (Parallel Simulated Annealing) library is a set of classes written in C++ that can be used to solve optimization problems via a process know as simulated annealing.
The ParSA library contains many different types of The Equation for convergence speed is:
|
|
(1) |
|
|
(2) |