Comparison of information-preserving and information-losing data-compression algorithms for CT images
| Autor: | J M Bramble |
|---|---|
| Rok vydání: | 1989 |
| Předmět: |
business.industry
Computation ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Magnetic tape Huffman coding law.invention Computed tomographic Image (mathematics) symbols.namesake Transmission (telecommunications) law Image Processing Computer-Assisted symbols Humans Medicine Radiology Nuclear Medicine and imaging Computer vision Artificial intelligence Differential (infinitesimal) Tomography X-Ray Computed business Algorithms Data compression |
| Zdroj: | Radiology. 170:453-455 |
| ISSN: | 1527-1315 0033-8419 |
| DOI: | 10.1148/radiology.170.2.2911668 |
| Popis: | Data compression increases the number of images that can be stored on magnetic disks or tape and reduces the time required for transmission of images between stations. Two algorithms for data compression are compared in application to computed tomographic (CT) images. The first, an information-preserving algorithm combining differential and Huffman encoding, allows reconstruction of the original image. A second algorithm alters the image in a clinically acceptable manner. This second algorithm combines two processes: the suppression of data outside of the head or body and the combination of differential and Huffman encoding. Because the final image is not an exact copy, the second algorithm is information losing. Application of the information-preserving algorithm can double or triple the number of CT images that can be stored on hard disk or magnetic tape. This algorithm may also double or triple the speed with which images may be transmitted. The information-losing algorithm can increase storage or transmission speed by a factor of five. The computation time on this system is excessive, but dedicated hardware is available to allow efficient implementation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|