Abstract
Anneal provides a means by which users can obtain significant image enhancement over other general purpose techniques for SAR noise despeckling. Its principle disadvantage lies in its rather steep computation requirements, particularly on standard sized images (2048 by 2048 and 4096 by 4096). However, PULSAR has been able to produce a portable parallel version of Anneal that has excellent parallel performance on both workstation clusters and dedicated distributed memory parallel platforms. Speed-ups of 90 have been observed using 96 processors on the GC PowerPlus with the relatively small 1024 by 1024 image. Similar performance is expected on other platforms with a reasonable interconnect. Thus, Anneal is suitable for both providers of satellite SAR images (who likely employ MPP's to perform the initial low-level processing) as well as for interpreters and direct users of SAR data, whose source of computation comes from networked workstations.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Addison, E. Appiani, R. Cook, M. Corvi, J. Harms, G. Howard, B. Stephens, PULSAR: a Parallel Library for SAR Image Segmentation, Proceedings of HPCN'95, Milan, Italy, May, 1995, pp.898–903.
I. McConnell, R. G. White, C. J. Oliver and R. Cook, Radar cross-section estimation of SAR images, Proc. Europto Conference on SAR image analysis, simulation and modelling, Paris 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Addison, C. et al. (1996). PULSAR: Parallel noise despeckling of SAR images. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_545
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_545
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive