Search

The use of whole-slide images (WSIs) in pathology entails stringent storage and transmission requirements because of their huge dimensions. Therefore, image compression is an essential tool to enable efficient access to these data. In particular, color transforms are needed to exploit the very high degree of inter-component correlation and obtain competitive compression performance. Even though the state-of-the-art color transforms remove some redundancy, they disregard important details of the compression algorithm applied after the transform. Therefore, their coding performance is not optimal. We propose an optimization method called mosaic optimization for designing irreversible and reversible color transforms simultaneously optimized for any given WSI and the subsequent compression algorithm. Mosaic optimization is designed to attain reasonable computational complexity and enable continuous scanner operation. Exhaustive experimental results indicate that, for JPEG 2000 at identical compression ratios, the optimized transforms yield images more similar to the original than the other state-of-the-art transforms. Specifically, irreversible optimized transforms outperform the Karhunen–Loève Transform in terms of PSNR (up to 1.1 dB), the HDR-VDP-2 visual distortion metric (up to 3.8 dB), and the accuracy of computer-aided nuclei detection tasks (F1 score up to 0.04 higher). In addition, reversible optimized transforms achieve PSNR, HDR-VDP-2, and nuclei detection accuracy gains of up to 0.9 dB, 7.1 dB, and 0.025, respectively, when compared with the reversible color transform in lossy-to-lossless compression regimes. [ABSTRACT FROM AUTHOR]

Digital cameras have become ubiquitous for amateur and professional applications. The raw images captured by digital sensors typically take the form of color filter array (CFA) mosaic images which must be “developed” (via digital signal processing) before they can be viewed. Photographers and scientists often repeat the “development process” using different parameters to obtain images suitable for different purposes. Since the development process is generally not invertible it is commonly desirable to store the raw (or undeveloped) mosaic images indefinitely. Uncompressed mosaic image file sizes can be more than 30 times larger than those of developed images stored in JPEG format. Thus data compression is of interest. Several compression methods for mosaic images have been proposed in the literature. However they all require a custom decompressor followed by development-specific software to generate a displayable image. In this paper a novel compression pipeline that removes these requirements is proposed. Specifically mosaic images can be losslessly recovered from the resulting compressed files and more significantly images can be directly viewed (decompressed and developed) using only a JPEG 2000 compliant image viewer. Experiments reveal that the proposed pipeline attains excellent visual quality while providing compression performance competitive to that of state-of-the-art compression algorithms for mosaic images. [ABSTRACT FROM PUBLISHER]

The analysis techniques applied to DNA microarray images are under active development. As new techniques become available, it will be useful to apply them to existing microarray images to obtain more accurate results. The compression of these images can be a useful tool to alleviate the costs associated to their storage and transmission. The recently proposed Relative Quantizer (RQ) coder provides the most competitive lossy compression ratios while introducing only acceptable changes in the images. However, images compressed with the RQ coder can only be reconstructed with a limited quality, determined before compression. In this work, a progressive lossy-to-lossless scheme is presented to solve this problem. First, the regular structure of the RQ intervals is exploited to define a lossy-to-lossless coding algorithm called the Progressive RQ (PRQ) coder. Second, an enhanced version that prioritizes a region of interest, called the PRQ-region of interest (ROI) coder, is described. Experiments indicate that the PRQ coder offers progressivity with lossless and lossy coding performance almost identical to the best techniques in the literature, none of which is progressive. In turn, the PRQ-ROI exhibits very similar lossless coding results with better rate-distortion performance than both the RQ and PRQ coders. [ABSTRACT FROM AUTHOR]

DNA microarrays are one of the fastest-growing new technologies in the field of genetic research, and DNA microarray images continue to grow in number and size. Since analysis techniques are under active and ongoing development, storage, transmission and sharing of DNA microarray images need be addressed, with compression playing a significant role. However, existing lossless coding algorithms yield only limited compression performance (compression ratios below 2:1), whereas lossy coding methods may introduce unacceptable distortions in the analysis process. This work introduces a novel Relative Quantizer (RQ), which employs non-uniform quantization intervals designed for improved compression while bounding the impact on the DNA microarray analysis. This quantizer constrains the maximum relative error introduced into quantized imagery, devoting higher precision to pixels critical to the analysis process. For suitable parameter choices, the resulting variations in the DNA microarray analysis are less than half of those inherent to the experimental variability. Experimental results reveal that appropriate analysis can still be performed for average compression ratios exceeding 4.5:1. [ABSTRACT FROM PUBLISHER]

Computed tomography (CT) is a noninvasive medical test obtained via a series of X-ray exposures resulting in 3-D images that aid medical diagnosis. Previous approaches for coding such 3-D images propose to employ multicomponent transforms to exploit correlation among CT slices, but these approaches do not always improve coding performance with respect to a simpler slice-by-slice coding approach. In this paper, we propose a novel analysis which accurately predicts when the use of a multicomponent transform is profitable. This analysis models the correlation coefficient r based on image acquisition parameters readily available at acquisition time. Extensive experimental results from multiple image sensors suggest that multicomponent transforms are appropriate for images with correlation coefficient r in excess of 0.87. [ABSTRACT FROM PUBLISHER]

Spectral transforms are widely used for the codification of remote-sensing imagery, with the Karhunen–Loêve transform (KLT) and wavelets being the two most common transforms. The KLT presents a higher coding performance than the wavelets. However, it also carries several disadvantages: high computational cost and memory requirements, difficult implementation, and lack of scalability. In this paper, we introduce a novel transform based on the KLT, which, while obtaining a better coding performance than the wavelets, does not have the mentioned disadvantages of the KLT. Due to its very small amount of side information, the transform can be applied in a line-based scheme, which particularly reduces the transform memory requirements. Extensive experimental results are conducted for the Airborne Visible/Infrared Imaging Spectrometer and Hyperion images, both for lossy and lossless and in combination with various hyperspectral coders. The results of the effects on Reed Xiaoli anomaly detection and k-means clustering are also included. The theoretical and experimental evidences suggest that the proposed transform might be a good replacement for the wavelets as a spectral decorrelator in many of the situations where the KLT is not a suitable option. [ABSTRACT FROM AUTHOR]