[DebianGIS-dev] [SCM] snaphu branch, master, updated. upstream/1.4.2-3-g0add7bc

[Antonio Valentino]

The following commit has been merged in the master branch:
commit 0add7bc664ced3089f46d1d47c06520f31fe83f6
Author: Antonio Valentino <antonio.valentino at tiscali.it>
Date:   Tue Dec 28 11:04:44 2010 +0100

    Improved package description

diff --git a/debian/control b/debian/control
index 7244206..6c4b660 100644
--- a/debian/control
+++ b/debian/control
@@ -10,29 +10,32 @@ Homepage: http://www-star.stanford.edu/sar_group/snaphu
 Package: snaphu
 Architecture: any
 Depends: ${shlibs:Depends}, ${misc:Depends}
-Description: Statistical-Cost, Netowrk-Flow Algorithm for Phase Unwrapping
+Description: Statistical-Cost, Netowrk-Flow Algorithm for 2D Phase Unwrapping
  Two-dimensional phase unwrapping is the process of recovering
  unambiguous phase data from a 2-D array of phase values known only
  modulo 2pi rad.
  .
+ There are many applications, like Magnetic Resonance Imaging (MRI),
+ Synthetic Aperture Radar (SAR), fringe pattern analysis, tomography
+ and spectroscopy, which as part of their fundamental operation depend
+ upon the extraction of a phase signal from their input image. Usually
+ the phase is available in a form that suffers from 2-pi phase jumps
+ due to the use of the mathematical arctangent function, which produces
+ an inherently wrapped output. This wrapped phase is unusable until the
+ phase discontinuities are removed.
+ .
  SNAPHU is an implementation of the Statistical-cost, Network-flow
- Algorithm for Phase Unwrapping proposed by Chen and Zebker. This
- algorithm poses phase unwrapping as a maximum a posteriori probability
- (MAP) estimation problem, the objective of which is to compute the most
- likely unwrapped solution given the observable input data. Because the
- statistics relating the input data to the solution depend on the
- measured quantity, SNAPHU incorporates three built-in statistical
- models, for topography data, deformation data, and smooth generic data.
- The posed optimization problem is solved approximately with use of
- network-flow techniques.
+ Algorithm for Phase Unwrapping particularly suitable for SAR
+ interferometry applications. This algorithm poses phase unwrapping as
+ a maximum a posteriori probability (MAP) estimation problem, the
+ objective of which is to compute the most likely unwrapped solution
+ given the observable input data. Because the statistics relating the
+ input data to the solution depend on the measured quantity, SNAPHU
+ incorporates three built-in statistical models, for topography data,
+ deformation data, and smooth generic data. The posed optimization
+ problem is solved approximately with use of network-flow techniques.
  .
- SNAPHU always produces complete unwrapped solutions, and its accuracy
- is comparable to or better than that of other available algorithms.
  As SNAPHU uses an iterative optimization procedure, its execution time
  depends on the difficulty of the interferogram. In single-tile mode
  the required memory is on the order of 100 MB per 1,000,000 pixels in
  the input interferogram.
- .
- The software is written in C and should run on most Unix/Linux
- platforms. It is freely available to the public, subject to the
- conditions outlined in the README file included with the distribution.

-- 
Statistical-Cost, Netowrk-Flow Algorithm for Phase Unwrapping