一种用于图像分类的语义增强线性编码方法

针对传统编码模型中存在的编码歧义性问题,该文提出一种考虑特征上下文的语义增强线性编码方法。首先,通过学习局部邻域中特征共生关系矩阵来表示上下文信息。然后,在编码过程中同时引入学习而得的上下文信息与特征上下文匹配权重得到语义增强编码模型。由于上下文信息与上下文匹配权重的功能,使得此编码方法不仅丰富了编码的语义信息,还能够有效避免噪声带来的影响。在3个基准数据集(Scene15, Caltech101以及 Caltech256)上充分的实验验证了该方法的有效性。     

n-words模型下Hesse稀疏表示的图像检索算法

论文针对视觉词袋(BOVW)模型放弃图像空间结构的缺点,提出一种基于Hesse稀疏编码的图像检索算法。首先,建立n-words模型,获得图像局部特征表示。n-words模型由一系列连续视觉词获得,是图像特征的一种高级描述。该文从n=1到n=5进行试验,寻找最恰当的n值;其次,将二阶Hesse能量函数融入标准稀疏编码的目标函数,得到Hesse稀疏编码公式;最后,以获得的n-words序列作为编码特征,利用特征符号搜索算法求解最优Hesse系数,计算相似度,返回检索结果。实验在两类数据集上进行,与BOVW模型和已有的算法相比,新算法极大地提高了图像检索的准确率。     

Subjective Evaluation of Several Efficient Speech Coders

The voice quality of several 9.6 - 32 kbit/s coders is determined with an extensive set of subjective listening tests. Single encodings of μ255 PCM, adaptive differential PCM (ADPCM), subband coding (SBC), vocoder-driven adaptive transform coding (ATC), adaptive predictive coding (APC), and time domain harmonic scaling combined with SBC are compared in an idealized situation, that is, no added impairments. It is shown that single encodings of modest complexity 32 kbit/s coders such as ADPCM and SBC and more complex 24 kbit/s coders such as vocoder-driven ATC and APC offer quality nearly equivalent to 64 kbit/s μ255 PCM. However, these conclusions are drawn in the absence of a realistic telephone network where tandem encodings, delay limitations, and nonvoice signals exist. Tandem encodings of 64 kbit/s μ255 PCM, 32 kbit/s ADPCM, 16 kbit/s SBC, and 16 kbit/s APC are also evaluated. These 32 kbit/s and 16 kbit/s coders offer degraded tandem performance as compared to 64 kbit/s PCM, with the exception of synchronous tandeming of 32 kbit/s ADPCM with 64 kbit/s PCM where several encodings are subjectively equivalent to a single encoding of 32 kbit/s ADPCM.     

Interframe Cosine Transform Image Coding

Two-dimensional transform coding and hybrid transform/DPCM coding techniques have been investigated extensively for image coding. This paper presents a theoretical and experimental extension of these techniques to the coding of sequences of correlated image frames. Two coding methods are analyzed: three-dimensional cosine transform coding, and two-dimensional cosine transform coding within an image frame combined with DPCM coding between frames. Theoretical performance estimates are developed for the coding of Markovian image sources. Simulation results are presented for transmission over error-free and binary symmetric channels.     

适应于极低传输码率的物体基图像编码

本文介绍了物体基编码的基本方法、算法流 程及其关键技术。该编码方法的重要特点是既考虑到所处理对象的一般性，又利用了一定的先验知识，因此可用于极低传输速度的图像编码，是电视电话中的一种很有应用前景的编码方法。     

三维矩阵彩色图像WDCT压缩编码

本文深入研究了三维矩阵,首次提出了一种新的基于三维矩阵的宽离散余弦变换(3-D WDCT),并且定义了它的运算准则,证明了它的正反变换和相关性质,将之应用到彩色图像的压缩编码中.我们知道,彩色图像的三帧是同一物理模型的映射,具有相同的纹理,边缘和灰度变化等.本文充分考虑了彩色图像三帧间的结构相似性,把彩色图像的各个分量表示在一个统一的数学模型里,使彩色图像的R,G,B三帧第一次作为一个整体进行压缩编码,同时去除帧间的与帧内的冗余,而不是象其他方法那样把各个分量独立处理.实验结果表明,这种方法的重建图像无论是压缩比,信噪比,还是视觉效果都有明显提高.本文运用并发展了目前较为成熟的离散余弦变换技术,与JPEG和MPEG都有很好的兼容性.     

