Difference between revisions of "Numerical Analysis of Interference Patterns"
| Line 66: | Line 66: | ||
Clustering Scheduler | Clustering Scheduler | ||
| + | |||
*SA_Aarts | *SA_Aarts | ||
*SA_Easy Scheduler | *SA_Easy Scheduler | ||
Revision as of 21:23, 26 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
The artificial neural network approach utilizes the ability fo
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) |
Where K and are problem specific constants and is a solution of length n. Using equation (1) and test runs on smaller problems of lower order, K and can be determined. Along with some suggestions provided in the ParSA documentation, progress can be made towards finding higher quality solutions at a much faster rate.
|
|
(2) |
The equation for warming temperature in the Aarts scheduler:
|
|
(3) |
Table of Proposed Runs
Clustering
Clustering Solver
Clustering Scheduler
*SA_Aarts *SA_Easy Scheduler
Multiple Independent Runs (M.I.R.)
MIR_Solver
MIR_Scheduler
Use Combinations of the Different Solver/Scheduler Classes