基于脊波变换的图像压缩算法

自然图像包括大量的具有明显“直线边缘”的图像,而且边缘表示了图像的主要信息。利用脊波对“直线奇异”的良好刻画,针对具有直线特征的图像,设计基于脊波变换的有损压缩算法。首先对图像进行脊波变换,然后对变换系数进行标量量化、扫描、游程编码和熵编码。仿真实验表明,与基于小波变换的JPEG 2000压缩算法相比,该算法能获得更高的压缩率,同时保持较高的信噪比。     

基于BWT和FVQ的极低比特率图像编码算法

该文提出了一种基于双正交小波变换(BWT)和模糊矢量量化(FVQ)的极低比特率图像编码算法。该算法通过构造符合图像小波变换系数特征的跨频带矢量,充分利用了不同频带小波系数之间的相关性,有效地提高了图像的编码效率和重构质量。该算法采用非线性插补矢量量化(NLIVQ)的思想,从大维数矢量中提取小维数的特征矢量,并提出了一种新的模糊矢量量化方法一渐进构造模糊聚类(PCFC)算法用于特征矢量的量化,从而大大提高了矢量量化的速度和码书质量。实验结果证明,该算法在比特率为0．172bpp的条件下仍能获得PSNR＞30dB的高质量重构图像。     

基于BWT和FVQ的极低比特率图像编码算法

该文提出了一种基于双正交小波变换（ＢＷＴ）和模糊矢量量化（ＦＶＱ）的极低比特率图像编码算法。该算法通过构造符合图像小波变换系数特征的跨频带矢量,充分利用了不同频带小波系数之间的相关性,有效地提高了图像的编码效率和重构质量。     

图像子波／分类矢量量化及其在指纹识别中的应用

提出了适用于子波变换系数的矢量量化方法－－子波／分类矢量量化（Ｗ／ＣＶＱ）。以子波变换系数中对应于图像边缘信息的零交叉片段的具体情况为依据，将子波变换图像矢量分为不同的类别，然后为各类矢量建立码本。初步实验结果表明，该方法能克服传统矢量量化编码子波交换系数不能准确恢复有关边缘信息的缺点，此结果在光学实时指纹识别系统中的应用表明，它能够充分保留原因图像的信息，保证识别系统的准确识别。     

应用神经网络的图像分类矢量量化编码

矢量量化作为一种有效的图像数据压缩技术，越来越受到人们的重视。设计矢量量化器的经典算法ＬＢＧ算法，由于运算复杂，从而限制了矢量量化的实用性。本文讨论了应用神经网络实现的基于边缘特征分类的矢量量化技术。它是根据人的视觉系统对图象的边缘的敏感性，应用模式识别技术，在对图像编码前，以边缘为特征对图像内容分类，然后再对每类进行矢量量化。除特征提取是采用离散余弦变换外，图像的分类和矢量量化都是由神经网络完成     

快速可变速率SAR原始数据压缩算法

该文在原分块自适应矢量量化(BAVQ)算法基础上,提出了一种通过改变矢量码书大小及矢量维数来获得可变的编码数据率的改进措施。为了降低改进算法的计算复杂度,采用了数据块方差的查表法及矢量量化的快速搜索算法。对SAR原始数据进行压缩的结果表明,改进算法能够在不降低量化信噪比的情况下,获得更高的编码效率。不同数据率的解压缩数据生成图像,都不同程度地保留了原始图像中的细节信息。     

基于空间组合矢量分类的小波图像网格编码矢量量化

本文基于零树编码、矢量分类和网格编码量化的思想,提出了对小波图像采用空间矢量组合和分类后进行网格编码矢量量化的新方法.该方法充分利用了各高频子带系数频率相关性和空间约束性,依据组合矢量能量和零树矢量综合判定进行分类,整幅图像只需单一量化码书,分类信息占用比特数少.对重要类矢量实行加权网格编码矢量量化,利用卷积编码扩展信号空间以增大量化信号间的欧氏距离,用维特比算法搜索最优量化序列,比使用矢量量化提高了0.6db左右.该方法编码计算复杂度适中,解码简单,可达到很好的压缩效果.     

一种极低码率视频压缩编码算法的VLSI结构

本文提出了一种基于分类矢量量化的极低码率视频编码算法及其ＶＬＳＩ结构,它结合了四叉树分割,分类矢量量化算法,变块大小运动估计等多种算法,在获得较高压缩率同时,又克服了低码率图像编码算法中常见的边缘细节模糊的缺陷,同时,本算法在保留了矢量量化解码顺简单的优点的同时,并给出了一种易于ＶＬＳＩ实现的编码器结构,其中运动估计电路可和矢量量化器共用处理器阵列,从而减少了编码器的电路规模。’     

一种应用于指纹识别系统的指纹图像压缩算法

针对应用于指纹识别系统中指纹图像的压缩编码问题,提出了一种改进的基于四叉树分类的网格编码量化(QTCQ)的指纹图像压缩算法.该算法对小波变换后的高频系数采用2×2的DCT变换进一步集中能量,并对变换后的系数进行系数重排以使得高频子带内的重要系数集中于相应子带的低频位置,再通过基于四叉树的网格编码量化进行量化编码.仿真结果表明,该算法比WSQ和JPEG2000等均具有更好的压缩性能.     

一种改进的DCT图像压缩算法

文章以基于分块的离散余弦变换(BDCT)为基础,提出了一种改进的DCT图像压缩算法.首先,将源图像分解为32×32子图像并对每一图像块进行DCT运算,进而对量化后的DCT系数进行位平面编码以消除编码冗余,最后利用分块效应图像在小波域中的特性,进一步对分块效应进行消除.实验结果表明,本算法获得的解压图像在主观评价和客观评价上都拥有较之JPEG2000更好的压缩效果.     

Vector quantization with hierarchical classification of sub-blocks

A hierarchical classified vector quantization (HCVQ) method is described. In this method, the image is coded in several steps, starting with a relatively large block size, and successively dividing the block into smaller sub-blocks in a quad-tree fashion. The initial block is first vector quantized in the normal way. Classified vector quantization is then performed for its sub-blocks using the vector index of the initial block, i.e. rough information of the image, and the location of the sub-block within the initial block as classifiers. The coding proceeds in a similar way, adding more information of the fine details at each level. The method is found to be effective and to give a good subjective quality. It is also simple to implement, leading to coding speeds typical to a tree search VQ.     

量化方法及其统计特征量用于图像检索的性能比较

分别对标量量化,矢量量化以及分类矢量量化等不同量化方法及其统计特征量用于图像检索的性能进行了分析和比较,对进一步实现支持检索的图像压缩算法具有一定的指导意义。     

Adaptive edge-based side-match finite-state classified vectorquantization with quadtree map

Vector quantization (VQ) is an effective image coding technique at low bit rate. The side-match finite-state vector quantizer (SMVQ) exploits the correlations between neighboring blocks (vectors) to avoid large gray level transition across block boundaries. A new adaptive edge-based side-match finite-state classified vector quantizer (classified FSVQ) with a quadtree map has been proposed. In classified FSVQ, blocks are arranged into two main classes, edge blocks and nonedge blocks, to avoid selecting a wrong state codebook for an input block. In order to improve the image quality, edge vectors are reclassified into 16 classes. Each class uses a master codebook that is different from the codebooks of other classes. In our experiments, results are given and comparisons are made between the new scheme and ordinary SMVQ and VQ coding techniques. As is shown, the improvement over ordinary SMVQ is up to 1.16 dB at nearly the same bit rate, moreover, the improvement over ordinary VQ can be up to 2.08 dB at the same bit rate for the image, Lena. Further, block boundaries and edge degradation are less visible because of the edge-vector classification. Hence, the perceptual image quality of classified FSVQ is better than that of ordinary SMVQ.     

Classified Vector Quantization of Images

