How to Install and Uninstall snaphu Package on Kali Linux

Last updated: May 17,2024

1. Install "snaphu" package

In this section, we are going to explain the necessary steps to install snaphu on Kali Linux

$ sudo apt update $ sudo apt install snaphu

2. Uninstall "snaphu" package

This is a short guide on how to uninstall snaphu on Kali Linux:

$ sudo apt remove snaphu $ sudo apt autoclean && sudo apt autoremove

3. Information about the snaphu package on Kali Linux

Package: snaphu
Version: 2.0.6-2
Installed-Size: 391
Maintainer: Debian GIS Project
Architecture: amd64
Depends: libc6 (>= 2.34)
Size: 156188
SHA256: 34cc4d698b6ca8b330b3366975db8c67b4588710cb9830dfe07ace7b97fa4ec1
SHA1: 9e25e333b2ffbd170fbbbe58f2cf0299e0a9c00f
MD5sum: 2e1bdf3edae9527ebe6b7f82832ae0a7
Description: Statistical-Cost, Network-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 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.
.
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 1000000 pixels in
the input interferogram.
Description-md5:
Homepage: https://web.stanford.edu/group/radar/softwareandlinks/sw/snaphu/
Tag: implemented-in::c, role::program
Section: non-free/science
Priority: optional
Filename: pool/non-free/s/snaphu/snaphu_2.0.6-2_amd64.deb