Reversible decorrelation method for progressive transmission of 3-Dmedical image

In this paper, the authors present a new reversible decorrelation method of three-dimensional (3-D) medical images for progressive transmission. Progressive transmission of an image permits gradual improvement of image quality while being displayed. When the amount of image data is very large, as a 3-D medical image, the progressive transmission plays an important role in viewing or browsing the image. The data structure presented in this paper takes account of interframe correlation as well as intraframe correlation of the 3-D image. This type of data structure has been termed the 3-D hierarchy embedded differential image (3-D-HEDI) as was derived from the earlier HEDI structure (Kim et al., 1995). Experiments were conducted to verify the performance of 3-D HEDI in terms of the decorrelation efficiency as well as the progressive transmission efficiency. It is compared with those of conventional hierarchy interpolation (HINT), two-dimensional (2-D) HEDI and differential pulse code modulation (DPCM). Experimental results indicate that 3-D HEDI outperforms HINT, 2-D HEDI and DPCM in both decorrelation efficiency as well as the progressive transmission efficiency on 3-D medical images     

Reversible interframe compression of medical images: a comparison of decorrelation methods

The authors investigate whether data representing medical image sequences can be compressed more efficiently by taking into account the temporal correlation between the sequence frames. The standard of comparison is intraframe HINT, the best-known reversible decorrelation method for 2-D images. In interframe decorrelation, a distinction is made between extrapolation- and interpolation-based methods, and methods based on local motion estimation, block motion estimation, and unregistered decorrelation. These distinctions give six classes of interframe decorrelation methods, all of which are described. The methods are evaluated by applying them to sequences of coronary X-ray angiograms, ventricle angiograms, and liver scintigrams, as well as to a (nonmedical) videoconferencing image sequence. For the medical image sequences: (1) interpolation-based methods are superior to extrapolation-based methods; (2) estimation of interframe motion is not advantageous for image compression; (3) interframe compression yields entropies comparable to intraframe HINT at higher computational costs; and (4) two methods, unregistered extrapolation and interpolation, are nonetheless possibly interesting alternatives to intraframe HINT.     

The use of contextual information in the reversible compression of medical images

The authors investigate the use of conditioning events (or contexts) in improving the performances of known compression methods by building a source model with multiple contexts to code the decorrelated pixels. Three methods for reversible compression, namely DPCM (differential pulse code modulation), WHT (Walsh-Hadamard transform), and HINT (hierarchical interpolation), employing, respectively, predictive decorrelation, transform decorrelation, and multiresolution decorrelation, are considered. It is shown that the performance of these methods can be enhanced significantly, sometimes even up to 40%, by using contexts. The enhanced DPCM method is found to perform the best for MR and UT (ultrasound) medical images; the enhanced WHT method is found to be the best for X-ray images. The source models used in the enhanced models employ several hundred contexts.     

Reversible intraframe compression of medical images

The performance of several reversible, intraframe compression methods is compared by applying them to angiographic and magnetic resonance (MR) images. Reversible data compression involves two consecutive steps: decorrelation and coding. The result of the decorrelation step is presented in terms of entropy. Because Huffman coding generally approximates these entropy measures within a few percent, coding has not been investigated separately. It appears that a hierarchical decorrelation method based on interpolation (HINT) outperforms all other methods considered. The compression ratio is around 3 for angiographic images of 8-9 b/pixel, but is considerably less for MR images whose noise level is substantially higher.     

Statistical distributions of DCT coefficients and their application to an interframe compression algorithm for 3-D medical images

Displacement estimated interframe (DEI) coding, a coding scheme for 3-D medical image data sets such as X-ray computed tomography (CT) or magnetic resonance (MR) images, is presented. To take advantage of the correlation between contiguous slices, a displacement-compensated difference image based on the previous image is encoded. The best fitting distribution functions for the discrete cosine transform (DCT) coefficients obtained from displacement compensated difference images are determined and used in allocating bits and optimizing quantizers for the coefficients. The DEI scheme is compared with 2-D block discrete cosine transform (DCT) as well as a full-frame DCT using the bit allocation technique of S. Lo and H.K. Huang (1985). For X-ray CT head images, the present bit allocation and quantizer design, using an appropriate distribution model, resulted in a 13-dB improvement in the SNR compared to the full-frame DCT using the bit allocation technique. For an image set with 5-mm slice thickness, the DEI method gave about 5% improvement in the compression ratio on average and less blockiness at the same distortion. The performance gain increases to about 10% when the slice thickness decreases to 3 mm.     

基于均匀圆阵的相干源三维参数估计算法