分形图像编码研究的进展

 分形图像编码是近几年发展起来的一种新的图像编码方法,目前对其研究较为广泛.本文介绍了分形图像压缩编码的数学原理、基本特性,着重介绍了当今这一领域的发展成果,比较了各种方案的优缺点,分析了目前编码方案所存在的缺点、原因及未来的发展方向.     

序列图像的分形编码

分形方法作为一种新兴的图像编码方法,有着压缩比高等独特的优点。但由于它也有着致命的缺点,即编码速度速度很慢,目前对于序列图像的分形编码的研究方兴未艾。文章介绍了两类主要的序列图像分形编码方法,并对其进行了展望。     

基于第二代Bandelet变换的图像编码

Bandelet基函数可以实现几何正则图像的最佳稀疏表示,在图像压缩方面有很大潜力。为了得到更高的压缩比,在第二代Bandelet变换的研究基础上,提出了一种与Bandelet变换相适应的图像编码方案。首先对Bandelet系数采用一致量化,重新组织系数的排布方式,然后设计了一种针对Bandelet系数的上下文模型,进行基于上下文的编码。对低频子带采用CALIC模型进行编码。实验表明,该编码方法对自然图像压缩是有效的,特别是对几何流特征比较明显的图像取得了优于JPEG 2000的结果。     

匹配视觉生理机制的方向分解图象编码

本文对方向分解图像编码进行了系统研究。与Kunt方案相比,提出了更有效的边缘信息选择和编码算法,改进了内插方法和模型,并采用了新的方向滤波器设计方法,基于上述改进,建立了一套完整的匹配视觉生理机制的方向分解图像编码算法。系统模拟实验表明,当数据压缩比近60:1时,采用本方案仍能获得较好的图像质量。     

Least-Squares-Based Switching Structure for Lossless Image Coding

Many coding methods are more efficient with some images than others. In particular, run-length coding is very useful for coding areas of little changes. Adaptive predictive coding achieves high coding efficiency for fast changing areas like edges. In this paper, we propose a switching coding scheme that will combine the advantages of both run-length and adaptive linear predictive coding. For pixels in slowly varying areas, run-length coding is used; otherwise least-squares (LS)-adaptive predictive coding is used. Instead of performing LS adaptation in a pixel-by-pixel manner, we adapt the predictor coefficients only when an edge is detected so that the computational complexity can be significantly reduced. For this, we use a simple yet effective edge detector using only causal pixels. This way, the proposed system can look ahead to determine if the coding pixel is around an edge and initiate the LS adaptation in advance to prevent the occurrence of a large prediction error. With the proposed switching structure, very good prediction results can be obtained in both slowly varying areas and pixels around boundaries. Furthermore, only causal pixels are used for estimating the coding pixels in the proposed encoder; no additional side information needs to be transmitted. Extensive experiments as well as comparisons to existing state-of-the-art predictors and coders will be given to demonstrate its usefulness.     

Recursive Temporal Filtering and Frame Rate Reduction for Image Coding

The effect of temporal recursive filtering and frame rate reduction on a sequence of moving images is investigated. Following a well-known first-order Markov model for the temporal domain data, the effect of filtering and frame rate reduction on the values of variance, correlation coefficient, filtering distortion, and interframe prediction error are mathematically derived. The validity of these derivations is verified by the experimental results using a CCITT standard sequence which closely follows the first-order Markov model. The effect of temporal filtering and frame rate reduction to the coding rate is examined by encoding the CCITT standard sequence using a combined interframe and intraframe Scene Adaptive Coding system. At a frame rate of 30 frames per second, a 2:1 reduction in coding rate is obtained with a filtering coefficient of 0.5. At a frame rate of 10 frames per second, an additional reduction factor of nearly 2 is obtained using the same filtering coefficient. Selected images are presented to demonstrate the subjective effect.     

视频图像中端至端失真估算的研究

视频图像数据量大、压缩码流抗误性低,而现有通信网络的承载能力有限、传输性能不可靠,往往造成解码重建视频图像质量致命性地降低。有效控制信源与信道编码,使端至端失真最小是提高解码重建视频图像质量的关键,而精确的失真估算模型是获得最小端至端失真的前提。对几种典型的端至端失真估算模型进行了简要分析,指出了这些模型中待解决的关键问题并展望了端至端失真估算模型良好的发展前景。     

Survey of Adaptive Image Coding Techniques

The following is a survey of the technical literature on adaptive coding of imagery. Section 1 briefly discusses the general problem of image data compression. The optimum image data compression system, from a theoretical viewpoint, is presented in Section 1.1. The theoretical and the implementational problems of the optimum system are discussed and the assumptions that are made to overcome these problems are outlined. One important assumption is the stationarity which is not true for most imagery. In adaptive systems the parameters are varied according to changes in signal statistics optimizing the system performance for nonstationary signals. In this article the adaptive systems are divided to four categories. Section 2 is a survey of adaptive transform coding systems. Section 3 discusses adaptive predictive coding systems. Sections 4 and 5 discuss adaptive cluster coding and adaptive entropy technique, respectively.     

图象压缩技术及其应用

本文介绍当前图象数据压缩技术的研究与应用，对于静态图象重点讨论以人眼视觉感知特性为指导的压缩技术，对于动态图象压缩技术，着重介绍ＭＰＥＧ－２及正在发展中的ＭＰＥＧ－４的一些目标和特点，以及基于模型的编码方法，文中还简介了图象压缩技术的应用和产品研制情况。     

分形与图像压缩编码

本文概述分形图像压缩的理论基础,介绍分形图像编码的IFS方法,讨论小波技术在分形图像编码中的应用。     

基于分形理论的图像压缩编码技术

分形图像压缩编码是当今图像编码领域研究的热点之一，是一种具有独特优势且极有发展前途的数据压缩技术。本文从分形基本理论出发，对分形图像压缩编码思想、编码方法等进行了综述，并介绍了分形图像压缩编码的一些改进方法。最后，探讨了分形图像压缩编码的发展方向。     

基于图像活动性的序列图像分形编码方法

介绍了分形的概念以及分形压缩的主要思想;阐述了传统的分形图像压缩编码的基本原理与实现方法;提出了一种基于图像活动性序列图像分形编码方法。该方法首先由相邻帧之间的预测差值来判断当前编码块的活动性,然后根据图像的活动性,对不同特性的块采用不同的分形编码策略,最后对编码后得到的迭代函数系统（IFS）码进行可变长度编码（VLC）,以获得更高的压缩比。     

机动目标的逆合成孔径雷达成像原理与算法

对于非合作的机动目标,由于目标相对于雷达射线的姿态和转速难以测定,而且是时变的,因而给逆合成孔径雷达(ISAR)成像造成较大困难.本文讨论了这种情况下成像的一般原理,并对机动性不太大,散射点子回波多普勒变化满足一阶近似条件时,提出了实用算法.实测数据的处理结果说明新算法是可行的.     

小波图像的膨胀-游程编码算法

提出了一种基于形态膨胀运算和游程编码的新型小波编码器膨胀-游程(Dilation-Run)算法。编码器根据图像小波变换后重要系数的带内聚类特性和重要系数分布的带间相似性,利用数学形态学中的膨胀运算搜索并编码各聚类中的重要系数;同时使用一种高效的游程编码技术对各聚类的种子系数,即膨胀运算起始点的位置进行编码,从而避免了小波图像中非重要系数的逐个编码。编码器算法简单,并且基于位平面实现,因此输出码流具有渐进性。实验结果表明,膨胀-游程算法的性能优于零树小波编码器SPIHT,并能与两种形态学小波编码器MRWD 和SLCCA的性能媲美。对于聚类特性显著的图像,算法的性能则优于上述形态学小波编码器。