Use of mean-field annealing theory is proposed for solving the phase-unwrapping (PU) problem. PU is formulated as a constrained optimization problem for the field of integer corrections to be added to the wrapped gradient field. A deterministic algorithm is described to provide an approximation of the average of the correction field over the global minima of the cost function. The proposed algorithm can be applied for any choice of the cost function. Using a cost function based on second-order differences, we obtain results close to those from simulated annealing and spend less computational time.
Mean-field annealing for phase unwrapping
Pasquariello G;
1999
Abstract
Use of mean-field annealing theory is proposed for solving the phase-unwrapping (PU) problem. PU is formulated as a constrained optimization problem for the field of integer corrections to be added to the wrapped gradient field. A deterministic algorithm is described to provide an approximation of the average of the correction field over the global minima of the cost function. The proposed algorithm can be applied for any choice of the cost function. Using a cost function based on second-order differences, we obtain results close to those from simulated annealing and spend less computational time.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
