Search

Presents a study which are concerned with the compression of the complex phase history data obtained by a spotlight synthetic aperture radar systems. Rate allocation for spotlight SAR phase history data; Performance and operational evaluation; Results and discussion.

Presents information on a study which focused on the application of trellis-coded quantization (TCQ), a source coding technique, to the problem of downlink data rate reduction in synthetic aperture radar system. Information on TCQ; Implementation of a universal TCQ coding system; Implementation of trellis-coded vector quantization coding system; Performance evaluation.

Proposes a stopping rule for linear, iterative signal restoration using the gradient decent and conjugate gradient algorithms. Objective of the proposed rule; Approximation for the iterative algorithm; Application to the restoration of a complex magnetic resonance image from pseudorandomly sampled Fourier data.

Presents a near-lossless image compression scheme. Details on the scheme being a differential pulse code modulation system; Function of the scheme; Classification of image compression techniques.

Details a hyperspectral image coding scheme that utilizes the two-dimensional discrete cosine transform (DCT) and entropy-constrained predictive trellis coded quantization (ECPTCQ) to encode hyperspectral imagery. Interband correlation of hyperspectral imagery; Experimentation using hyperspectral data from AVIRIS; Side information for the algorithm.

Provides information on the presentation of a novel technique for image restoratin based on nonlinear interpolative vector quantization (NLVQ). Information on the image restoration; Detailed information on nonlinear VQ image restoration; Conclusion reached.

Analyses the effective elimination of error propagation effects on video compression, an error concealment algorithm for packet video was proposed. Adoption of this type of process in standard codecs; Details on the use of leaky prediction to assist in the solution to the problems in packet video; Methods used to evaluate the error propagation effects.

In spread spectrum (SS) communications, the input signal is spread over a wider bandwidth to avoid interference or interception. One of the most common SS techniques is direct sequence SS (DSSS). In this Letter, the authors propose non-cooperative compressive detection techniques for DSSS signals. The proposed compressive detection framework allows the use of random as well as designed measurement kernels. A technique for designing compressive measurement kernels which exploit DSSS signal structure and non-uniform usage of spreading codes is proposed. Theoretical and simulation results are provided to compare the performance of the proposed methods with their conventional counterparts. [ABSTRACT FROM AUTHOR]

Image compression systems that exploit the properties of the human visual system have been studied extensively over the past few decades. For the JPEG2000 image compression standard, all previous methods that aim to optimize perceptual quality have considered the irreversible pipeline of the standard. In this work, we propose an approach for the reversible pipeline of the JPEG2000 standard. We introduce a new methodology to measure visibility of quantization errors when reversible color and wavelet transforms are employed. Incorporation of the visibility thresholds using this methodology into a JPEG2000 encoder enables creation of scalable codestreams that can provide both near-threshold and numerically lossless representations, which is desirable in applications where restoration of original image samples is required. Most importantly, this is the first work that quantifies the bitrate penalty incurred by the reversible transforms in near-threshold image compression compared to the irreversible transforms. • A method to measure visibility of quantization error in reversible JPEG2000 is proposed. • Near-threshold and lossless compression are enabled in a single scalable codestream. • The impact of the nonlinearities in the reversible pipeline of JPEG2000 on near-threshold compression performance is quantified. [ABSTRACT FROM AUTHOR]

Regression wavelet analysis (RWA) is one of the current state-of-the-art lossless compression techniques for remote sensing data. This article presents the first regression-based near-lossless compression method. It is built upon RWA, a quantizer, and a feedback loop to compensate the quantization error. Our near-lossless RWA (NLRWA) proposal can be followed by any entropy coding technique. Here, the NLRWA is coupled with a bitplane-based coder that supports progressive decoding. This successfully enables gradual quality refinement and lossless and near-lossless recovery. A smart strategy for selecting the NLRWA quantization steps is also included. Experimental results show that the proposed scheme outperforms the state-of-the-art lossless and the near-lossless compression methods in terms of compression ratios and quality retrieval. [ABSTRACT FROM AUTHOR]

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]

With the increasing utilization of medical imaging in clinical practice and the growing dimensions of data volumes generated by various medical imaging modalities, the distribution, storage, and management of digital medical image data sets requires data compression. Over the past few decades, several image compression standards have been proposed by international standardization organizations. This paper discusses the current status of these image compression standards in medical imaging applications together with some of the legal and regulatory issues surrounding the use of compression in medical settings. [ABSTRACT FROM AUTHOR]

The Consultative Committee for Space Data Systems (CCSDS) has issued several data compression standards devised to reduce the amount of data transmitted from satellites to ground stations. This paper introduces a contextual arithmetic encoder for on-board data compression. The proposed arithmetic encoder checks the causal adjacent neighbors, at most, to form the context and uses only bitwise operations to estimate the related probabilities. As a result, the encoder consumes few computational resources, making it suitable for on-board operation. Our coding approach is based on the prediction and mapping stages of CCSDS-123 lossless compression standard, an optional quantizer stage to yield lossless or near-lossless compression and our proposed arithmetic encoder. For both lossless and near-lossless compression, the achieved coding performance is superior to that of CCSDS-123, M-CALIC, and JPEG-LS. Taking into account only the entropy encoders, fixed-length codeword is slightly better than MQ and interleaved entropy coding. [ABSTRACT FROM PUBLISHER]

A novel wavelet-based scheme to increase coefficient independence in hyperspectral images is introduced for lossless coding. The proposed regression wavelet analysis (RWA) uses multivariate regression to exploit the relationships among wavelet-transformed components. It builds on our previous nonlinear schemes that estimate each coefficient from neighbor coefficients. Specifically, RWA performs a pyramidal estimation in the wavelet domain, thus reducing the statistical relations in the residuals and the energy of the representation compared to existing wavelet-based schemes. We propose three regression models to address the issues concerning estimation accuracy, component scalability, and computational complexity. Other suitable regression models could be devised for other goals. RWA is invertible, it allows a reversible integer implementation, and it does not expand the dynamic range. Experimental results over a wide range of sensors, such as AVIRIS, Hyperion, and Infrared Atmospheric Sounding Interferometer, suggest that RWA outperforms not only principal component analysis and wavelets but also the best and most recent coding standard in remote sensing, CCSDS-123. [ABSTRACT FROM AUTHOR]

Preclinical micro-computed tomography (microCT) images are of utility for 3D morphological bone evaluation, which is of great interest in cancer detection and treatment development. This work introduces a compression strategy for microCTs that allocates specific substances in different Volumes of Interest (VoIs). The allocation procedure is conducted by the Hounsfield scale. The VoIs are coded independently and then grouped in a single DICOM-compliant file. The proposed method permits the use of different codecs, identifies and transmit data corresponding to a particular substance in the compressed domain without decoding the volume(s), and allows the computation of the 3D morphometry without needing to store or transmit the whole image. The proposed approach reduces the transmitted data in more than 90% when the 3D morphometry evaluation is performed in high density and low density bone. This work can be easily extended to other imaging modalities and applications that work with the Hounsfield scale. [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]

Spectral transforms are tools commonly employed in multi- and hyperspectral data compression to decorrelate images in the spectral domain. The pairwise orthogonal transform (POT) is one such transform that has been specifically devised for resource- constrained contexts similar to those found on board satellites or airborne sensors. Combining the POT with a 2-D coder yields an efficient compressor for multi- and hyperspectral data. However, a drawback of the original POT is that its dynamic range expansion, i.e., the increase in bit depth of transformed images, is not constant, which may cause problems with hardware implementations. Additionally, the dynamic range expansion is often too large to be compatible with the current 2-D standard CCSDS 122.0-B-1. This paper introduces the isorange POT, a derived transform that has a small and limited dynamic range expansion, compatible with CCSDS 122.0-B-1 in almost all scenarios. Experimental results suggest that the proposed transform achieves lossy coding performance close to that of the original transform. For lossless coding, the original POT and the proposed isorange POT achieve virtually the same performance. [ABSTRACT FROM AUTHOR]

The relation between the girth and the error correction capability of column-weight-three LDPC codes under the Gallager A algorithm is investigated. It is shown that a column-weight-three LDPC code with Tanner graph of girth g ≥ 10 can correct all error patterns with up to (g/2 - 1) errors in at most g/2 iterations of the Gallager A algorithm. For codes with Tanner graphs of girth g ≤ 8, it is shown that girth alone cannot guarantee correction of all error patterns with up to (g/2 - 1) errors under the Gallager A algorithm. Sufficient conditions to correct (g/2 - 1) errors are then established by studying trapping sets. [ABSTRACT FROM AUTHOR]

The relation between the girth and the guaranteed error correction capability of γ-left-regular low-density parity-check (LDPC) codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3γ/4 is found based on the Moore bound. This bound, combined with the well known expander based arguments, leads to a lower bound on the guaranteed error correction capability. The decoding failures of the bit flipping algorithms are characterized using the notions of trapping sets and fixed sets. The relation between fixed sets and a class of graphs known as cage graphs is studied. Upper bounds on the guaranteed error correction capability are then established based on the order of cage graphs. The results are extended to left-regular and right-uniform generalized LDPC codes. It is shown that this class of generalized LDPC codes can correct a linear number of worst case errors (in the code length) under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have the required expansion is established. [ABSTRACT FROM AUTHOR]

