共查询到20条相似文献,搜索用时 15 毫秒
1.
An Algorithm for Vector Quantizer Design 总被引:22,自引:0,他引:22
An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data. The basic properties of the algorithm are discussed and demonstrated by examples. Quite general distortion measures and long blocklengths are allowed, as exemplified by the design of parameter vector quantizers of ten-dimensional vectors arising in Linear Predictive Coded (LPC) speech compression with a complicated distortion measure arising in LPC analysis that does not depend only on the error vector. 相似文献
2.
Mohammadali Khosravifard Hossein Saidi Morteza Esmaeili T. Aaron Gulliver 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(3):955-975
The problem of selecting a code for finite monotone sources with N symbols is considered. The selection criterion is based on minimizing the average redundancy (called Minave criterion) instead of its maximum (i.e., Minimax criterion). The average probability distribution PNmacr, whose associated Huffman code has the minimum average redundancy, is derived. The entropy of the average distribution (i.e., H(PNmacr)) and the average entropy of the monotone distributions (i.e., H(PNmacr)) are studied. It is shown that both logN-H(PNmacr) and logN-H(PNmacr) are asymptotically equal to a constant (sime0.61). Therefore, there is only a negligible penalty (at most 1.61 bits/symbol) in using a simple fixed-length code with respect to the optimal code. An efficient near-optimal encoding technique is also proposed. The consequences of the two approaches, i.e., Minave and Minimax, are compared in terms of their associated distributions and associated codes. In order to evaluate the average performance of the Minimax code, we prove that the informational divergence of the average distribution and Minimax distribution asymptotically grows as -2.275+loglogN 相似文献
3.
Zoran H. Peric Milan R. Dincic Dragan B. Denic Aleksandar V. Jocic 《Wireless Personal Communications》2011,59(4):625-641
The aim of this paper is to improve the G.711 standard, which is widely used, especially in the public switched telephone
network (PSTN). Two solutions are proposed. The first solution uses only lossless coder, achieving a bit-rate decrease of
0.82 bits/sample, compared to the G.711 codec. The second solution uses forward adaptation and a lossless coder, further decreasing
the bit-rate (by 1.25 bits/sample) and achieving higher average signal-to-quantization noise ratio (SQNR) in comparison with the G.711 codec. Also, the second solution is more robust than the G.711 codec, which means that it has
near constant SQNR for a wide range of input signal power. That is very important for signals whose input power varies with time, such as speech
and video signals. Our solutions are compatible with the G.711 codec, they have little additional complexity and delay and
therefore can be applied in real-time systems, such as PSTN or VoIP. They can also be used in many other systems, such as
WiMax and OFDM, as a replacement or improvement of the G.711 codec. Standardization process of the G.711.1 standard (which
is a wide-band extension of the G.711 standard) is largely present. Our solutions fulfill all the requirements for that new
standard; therefore they can be implemented in its low-frequency part. 相似文献
4.
5.
6.
本文提出一种序号预测矢量量化器的结构,与一般矢量量化器相比,它充分利用了图象极强的二维相关特性,并采用预测的方法去除冗余码字,从而在保证译码图象质量与一般矢量量化器的译码图象质量相同的前提下,压缩比可提高一倍以上。 相似文献
7.
宽带ISF参数的非等系数帧间预测分裂矢量量化方法 总被引:1,自引:0,他引:1
本文提出了一种新的适用于宽带语音编码ISF参数量化的非等系数帧间预测分裂矢量量化方案.该量化方案利用ISF参数的帧间相关性,基于预测分裂矢量量化原理,首先对待量化的ISF参数矢量进行去均值和非等系数帧间预测,然后对去均值后的ISF参数的预测残差进行分裂矢量量化.实验表明,该算法在每帧编码比特数为46bits时达到了透明量化,且平均谱失真比G.722.2中ISF参数量化的平均谱失真小. 相似文献
8.
本文讨论了人工神经网络技术在语音压缩编码方面的应用,提出了一种用Kohonen网络实现语音多脉冲激励分析模型的矢量量化方法。该方法将参数分析和量化编码熔为一体,和传统的先分析、后量化方法相比较,具有许多优良的特性,如全并行处理、过程简化等。本文针对语音多脉冲激励模型,提出了量化网络的结构和学习规则,并将此方法和传统方法进行了比较。最后对网络的压缩性能进行了计算机模拟,结果表明应用人工神经网络进行语音信源的压缩是切实可行的。 相似文献
9.
Noise is ubiquitous in real life and changes image acquisition, communication, and processing characteristics in an uncontrolled manner. Gaussian noise and Salt and Pepper noise, in particular, are prevalent in noisy communication channels, camera and scanner sensors, and medical MRI images. It is not unusual for highly sophisticated image processing algorithms developed for clean images to malfunction when used on noisy images. For example, hidden Markov Gauss mixture models (HMGMM) have been shown to perform well in image segmentation applications, but they are quite sensitive to image noise. We propose a modified HMGMM procedure specifically designed to improve performance in the presence of noise. The key feature of the proposed procedure is the adjustment of covariance matrices in Gauss mixture vector quantizer codebooks to minimize an overall minimum discrimination information distortion (MDI). In adjusting covariance matrices, we expand or shrink their elements based on the noisy image. While most results reported in the literature assume a particular noise type, we propose a framework without assuming particular noise characteristics. Without denoising the corrupted source, we apply our method directly to the segmentation of noisy sources. We apply the proposed procedure to the segmentation of aerial images with Salt and Pepper noise and with independent Gaussian noise, and we compare our results with those of the median filter restoration method and the blind deconvolution-based method, respectively. We show that our procedure has better performance than image restoration-based techniques and closely matches to the performance of HMGMM for clean images in terms of both visual segmentation results and error rate. 相似文献
10.
根据恒虚警慢门限的理论,讨论了量化门限间接随噪声电平变化保持恒虚警的必要性及恒虚警慢门限噪声采样区的自动有效判别问题,提出了一种新在和复杂环境下采样区的自动有效判别及门限自动调整方案。 相似文献
11.
Daniel Marco David L. Neuhoff 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(3):1177-1179
This correspondence considers low-resolution scalar quantization for a memoryless Gaussian source with respect to absolute error distortion. It shows that slope of the operational rate-distortion function of scalar quantization is infinite at the point Dmax where the rate becomes zero. Thus, unlike the situation for squared error distortion, or for Laplacian and exponential sources with squared or absolute error distortion, for a Gaussian source and absolute error, scalar quantization at low rates is far from the Shannon rate-distortion function, i.e., far from the performance of the best lossy coding technique 相似文献
12.
本文从空域及频域两方面对二项分布——拉普拉斯(LOB)及离散的高斯——拉普拉斯(DLOG)边缘检测算子进行了分析比较.在两种算子的尺度空间常数很大时,它们的时域和频域特性及对图象进行边缘检测的性能是基本相同的.但当尺度空间常数较小时,从它们在频域中带通特性的中心频率、3分贝带宽及截止频率处的高频衰减性能进行比较可知,LOB算子稍优于离散的LOG算子.故LOB算子可看成是LOG算子的一种离散实现.文中给出了实验结果,证明了分析结果的正确性. 相似文献
13.
Low-rate vector quantizers are designed and simulated for highly correlated Gauss-Markov sources and the resulting performance is compared with Arnstein's optimized predictive quantizer and with Huang and Schultheiss' optimized transform coder. Two implementations of vector quantizers are considered: full search vector quantizers-which are optimal but require large codebook searches-and tree searched vector quantizers-which are suboptimal but require far less searching. The various systems are compared on the basis of performance, complexity, and generality of design techniques. 相似文献
14.
15.
16.
17.
G. Cortelazzo D. Della Giustina G. A. Mian 《Circuits, Systems, and Signal Processing》1996,15(5):555-572
This work addresses the design of LoG filters in the frequency domain within a structure formed by the cascade of quasi-Gaussian and discrete Laplacian filters. The main feature of such a structure is that it requires half the number of convolutions of the classical structure in which the LoG transfer function is expressed as the sum of two separable transfer functions of 1-D Gaussian and LoG type. Such a perspective allows one to rephrase the design of IIR and FIR filters for edge detection as a frequency domain approximation problem solvable by standard digital filter design tools. The zero-phase IIR solutions have a good performance at low orders and approximation errors practically independent of the aperture parameter. The characteristics of the nearly linear-phase IIR filters solving the problem suggest the consideration of linear-phase FIR filters with zeros constrained on the unit circle. The use of such filters leads to remarkable computational savings with respect to the filters designed by impulse response sampling. The agreement between the edge values obtained by the filters designed according to the scheme proposed in this work and those obtained by standard techniques is very good.Work carried out with the financial support of the C.N.R.-Progetto Finalizzato Robotica, contract no. 91.01942.PF67. 相似文献
18.
19.
Jeong D.G. Gibson J.D. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1993,39(3):786-804
Lattice vector quantizer design procedures for nonuniform sources are presented. The procedures yield lattice vector quantizers with excellent performance and retaining the structure required for fast quantization. Analytical methods for truncating and scaling lattices to be used in vector quantizations are given, and their utility is demonstrated for independent and identically distributed (i.i.d.) Gaussian and Laplacian sources. An analytical technique for piecewise linear multidimensional compandor designs is evaluated for i.i.d. Gaussian and Laplacian sources by comparing its performance to that of the other vector quantizers 相似文献
20.
复合高斯杂波(CGC)在拟合高分辨力、低掠射角海杂波中已得到广泛应用,带有逆伽马纹理的CGC的强度分布为广义帕累托(GP)分布。在实际雷达工作场景中,由于观测区域内海杂波的非平稳非均匀特性,导致独立同分布杂波样本的获取十分困难。提出一种广义帕累托分布参数的贝叶斯估计方法,通过在线更新数据的先验信息,获取小样本情形下GP分布参数。仿真实验证明,该方法能够在样本数量较小的情况下,对GP数据实现较为精确的参数估计。 相似文献