𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Astronomical image data compression by morphological skeleton transformation

✍ Scribed by L. Huang; A. Bijaoui


Publisher
Springer
Year
1990
Tongue
English
Weight
731 KB
Volume
1
Category
Article
ISSN
0922-6435

No coin nor oath required. For personal study only.

✦ Synopsis


Astronomical instruments currently provide a large amount of data. Nowadays, a large part of these data are image frames obtained with receivers of increasing size. The scan of large astronomical plates using fast microdensitometers gives image frames of over 30000 X 30000 pixels. More and more often, images are transmitted over a network in order to control the observations, to process the data, and to examine or to fill a data bank. The time taken for archiving, the cost of communication, the available memory given by magnetic tapes, and the limited bandwidth of transmission lines are reasons which lead us to examine the data compression of astronomical images.

The astronomical image has the characteristic of being a set of astronomical sources in the sky background whose values are not zero. We are, in fact, only interested in the astronomical sources. Once a suitable detection is made, we generally want a compression without any distorsion. In this paper, we present a method which can be adapted for this purpose. It is based on morphological skeleton transformations.

The experimental results show that it can give us an efficient compression. Moreover, the flexibility of choosing a structure element adapted to different images and the simplicity of implementation are other advantages of this method. Because of these characteristics, different compression applications may be treated.


πŸ“œ SIMILAR VOLUMES


Multiscale skeletons by image foresting
✍ A.X. FalcΓ£o; L. da Fontoura Costa; B.S. da Cunha πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 485 KB

The image foresting transform (IFT) reduces optimal image partition problems based on seed pixels to a shortest-path forest problem in a graph, whose solution can be obtained in linear time. Such a strategy has allowed a uniΓΏed and e cient approach to the design of image processing operators, such a

Image compression by means of wavelet tr
✍ Werner MΓΌhlmann; Arnold Hanslmeier πŸ“‚ Article πŸ“… 1996 πŸ› Springer 🌐 English βš– 396 KB

Images and spectra contain a large amount of data. Therefore the question arises, how this data can be decreased or compressed without losing important detail. The discrete wavelet transform is a tool which can be used to compress data because of its good approximation properties. It is very easy to