基于均匀圆阵,提出了一种宽频段信号频率和二维到达角联合估计的新方法—CTDS算法。通过对构造的波达矩阵进行特征分解,该算法能精确地估计具有相同数字频率的相干信号的三维参数,无需多维谱峰搜索,具有计算量小,三维参数自动配对的优点。另外,算法通过增加延迟抽头级数解相干,因此避免了通常的降维解相干算法引起的阵列孔径损失,同时减少了所需的阵元数。计算机仿真结果验证了算法的有效性。     

2-D locally regularized tissue strain estimation from radio-frequency ultrasound images: theoretical developments and results on experimental data

In this paper, a 2-D locally regularized strain estimation method for imaging deformation of soft biological tissues from radio-frequency (RF) ultrasound (US) data is introduced. Contrary to most 2-D techniques that model the compression-induced local displacement as a 2-D shift, our algorithm also considers a local scaling factor in the axial direction. This direction-dependent model of tissue motion and deformation is induced by the highly anisotropic resolution of RF US images. Optimal parameters are computed through the constrained maximization of a similarity criterion defined as the normalized correlation coefficient. Its value at the solution is then used as an indicator of estimation reliability, the probability of correct estimation increasing with the correlation value. In case of correlation loss, the estimation integrates an additional constraint, imposing local continuity within displacement and strain fields. Using local scaling factors and regularization increase the method's robustness with regard to decorrelation noise, resulting in a wider range of precise measurements. Results on simulated US data from a mechanically homogeneous medium subjected to successive uniaxial loadings demonstrate that our method is theoretically able to accurately estimate strains up to 17%. Experimental strain images of phantom and cut specimens of bovine liver clearly show the harder inclusions.     

Image interpolation by two-dimensional parametric cubic convolution.

Cubic convolution is a popular method for image interpolation. Traditionally, the piecewise-cubic kernel has been derived in one dimension with one parameter and applied to two-dimensional (2-D) images in a separable fashion. However, images typically are statistically nonseparable, which motivates this investigation of nonseparable cubic convolution. This paper derives two new nonseparable, 2-D cubic-convolution kernels. The first kernel, with three parameters (designated 2D-3PCC), is the most general 2-D, piecewise-cubic interpolator defined on [-2, 2] x [-2, 2] with constraints for biaxial symmetry, diagonal (or 90 degrees rotational) symmetry, continuity, and smoothness. The second kernel, with five parameters (designated 2D-5PCC), relaxes the constraint of diagonal symmetry, based on the observation that many images have rotationally asymmetric statistical properties. This paper also develops a closed-form solution for determining the optimal parameter values for parametric cubic-convolution kernels with respect to ensembles of scenes characterized by autocorrelation (or power spectrum). This solution establishes a practical foundation for adaptive interpolation based on local autocorrelation estimates. Quantitative fidelity analyses and visual experiments indicate that these new methods can outperform several popular interpolation methods. An analysis of the error budgets for reconstruction error associated with blurring and aliasing illustrates that the methods improve interpolation fidelity for images with aliased components. For images with little or no aliasing, the methods yield results similar to other popular methods. Both 2D-3PCC and 2D-5PCC are low-order polynomials with small spatial support and so are easy to implement and efficient to apply.     

Asymptotically optimal blind estimation of multichannel images.

Optimal estimation of a two-dimensional (2-D) multichannel signal ideally decorrelates the data in both channel and space and weights the resulting coefficients according to their SNR. Many scenarios exist where the required second-order signal and noise statistics are not known in which the decorrelation is difficult or expensive to calculate. An asymptotically optimal estimation scheme proposed here uses a 2-D discrete wavelet transform to approximately decorrelate the signal in space and the discrete Fourier transform to decorrelate between channels. The coefficient weighting is replaced with a wavelet-domain thresholding operation to result in an efficient estimation scheme for both stationary and nonstationary signals. In contrast to optimal estimation, this new scheme does not require second-order signal statistics, making it well suited to many applications. In addition to providing vastly improved visual quality, the new estimator typically yields signal-to-noise ratio gains 12 dB or higher for hyperspectral imagery and functional magnetic resonance images.     

DPCM picture coding using two-dimensional quantizer

For achieving an improved performance of a DPCM coder used for encoding picture signals, it is important to design an efficient predictor and an efficient quantizer. In the DPCM coder, the improvement in SNR achieved with a 2-D predictor over a 1-D predictor is insignificant if a 1-D quantizer is used for quantizing the prediction error. This short communication describes a scheme in which a DPCM coder uses a 2-D quantizer. The performance of the scheme shows an advantage of approximately 20% savings in bandwidth over a DPCM coder using the conventional 1-D quantizer.     

Image compression using the 2-D wavelet transform

