No abstract

No abstract

This work investigates the possibility of performing target analysis through the Multi-Chromatic Analysis (MCA), a technique that basically explores the information content of sub-band images obtained by processing portions of the range spectrum of a synthetic aperture radar (SAR) image. According to the behavior of the SAR signal at the different sub-bands, MCA allows target classification. Two strategies have been experimented by processing TerraSAR-X images acquired over the Venice Lagoon, Italy: one exploiting the phase of interferometric sub-band pairs, the other using the spectral coherence derived by computing the coherence between sub-band images of a single SAR acquisition. The first approach introduces the concept of frequency-persistent scatterers (FPS), which is complementary to that of the time-persistent scatterers (PS). FPS and PS populations have been derived and analyzed to evaluate the respective characteristics and the physical nature of the targets. Spectral coherence analysis has been applied to vessel detection, according to the property that, in presence of a random distribution of surface scatterers, as for open sea surfaces, spectral coherence is expected to be proportional to sub-band intersection, while in presence of manmade structures it is preserved anyhow. First results show that spectral coherence is well preserved even for very small vessels, and can be used as a complementary information channel to constrain

No abstract

No abstract

There is an intense necessity for the development of new hardware architectures for the implementation of algorithms for hyperspectral image compression on board satellites. Graphics processing units (GPUs) represent a very attractive opportunity, offering the possibility to dramatically increase the computation speed in applications that are data and task parallel. An algorithm for the lossy compression of hyperspectral images is implemented on a GPU using Nvidia computer unified device architecture (CUDA) parallel computing architecture. The parallelization strategy is explained, with emphasis on the entropy coding and bit packing phases, for which a more sophisticated strategy is necessary due to the existing data dependencies. Experimental results are obtained by comparing the performance of the GPU implementation with a single-threaded CPU implementation, showing high speedups of up to 15.41. A profiling of the algorithm is provided, demonstrating the high performance of the designed parallel entropy coding phase. The accuracy of the GPU implementation is presented, as well as the effect of the configuration parameters on performance. The convenience of using GPUs for on-board processing is demonstrated, and solutions to the potential difficulties encountered when accelerating hyperspectral compression algorithms are proposed, if space-qualified GPUs become a reality in the near future. © The Authors. Published by SPIE under a Creative Commons Attribution 3.0 Unported License. Distribution or reproduction of this work in whole or in part requires full attribution of the original publication, including its DOI.

No abstract

In this paper we propose a lossless compression algorithm for hyperspectral images based on distributed source coding; this algorithm represents a significant improvement over our prior work on the same topic, and has been developed during a project funded by ESA-ESTEC. In particular, the algorithm achieves good compression performance with very low complexity; moreover, it also features a very good degree of error resilience. These features are obtained taking inspiration from distributed source coding, and particularly employing coset codes and CRC-based decoding. As the CRC can be used to decode blocks using a reference different from that used to compress the image, this yields error resilience. In particular, if a block is lost, decoding using the closest collocated block in the second previous band is successful about 70% of the times