ترغب بنشر مسار تعليمي؟ اضغط هنا

Fpack and Funpack Users Guide: FITS Image Compression Utilities

123   0   0.0 ( 0 )
 نشر من قبل Robert Seaman
 تاريخ النشر 2011
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Fpack is a utility program for optimally compressing images in the FITS (Flexible Image Transport System) data format (see http://fits.gsfc.nasa.gov). The associated funpack program restores the compressed image file back to its original state (if a lossless compression algorithm is used). (An experimental method for compressing FITS binary tables is also available; see section 7). These programs may be run from the host operating system command line and are analogous to the gzip and gunzip utility programs except that they are optimized for FITS format images and offer a wider choice of compression options.

قيم البحث

اقرأ أيضاً

This is the second part of a three-volume guide to TLUSTY and SYNSPEC. It presents a detailed reference manual for TLUSTY, which contains a detailed description of basic physical assumptions and equations used to model an atmosphere, together with an overview of the numerical methods to solve these equations.
142 - Ivan Hubeny , Thierry Lanz 2017
This paper presents a detailed operational manual for TLUSTY. It provides a guide for understanding the essential features and the basic modes of operation of the program. To help the user, it is divided into two parts. The first part describes the m ost important input parameters and available numerical options. The second part covers additional details and a comprehensive description of all physical and numerical options, and a description of all input parameters, many of which needed only in special cases.
233 - W. D. Pence , R. Seaman , 2009
We compare a variety of lossless image compression methods on a large sample of astronomical images and show how the compression ratios and speeds of the algorithms are affected by the amount of noise in the images. In the ideal case where the image pixel values have a random Gaussian distribution, the equivalent number of uncompressible noise bits per pixel is given by Nbits =log2(sigma * sqrt(12)) and the lossless compression ratio is given by R = BITPIX / Nbits + K where BITPIX is the bit length of the pixel values and K is a measure of the efficiency of the compression algorithm. We perform image compression tests on a large sample of integer astronomical CCD images using the GZIP compression program and using a newer FITS tiled-image compression method that currently supports 4 compression algorithms: Rice, Hcompress, PLIO, and GZIP. Overall, the Rice compression algorithm strikes the best balance of compression and computational efficiency; it is 2--3 times faster and produces about 1.4 times greater compression than GZIP. The Rice algorithm produces 75%--90% (depending on the amount of noise in the image) as much compression as an ideal algorithm with K = 0. The image compression and uncompression utility programs used in this study (called fpack and funpack) are publicly available from the HEASARC web site. A simple command-line interface may be used to compress or uncompress any FITS image file.
This document describes a convention for compressing n-dimensional images and storing the resulting byte stream in a variable-length column in a FITS binary table. The FITS file structure outlined here is independent of the specific data compression algorithm that is used. The implementation details for 4 widely used compression algorithms are described here, but any other compression technique could also be supported by this convention. The general principle used in this convention is to first divide the n-dimensional image into a rectangular grid of subimages or tiles. Each tile is then compressed as a block of data, and the resulting compressed byte stream is stored in a row of a variable length column in a FITS binary table. By dividing the image into tiles it is generally possible to extract and uncompress subsections of the image without having to uncompress the whole image.
61 - H. S. Bhat 2004
Here we carry out computations that help clarify the Lagrangian and Hamiltonian structure of compressible flow. The intent is to be pedagogical and rigorous, providing concrete examples of the theory outlined in Holm, Marsden, and Ratiu [1998] and Marsden, Ratiu, and Weinstein [1984].
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا