Recently, there has been an increased interest in quantitative MR parameters to improve diagnosis and treatment. Parameter mapping requires multiple images acquired with different timings usually resulting in long acquisition times. While acquisition time can be reduced by acquiring undersampled data, obtaining accurate estimates of parameters from undersampled data is a challenging problem, in particular for structures with high spatial frequency content. In this work, principal component analysis is combined with a model‐based algorithm to reconstruct maps of selected principal component coefficients from highly undersampled radial MRI data. This novel approach linearizes the cost function of the optimization problem yielding a more accurate and reliable estimation of MR parameter maps. The proposed algorithm—reconstruction of principal component coefficient maps using compressed sensing—is demonstrated in phantoms and in vivo and compared with two other algorithms previously developed for undersampled data. Magn Reson Med, 2012.
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.
1 November 2003 in IEEE Transactions on Consumer Electronics
JPEG2000 is the latest international standard for compression of still images. Although the JPEG2000 codec is designed to compress images, we illustrate that it can also be used to compress other signals. As an example, we illustrate how the JPEG2000 codec can be used to compress electrocardiogram (ECG) data. Experiments using the MIT-BIH arrhythmia database illustrate that the proposed approach outperforms many existing ECG compression schemes. The proposed scheme allows the use of existing hardware and software JPEG2000 codecs for ECG compression, and can be especially useful in eliminating the need for specialized hardware development. The desirable characteristics of the JPEG2000 codec, such as precise rate control and progressive quality, are retained in the presented scheme. The goal of this paper is to demonstrate the ECG application as an example. This example can be extended to other signals that exist within the consumer electronics realm.
A three-dimensional (3-D) image-compression algorithm based on integer wavelet transforms and zerotree coding is presented. The embedded coding of zerotrees of wavelet coefficients (EZW) algorithm is extended to three dimensions, and context-based adaptive arithmetic coding is used to improve its performance. The resultant algorithm, 3-D CB-EZW, efficiently encodes 3-D image data by the exploitation of the dependencies in all dimensions, while enabling lossy and lossless decompression from the same bit stream. Compared with the best available two-dimensional lossless compression techniques, the 3-D CB-EZW algorithm produced averages of 22%, 25%, and 20% decreases in compressed file sizes for computed tomography, magnetic resonance, and Airborne Visible Infrared Imaging Spectrometer images, respectively. The progressive performance of the algorithm is also compared with other lossy progressive-coding algorithms.
1 January 2002 in Signal Processing: Image Communication
A framework is proposed for iterative joint source-channel decoding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to perform source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance