Wavelet-based compression of M-FISH images

Multiplex fluorescence in situ hybridization (M-FISH) is a recently developed technology that enables multi-color chromosome karyotyping for molecular cytogenetic analysis. Each M-FISH image set consists of a number of aligned images of the same chromosome specimen captured at different optical wavelength. This paper presents embedded M-FISH image coding (EMIC), where the foreground objects/chromosomes and the background objects/images are coded separately. We first apply critically sampled integer wavelet transforms to both the foreground and the background. We then use object-based bit-plane coding to compress each object and generate separate embedded bitstreams that allow continuous lossy-to-lossless compression of the foreground and the background. For efficient arithmetic coding of bit planes, we propose a method of designing an optimal context model that specifically exploits the statistical characteristics of M-FISH images in the wavelet domain. Our experiments show that EMIC achieves nearly twice as much compression as Lempel-Ziv-Welch coding. EMIC also performs much better than JPEG-LS and JPEG-2000 for lossless coding. The lossy performance of EMIC is significantly better than that of coding each M-FISH image with JPEG-2000.     

Lossless, near-lossless, and refinement coding of bilevel images

We present general and unified algorithms for lossy/lossless coding of bilevel images. The compression is realized by applying arithmetic coding to conditional probabilities. As in the current JBIG standard the conditioning may be specified by a template. For better compression, the more general free tree may be used. Loss may be introduced in a preprocess on the encoding side to increase compression. The primary algorithm is a rate-distortion controlled greedy flipping of pixels. Though being general, the algorithms are primarily aimed at material containing half-toned images as a supplement to the specialized soft pattern matching techniques that work better for text. Template based refinement coding is applied for lossy-to-lossless refinement. Introducing only a small amount of loss in half-toned test images, compression is increased by up to a factor of four compared with JBIG. Lossy, lossless, and refinement decoding speed and lossless encoding speed are less than a factor of two slower than JBIG. The (de)coding method is proposed as part of JBIG2, an emerging international standard for lossless/lossy compression of bilevel images.     

Lossless Compression of Microarray Images Using Image-Dependent Finite-Context Models

The use of microarray expression data in state-of-the-art biology has been well established. The widespread adoption of this technology, coupled with the significant volume of data generated per experiment, in the form of images, has led to significant challenges in storage and query retrieval. In this paper, we present a lossless bitplane-based method for efficient compression of microarray images. This method is based on arithmetic coding driven by image-dependent multibitplane finite-context models. It produces an embedded bitstream that allows progressive, lossy-to-lossless decoding. We compare the compression efficiency of the proposed method with three image compression standards (JPEG2000, JPEG-LS, and JBIG) and also with the two most recent specialized methods for microarray image coding. The proposed method gives better results for all images of the test sets and confirms the effectiveness of bitplane-based methods and finite-context modeling for the lossless compression of microarray images.      

Motion compensated lossy-to-lossless compression of 4-D medical images using integer wavelet transforms.

This paper proposes a method for progressive lossy-to-lossless compression of four-dimensional (4-D) medical images (sequences of volumetric images over time) by using a combination of three-dimensional (3-D) integer wavelet transform (IWT) and 3-D motion compensation. A 3-D extension of the set-partitioning in hierarchical trees (SPIHT) algorithm is employed for coding the wavelet coefficients. To effectively exploit the redundancy between consecutive 3-D images, the concepts of key and residual frames from video coding is used. A fast 3-D cube matching algorithm is employed to do motion estimation. The key and the residual volumes are then coded using 3-D IWT and the modified 3-D SPIHT. The experimental results presented in this paper show that our proposed compression scheme achieves better lossy and lossless compression performance on 4-D medical images when compared with JPEG-2000 and volumetric compression based on 3-D SPIHT.     

The effect of microarray image compression on expression-based classification

Current gene-expression microarrays carry enormous amounts of information. Compression is necessary for efficient distribution and storage. This paper examines JPEG2000 compression of cDNA microarray images and addresses the accuracy of classification and feature selection based on decompressed images. Among other options, we choose JPEG2000 because it is the latest international standard for image compression and offers lossy-to-lossless compression while achieving high lossless compression ratios on microarray images. The performance of JPEG2000 has been tested on three real data sets at different compression ratios, ranging from lossless to 45:1. The effects of JPEG2000 compression/decompression on differential expression detection and phenotype classification have been examined. There is less than a 4% change in differential detection at compression rates as high as 20:1, with detection accuracy suffering less than 2% for moderate to high intensity genes, and there is no significant effect on classification at rates as high as 35:1. The supplementary material is available at .     

用于无线内窥镜系统的高效、低复杂度的准无损和无损压缩算法

为了降低无线内窥镜系统中无线通信的带宽以及无线发射的功耗,该文提出了一种高效、低复杂度的基于类似BAYER 彩色图像阵列的数字图像无损和准无损压缩/解压缩算法。通过对标准图像库中的7幅图像进行压缩的结果表明,该文提出的压缩算法比常规先插值后压缩的算法以及先压缩后插值的算法均具有更高的压缩性能和更低的复杂度;可实现对指定ROI区域实现无损压缩,其它区域实现准无损压缩。算法对无线内窥镜图像进行压缩时,可以获得平均图像压缩码率2.18bit/pixel,且PSNR大于47.57dB。     

CCSDS高光谱图像压缩算法的FPGA实现

最近空间数据系统咨询委员会（Consultative Committee for Space Data System,CCSDS）正式发布了CCSDS 123.0-B-1标准.该标准是星载高光谱图像无损压缩以及近无损压缩的国际通用标准.为了减少图像数据存储的容量,降低传输带宽,提高传输速率以及实现实时传输,本文简要介绍了最新的CCSDS算法标准,并采用该算法标准解决了高光谱图像的大容量问题.基于现场可编程门阵列（Field-Programmable Gate Array,FPGA）硬件的逻辑实现包括预测器的逻辑描述和编码器的逻辑描述.最后,比较了基于FPGA硬件逻辑实现的高光谱图像无损压缩仿真以及该算法和JPEG-LS算法的压缩特性.结果表明, CCSDS压缩算法可满足高光谱图像压缩比为2：1的要求.     

干涉多光谱图像无损压缩算法

基于干涉多光谱图像成像原理和特点,提出一种干涉多光谱图像无损压缩算法。在压缩编码时,应充分利用图像的列相关性,采用基于列的比特平面编码和游程编码,对多光谱图像进行无损压缩,特别适于低分辨率的多光谱图像压缩。目前无损压缩算法的压缩比基本在1.6～2.4之间,本算法的压缩倍数一般可达到2倍以上,并且具有良好的抗误码性能。     

An improved wavelet-based image coder for embedded greyscale and colour image compression

The embedded zero-tree wavelet (EZW) coding algorithm is a very effective technique for low bitrate still image compression. In this paper, an improved EZW algorithm is proposed to achieve a high compression performance in terms of PSNR and bitrate for lossy and lossless image compression, respectively. To reduce the number of zerotrees, the scanning and symbol redundancy of the existing EZW; the proposed method is based on the use of a new significant symbol map which is represented in a more efficient way. Furthermore, we develop a new EZW-based schemes for achieving a scalable colour image coding by exploiting efficiently the interdependency of colour planes. Numerical results demonstrate a significant superiority of our scheme over the conventional EZW and other improved EZW schemes with respect to both objective and subjective criteria for lossy and lossless compression applications of greyscale and colour images.     

Lossless compression of VLSI layout image data.

We present a novel lossless compression algorithm called Context Copy Combinatorial Code (C4), which integrates the advantages of two very disparate compression techniques: context-based modeling and Lempel-Ziv (LZ) style copying. While the algorithm can be applied to many lossless compression applications, such as document image compression, our primary target application has been lossless compression of integrated circuit layout image data. These images contain a heterogeneous mix of data: dense repetitive data better suited to LZ-style coding, and less dense structured data, better suited to context-based encoding. As part of C4, we have developed a novel binary entropy coding technique called combinatorial coding which is simultaneously as efficient as arithmetic coding, and as fast as Huffman coding. Compression results show C4 outperforms JBIG, ZIP, BZIP2, and two-dimensional LZ, and achieves lossless compression ratios greater than 22 for binary layout image data, and greater than 14 for gray-pixel image data.     

Gray-level-embedded lossless image compression

A level-embedded lossless compression method for continuous-tone still images is presented. Level (bit-plane) scalability is achieved by separating the image into two layers before compression and excellent compression performance is obtained by exploiting both spatial and inter-level correlations. A comparison of the proposed scheme with a number of scalable and non-scalable lossless image compression algorithms is performed to benchmark its performance. The results indicate that the level-embedded compression incurs only a small penalty in compression efficiency over non-scalable lossless compression, while offering the significant benefit of level-scalability.     

Lossless image coding via adaptive linear prediction andclassification

In past years, there have been several improvements in lossless image compression. All the recently proposed state-of-the-art lossless image compressors can be roughly divided into two categories: single and double-pass compressors. Linear prediction is rarely used in the first category, while TMW, a state-of-the-art double-pass image compressor, relies on linear prediction for its performance. We propose a single-pass adaptive algorithm that uses context classification and multiple linear predictors, locally optimized on a pixel-by-pixel basis. Locality is also exploited in the entropy coding of the prediction error. The results we obtained on a test set of several standard images are encouraging. On the average, our ALPC obtains a compression ratio comparable to CALIC while improving on some images     

