Difference between revisions of "Numerical Analysis of Interference Patterns"

From UConn PAN
Jump to navigation Jump to search
Line 29: Line 29:
  
 
The Equation for convergence speed is:
 
The Equation for convergence speed is:
 +
 +
{|width="50%"
 +
|align="right"|
 
<math>P\left(X_n \notin Cost_{min}\right) \approx \left(\frac{K}{n}\right)^\alpha</math>
 
<math>P\left(X_n \notin Cost_{min}\right) \approx \left(\frac{K}{n}\right)^\alpha</math>
 +
|align="center" width="80"|(1)
 +
|}

Revision as of 17:29, 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

[1]

The Equation for convergence speed is:

(1)