This study evaluated the compressibility of multislice CT (MSCT) datasets and its dependence on (1) slice thickness and (2) the use of three-dimensional (3D) vs. 2D JPEG2000 compression methods. Five thoracic CT datasets were obtained using a 16-detector MSCT scanner with a collimation of 0.75 mm (120 kVp, 90 mAs) and reconstructed at five slice thicknesses from 0.75 to 10.0 mm. These datasets were irreversibly compressed using a standard 2D JPEG2000 encoder and a developmental 3D JPEG2000 algorithm based on Part 2 of the JPEG2000 standard. Compression ratios ranged from 4:1 to 64:1. Image distortion was computed utilizing peak signal-to-noise ratio (PSNR) and the Sarnoff JNDmetrix visual discrimination model. For 2D compression, the thinnest sections were substantially less compressible than thicker sections for the same level of image quality, particularly at higher compression ratios. Applying 3D compression yielded consistently higher image quality in most cases compared to 2D compression at the same ratios. The advantage of 3D compression increased for thinner slices and higher compression ratios. These results indicate that 3D JPEG2000 (Part 2) compression offers substantial advantages over the current 2D JPEG2000 standard, yielding better quantitative image quality at similar compression ratios or comparable image quality at higher compression ratios. [Copyright &y& Elsevier]

With increasing utilization of medical imaging in clinical practice and the growing dimensions of data volumes generated by various medical imaging modalities, the distribution, storage, and management of digital medical image data sets requires data compression. Over the past few decades, several image compression standards have been proposed by international standardization organizations. This paper discusses the current status of these image compression standards in medical imaging applications together with some of the legal and regulatory issues surrounding the use of compression in medical settings.

Remote visualization of volumetric images has gained importance over the past few years in medical and industrial applications. Volume visualization is a computationally intensive process, often requiring hardware acceleration to achieve a real time viewing experience. One remote visualization model that can accomplish this would transmit rendered images from a server, based on viewpoint requests from a client. For constrained server-client bandwidth, an efficient compression scheme is vital for transmitting high quality rendered images. In this paper, we present a new view compensation scheme that utilizes the geometric relationship between viewpoints to exploit the correlation between successive rendered images. The proposed method obviates motion estimation between rendered images, enabling significant reduction to the complexity of a compressor. Additionally, the view compensation scheme, in conjunction with JPEG2000 performs better than AVC, the state of the art video compression standard.

In this paper, we address issues concerning bilevel image compression using JPEG2000. While JPEG2000 is designed to compress both bilevel and continuous tone image data using a single unified framework, there exist significant limitations with respect to its use in the lossless compression of bilevel imagery. In particular, substantial degradation in image quality at low resolutions severely limits the resolution scalable features of the JPEG2000 code-stream. We examine these effects and present two efficient methods to improve resolution scalability for bilevel imagery in JPEG2000. By analyzing the sequence of rounding operations performed in the JPEG2000 lossless compression pathway, we introduce a simple pixel assignment scheme that improves image quality for commonly occurring types of bilevel imagery. Additionally, we develop a more general strategy based on the JPIP protocol, which enables efficient interactive access of compressed bilevel imagery. It may be noted that both proposed methods are fully compliant with Part 1 of the JPEG2000 standard.

A fast rate-optimal rate allocation algorithm is proposed for parallel transmission of scalable images in multichannel systems. Scalable images are transmitted via fixed-length packets. The proposed algorithm selects a subchannel, as well as a channel code rate for each packet, based on the signal-to-noise ratios (SNRs) of the subchannels. The resulting scheme provides unequal error protection of source bits and significant gains are obtained over equal error protection schemes. An application of the proposed algorithm to JPEG2000 transmission shows the advantages of exploiting differences in SNRs between subchannels. Multiplexing of multiple sources is also considered, and additional gains are achieved by exploiting information diversity among the sources.

The high compression efficiency and various features provided by JPEG2000 make it attractive for image transmission purposes. A novel joint source/channel coding scheme tailored for JPEG2000 is proposed in this paper to minimize the end-to-end image distortion within a given total transmission rate through memoryless channels. It provides unequal error protection by combining the forward error correction capability from channel codes and the error detection/localization functionality from JPEG2000 in an effective way. The proposed scheme generates quality scalable and error-resilient codestreams. It gives competitive performance with other existing schemes for JPEG2000 in the matched channel condition case and provides more graceful quality degradation for mismatched cases. Furthermore, both fixed-length source packets and fixed-length channel packets can be efficiently formed with the same algorithm.