The 2-D orthogonal wavelet transform decomposes images into both spatial and spectrally local coefficients. The transformed coefficients were coded hierarchically and individually quantized in accordance with the local estimated noise sensitivity of the human visual system (HVS). The algorithm can be mapped easily onto VLSI. For the Miss America and Lena monochrome images, the technique gave high to acceptable quality reconstruction at compression ratios of 0.3-0.2 and 0.64-0.43 bits per pixel (bpp), respectively.     

3-D/2-D registration by integrating 2-D information in 3-D

In image-guided therapy, high-quality preoperative images serve for planning and simulation, and intraoperatively as "background", onto which models of surgical instruments or radiation beams are projected. The link between a preoperative image and intraoperative physical space of the patient is established by image-to-patient registration. In this paper, we present a novel 3-D/2-D registration method. First, a 3-D image is reconstructed from a few 2-D X-ray images and next, the preoperative 3-D image is brought into the best possible spatial correspondence with the reconstructed image by optimizing a similarity measure (SM). Because the quality of the reconstructed image is generally low, we introduce a novel SM, which is able to cope with low image quality as well as with different imaging modalities. The novel 3-D/2-D registration method has been evaluated and compared to the gradient-based method (GBM) using standardized evaluation methodology and publicly available 3-D computed tomography (CT), 3-D rotational X-ray (3DRX), and magnetic resonance (MR) and 2-D X-ray images of two spine phantoms, for which gold standard registrations were known. For each of the 3DRX, CT, or MR images and each set of X-ray images, 1600 registrations were performed from starting positions, defined as the mean target registration error (mTRE), randomly generated and uniformly distributed in the interval of 0-20 mm around the gold standard. The capture range was defined as the distance from gold standard for which the final TRE was less than 2 mm in at least 95% of all cases. In terms of success rate, as the function of initial misalignment and capture range the proposed method outperformed the GBM. TREs of the novel method and the GBM were approximately the same. For the registration of 3DRX and CT images to X-ray images as few as 2-3 X-ray views were sufficient to obtain approximately 0.4 mm TREs, 7-9 mm capture range, and 80%-90% of successful registrations. To obtain similar results for MR to X-ray registrations, an image, reconstructed from at least 11 X-ray images was required. Reconstructions from more than 11 images had no effect on the registration results.     

Six-bit DPCM video signal processing and implementation using systolic arrays

A novel approach to increase the speed and reduce the hardware requirement of 2-D systolic convolvers for real-time video signal/image processing is proposed. This is achieved by coding video signals/images more efficiently using six-bit 1-D DPCM coding. It is shown that using six-bit differential pulse-code modulation processing results in a 57% improvement in speed and a significant saving in the cost of 2-D systolic convolvers. The effect of quantisation errors on DPCM image convolution is also presented.<>     

Nonlinear prediction in image coding with DPCM

In contrast to the traditional linear differential pulse code modulation (DPCM) design for the encoding of images, a new, nonlinear, neural network-based, DPCM technique has been devised. The predictor is designed by supervised training, based on a typical sequence of pixel values in an image. A function link neural network architecture has been used to design the predictor for one dimensional (1-D) DPCM. Computer simulation experiments in still image coding have shown that the resulting encoders work very well. At a transmission rate of 1 bit/pixel, for the image LENA, the 1-D neural network DPCM provides a 4.2 dB improvement in SNR over the standard linear DPCM system.<>     

Optimal CT scanning plan for long-bone 3-D reconstruction

Digital computed tomographic (CT) data are widely used in three-dimensional (3-D) construction of bone geometry and density features for 3-D modelling purposes. During in vivo CT data acquisition the number of scans must be limited in order to protect patients from the risks related to X-ray absorption. The aim of this work is to automatically define, given a finite number of CT slices, the scanning plan which returns the optimal 3-D reconstruction of a bone segment from in vivo acquired CT images. An optimization algorithm based on a Discard-Insert-Exchange technique has been developed. In the proposed method the optimal scanning sequence is searched by minimizing the overall reconstruction error of a two-dimensional (2-D) prescanning image: an anterior-posterior (AP) X-ray projection of the bone segment. This approach has been validated in vitro on 3 different femurs. The 3-D reconstruction errors obtained through the optimization of the scanning plan on the 3-D prescanning images and on the corresponding 3-D data sets have been compared. 2-D and 3-D data sets have been reconstructed by linear interpolation along the longitudinal axis. Results show that direct 3-D optimization yields root mean square reconstruction errors which are only 4%-7% lower than the 2-D-optimized plan, thus proving that 2-D-optimization provides a good suboptimal scanning plan for 3-D reconstruction. Further on, 3-D reconstruction errors given by the optimized scanning plan and a standard radiological protocol for long bones have been compared. Results show that the optimized plan yields 20%-50% lower 3-D reconstruction errors     

Detection and elimination of 2-D transmission error patterns inDPCM images