Vector quantization (VQ) provides many attractive features for image coding with high compression ratios. However, initial studies of image coding with VQ have revealed several difficulties, most notably edge degradation and high computational complexity. We address these two problems and propose a new coding method, classified vector quantization (CVQ), which is based on a composite source model. Blocks with distinct perceptual features, such as edges, are generated from different subsources, i.e., belong to different classes. In CVQ, a classifier determines the class for each block, and the block is then coded with a vector quantizer designed specifically for that class. We obtain better perceptual quality with significantly lower complexity with CVQ when compared to ordinary VQ. We demonstrate with CVQ visual quality which is comparable to that produced by existing coders of similar complexity, for rates in the range 0.6-1.0 bits/pixel.     

Blocking effect reduction of compressed images using classification-based constrained optimization

In this paper we propose an adaptive image restoration algorithm using block-based edge-classification for reducing block artifacts in compressed images. In order to efficiently reduce block artifacts, edge direction of each block is classified by using model-fitting criterion, and the constrained least-squares (CLS) filter with corresponding direction is used for restoring the block. The proposed restoration filter is derived based on the observation that the quantization operation in a series of coding processes is a nonlinear and many-to-one mapping operator. Then we propose an approximated version of a constrained optimization technique as a restoration process for removing the nonlinear and space-varying degradation operator. For real-time implementation, the proposed restoration filter can be realized in the form of a truncated FIR filter, which is suitable for postprocessing reconstructed images in digital TV, video conferencing systems, etc.     

Predictive subband image coding with wavelet transform

Wavelet transform can decompose images into various multiresolution subbands. In these subbands the correlation exists. A novel technique for image coding by taking advantage of the correlation is addressed. It is based on predictive edge detection from the LL band of the lowest resolution level to predict the edge in the LH, HL and HH bands in the higher resolution level. If the coefficient is predicted as an edge it is preserved; otherwise, it is discarded. In the decoder, the location of the preserved coefficients can also be found as in the encoder. Therefore, no overhead is needed. Instead of complex vector quantization, which is commonly used in subband image coding for high compression ratio, simple scalar quantization is used to code the remaining coefficients and achieves very good results.     

用于图像编码的相关矢量量化研究

当相邻的图像块用矢量量化（ＶＱ）编码时可能出现编码地址相同的情况,尤其是在图像的平滑区。为了减少相邻块间编码地址的相关性,本文提出了一种相关矢量量化方案,采用相关码书与改进的自组织特征映射（ＩＳＯＦＭ）码书同时编码一个窗口内的四个邻域块,与无记忆类ＶＱ相比,对一幅典型的“Ｌｅｎｎａ”图象,编码过程中所需计算量减少一半,比特率减少４０％,由于在Ｋｏｈｏｎｅｎ自组织神经网络的训练过程中,对边缘类矢量采     

Interpolative vector quantization of color images

Interpolative vector quantization has been devised to alleviate the visible block structure of coded images plus the sensitive codebook problems produced by a simple vector quantizer. In addition, the problem of selecting color components for color picture vector quantization is discussed. Computer simulations demonstrate the success of this coding technique for color image compression at approximately 0.3 b/pel. Some background information on vector quantization is provided     

Multiple shell structured hypercube feature maps for vector quantization of images

A new neural network architecture is proposed for spatial domain image vector quantization (VQ). The proposed model has a multiple shell structure consisting of binary hypercube feature maps of various dimensions, which are extended forms of Kohonen's self-organizing feature maps (SOFMs). It is trained so that each shell can contain similar-feature vectors. A partial search scheme using the neighborhood relationship of hypercube feature maps can reduce the computational complexity drastically with marginal coding efficiency degradation. This feature is especially proper for vector quantization of a large block or high dimension. The proposed scheme can also provide edge preserving VQ by increasing the number of shells, because shells far from the origin are trained to contain edge block features.     

支持向量机在边缘匹配矢量量化图像编码中的应用

针对边缘匹配矢量量化图像编码方法存在的出轨现象,提出一种引入支持向量机的方法.将分块后的样本图像输入支持向量机,建立区分边界区块与否的分类模型,并产生两种码书,对待编码区块,由支持向量机预测它的类型,选择相应的码书.实验结果表明,该方法处理灰度变化较大的边界和灰度变化平缓的非边界都有较好的效果.