Texture- and multiple-template-based algorithm for lossless compression of error-diffused images.

Recently, several efficient context-based arithmetic coding algorithms have been developed successfully for lossless compression of error-diffused images. In this paper, we first present a novel block- and texture-based approach to train the multiple-template according to the most representative texture features. Based on the trained multiple template, we next present an efficient texture- and multiple-template-based (TM-based) algorithm for lossless compression of error-diffused images. In our proposed TM-based algorithm, the input image is divided into many blocks and for each block, the best template is adaptively selected from the multiple-template based on the texture feature of that block. Under 20 testing error-diffused images and the personal computer with Intel Celeron 2.8-GHz CPU, experimental results demonstrate that with a little encoding time degradation, 0.365 s (0.901 s) on average, the compression improvement ratio of our proposed TM-based algorithm over the joint bilevel image group (JBIG) standard [over the previous block arithmetic coding for image compression (BACIC) algorithm proposed by Reavy and Boncelet is 24%] (19.4%). Under the same condition, the compression improvement ratio of our proposed algorithm over the previous algorithm by Lee and Park is 17.6% and still only has a little encoding time degradation (0.775 s on average). In addition, the encoding time required in the previous free tree-based algorithm is 109.131 s on average while our proposed algorithm takes 0.995 s; the average compression ratio of our proposed TM-based algorithm, 1.60, is quite competitive to that of the free tree-based algorithm, 1.62.     

一种基于自适应预测的医学图像高效无损压缩方法

随着数字化医学图像海量的增长及PACS系统的广泛应用,对医学图像进行高效的无损压缩已成为广泛关注的问题.本文提出一种基于自适应预测的无损压缩方法,该方法利用神经网络模型自学习的能力,自适应的调整预测器的预测系数.实验表明,该方法能有效去除X线医学图像的空间相关性,还能同时去除彩色医学图像的空间和谱间相关性,取得较高的压缩比,且编解码速度较高.     

基于JPEG2000的动态多感兴趣区域编码新方法

提出了一种基于JPEG2000的动态多感兴趣区域编码新方法,可以广泛地应用于各种交互式的客户/服务器应用环境.通过利用空信息包的特性和LRCP渐进方式,服务器在无需重新编码的前提下完成了原始码流的重组,从而实现了在渐进传输过程中的任意时刻,均可以有效地满足客户动态定义感兴趣区域及改变各个感兴趣区域优先级的需求.同时,由于和原始的JPEG2000码流结构保持完全一致,利用该算法同样可以实现感兴趣区域或整幅图像的无损压缩编码及渐进传输.实验结果表明:所提算法具有高度的灵活性,可以实现在低运算需求时的快速编解码.     

Lossless image compression using ordered binary-decision diagrams

A lossless compression algorithm for images based on ordered binary-decision diagrams (OBDDs) is presented. The algorithm finds an OBDD which represents the image exactly and then codes the OBDD efficiently. The results obtained show a great improvement with respect to a previous work     

基于灰度指纹图像信噪特征的无损压缩算法

本文提出了一个有效的针对灰度指纹图像的无损压缩算法.该算法通过将指纹图像的信噪特征融于新一代国际无损图像压缩标准的基本算法(基于上下文预测编码)而实现.该算法主要包括三个特色技术:基于纹线局部走向的分类预测、体现指纹微观纹理的扩展上下文以及基于成像仪器的分类熵编码器概率模型初始化.对一组真实数据及ISO标准图像的压缩结果表明该算法的压缩比居于国内外文献中的领先水平.     

图像灰度级动态分段的无损压缩编码方法

文中提出了一种新的无损图像压缩编码方法．通过对图像灰度值按四种情况进行动态分段编码压缩,对于不同的图像会有不同的分段选择,因而具有一定的自适应性．实验证明,这种压缩方法具有很好的压缩效果．     

Fast and accuracy extraction of infrared target based on Markov random field

Infrared images are characterized by small signal-to-noise ratio (SNR) and low contrast thus making it much difficult to achieve accurate infrared target extraction. This paper proposes a fast and accurate segmentation approach to extract targets from an infrared image. First, the regions of interests (ROIs) which contain the entire targets region and a little background region are detected based on the variance weighted information entropy feature. Second, the infrared image is modeled by Gaussian Markov random field (MRF), and the ROIs are used as the target regions while the remaining region as the background to perform the initial segmentation. Finally, by searching solution space within the ROIs, the targets are accurately extracted by the energy minimization using the iterated condition mode (ICM) based on the fact that targets can only exist in ROIs. Because the iterated segmentation results are updated within the ROIs only, this coarse-to-fine extraction method can greatly accelerate the convergence speed and efficiently reduce the interference of the background clutter and noise. Experimental results of the real infrared images demonstrate that the proposed method can extract single and multiple infrared targets accurately and rapidly.