The paper studies two methods for detecting and removing channel error patterns in images transmitted by two-dimensional differential-pulse-code-modulation (2-D DCM) with fixed-length words. The methods are based on statistical classification and filtering procedures. For the predictions A+(C-B)/2 and A+(D-B)/2 in combination with 4-b DPCM, it is demonstrated experimentally by computer simulation that the effect of channel errors can effectively be reduced at bit-error rates (BERs) up to approximately 0.1%     

Registration of 3-D CT and 2-D Flat Images of Mouse via Affine Transformation

It is difficult to directly coregister the 3-D fluorescence molecular tomography (FMT) image of a small tumor in a mouse whose maximal diameter is only a few millimeters with a larger CT image of the entire animal that spans about 10 cm. This paper proposes a new method to register 2-D flat and 3-D CT image first to facilitate the registration between small 3-D FMT images and large 3-D CT images. A novel algorithm combining differential evolution and improved simplex method for the registration between the 2-D flat and 3-D CT images is introduced and validated with simulated images and real images of mice. The visualization of the alignment of the 3-D FMT and CT image through 2-D registration shows promising results.      

$n$ -SIFT: $n$ -Dimensional Scale Invariant Feature Transform

We propose the $n$ -dimensional scale invariant feature transform ( $n$-SIFT) method for extracting and matching salient features from scalar images of arbitrary dimensionality, and compare this method's performance to other related features. The proposed features extend the concepts used for 2-D scalar images in the computer vision SIFT technique for extracting and matching distinctive scale invariant features. We apply the features to images of arbitrary dimensionality through the use of hyperspherical coordinates for gradients and multidimensional histograms to create the feature vectors. We analyze the performance of a fully automated multimodal medical image matching technique based on these features, and successfully apply the technique to determine accurate feature point correspondence between pairs of 3-D MRI images and dynamic $3{rm D} + {rm time}$ CT data.      

Optimal use of Markov models for DPCM picture transmission over noisy channels

Joint source/channel decoders that use the residual redundancy in the source are investigated for differential pulse code modulation (DPCM) picture transmission over a binary symmetric channel. Markov sequence decoders employing the Viterbi algorithm that use first-order source statistics are reviewed, and generalized for decoders that use second-order source statistics. To make optimal use of the source correlation in both horizontal and vertical directions, it is necessary to generalize the conventional Viterbi decoding algorithm for a one higher-dimensional trellis. The paths through the trellis become two-dimensional "sheets", thus, the technique is coined "sheet decoding". By objective [reconstruction signal-to-noise ratio (SNR)] and subjective measure, it is found that the sheet decoders outperform the Markov sequence decoders that use a first-order Markov model, and outperform two other known decoders (modified maximum a posteriori probability and maximal SNR) that use a second-order Markov model. Moreover, it is found that the use of a simple rate-2/3 block code in conjunction with Markov model-aided decoding (MMAD) offers significant performance improvement for a 2-bit DPCM system. For the example Lenna image, it is observed that the rate-2/3 block code is superior to a rate-2/3 convolutional code for channel-error rates higher than 0.035. The block code is easily incorporated into any of the MMAD DPCM systems and results in a 2-bit MMAD DPCM system that significantly outperforms the noncoded 3-bit MMAD DPCM systems for channel-error rates higher than 0.04.     

Spiral CT image deblurring for cochlear implantation

Cochlear implantation is the standard treatment for profound hearing loss, Preimplantation and postimplantation spiral computed tomography (CT) is essential in several key clinical and research aspects. The maximum image resolution with commercial spiral CT scanners is insufficient to define clearly anatomical features and implant electrode positions in the inner ear, In this paper, the authors develop an expectation maximization (EM)-like iterative deblurring algorithm to achieve spiral CT image super-resolution for cochlear implantation, assuming a spatially invariant linear spiral CT system with a three-dimensional (3-D) separable Gaussian point spread function (PSF). The authors experimentally validate the 3-D Gaussian blurring model via phantom measurement and profile fitting. The imaging process is further expressed as convolution of an isotropic 3-D Gaussian PSF and a blurred underlying volumetric image. Under practical conditions, an oblique reconstructed section is approximated as convolution of an isotropic two dimensional (2-D) Gaussian PSF and the corresponding actual cross section. The spiral CT image deblurring algorithm is formulated with sieve and resolution kernels for suppressing noise and edge artifacts. A typical cochlear cross section is used for evaluation, demonstrating a resolution gain up to 30%-40% according to the correlation criterion. Physical phantoms, preimplantation and postimplantation patients are reconstructed into volumes of 0.1-mm cubic voxels. The patient images are digitally unwrapped along the central axis of the cochlea and the implanted electrode array respectively, then oblique sections orthogonal to the central axis formed. After deblurring, representation of structural features is substantially improved in all the cases