Changes

The regularization method was created for the specific purpose of automatically demodulating "noisy" fringe patterns without any further unwrapping of the phase.  Regularization algorithms involve evaluating the estimated phase field with a cost function against the actual pattern and then imposing the smoothness criterion.  This method is repeated for each pixel on the phase field, until a global minimum is reached in the cost function [[#References|[5]]],[[#References|[6]]].

The regularization method was created for the specific purpose of automatically demodulating "noisy" fringe patterns without any further unwrapping of the phase.  Regularization algorithms involve evaluating the estimated phase field with a cost function against the actual pattern and then imposing the smoothness criterion.  This method is repeated for each pixel on the phase field, until a global minimum is reached in the cost function [[#References|[5]]],[[#References|[6]]].

Variations of the regularization method involve demodulating certain points in the low frequency region of the fringe pattern.  This point can then be used to seed the estimated phase field.  The algorithm then follows a somewhat analogously to crystal growing.

Variations of the regularization method involve demodulating certain points in the low frequency region of the fringe pattern.  This point can then be used to seed the estimated phase field.  The algorithm then follows somewhat analogously to crystal growing.

A drawback to this method arises from the fact "that a low-pass filtering and a binary threshold operation are required."

A drawback to this method arises from the fact "that a low-pass filtering and a binary threshold operation are required."