Nothing Special   »   [go: up one dir, main page]

CN104702961A - Code rate control method for distributed video coding - Google Patents

Code rate control method for distributed video coding Download PDF

Info

Publication number
CN104702961A
CN104702961A CN201510086215.4A CN201510086215A CN104702961A CN 104702961 A CN104702961 A CN 104702961A CN 201510086215 A CN201510086215 A CN 201510086215A CN 104702961 A CN104702961 A CN 104702961A
Authority
CN
China
Prior art keywords
distribution
residual error
cauchy
lambda
cluster
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510086215.4A
Other languages
Chinese (zh)
Other versions
CN104702961B (en
Inventor
张登银
蔡睿
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Post and Telecommunication University
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201510086215.4A priority Critical patent/CN104702961B/en
Publication of CN104702961A publication Critical patent/CN104702961A/en
Application granted granted Critical
Publication of CN104702961B publication Critical patent/CN104702961B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

本发明公开了一种分布式视频编码中建立相关噪声模型及估计模型参数的方法,该混合模型首先利用K-Mediods将残差系数分为小残差和大残差,利用改进的拉普拉斯分布描述小残差系数的分布,采用柯西分布描述大残差系数。该文提出的混合模型(Hybrid Distribution Correlation Noise Model,HDCNM)能较精确地描述WZ帧和边信息间的残差系数分布,从而有效地改善了变换域分布式视频编码的率失真性能,并减少系统解码端计算复杂度。

The invention discloses a method for establishing a correlation noise model and estimating model parameters in distributed video coding. The mixed model first uses K-Mediods to divide residual coefficients into small residuals and large residuals, and uses improved Lapla The Sri Lankan distribution is used to describe the distribution of small residual coefficients, and the Cauchy distribution is used to describe the large residual coefficients. The Hybrid Distribution Correlation Noise Model (HDCNM) proposed in this paper can more accurately describe the distribution of residual coefficients between WZ frames and side information, thus effectively improving the rate-distortion performance of transform-domain distributed video coding and reducing Computational complexity of the decoding side of the system.

Description

一种分布式视频编码中码率控制方法A Bit Rate Control Method in Distributed Video Coding

技术领域technical field

本发明涉及一种在分布式视频编码中码率控制方法,属于视频压缩领域。The invention relates to a code rate control method in distributed video coding, which belongs to the field of video compression.

背景技术Background technique

分布式视频编码(Distributed Video Coding,DVC)是基于20世纪70年代Slepian.Wolf以及Wyner.Ziv提出的信息理论而建立的,将编码器运算复杂度转移到解码器。其特点是编码简单、解码较复杂、压缩性能接近传统的编码方式、抗误码能力强,适用于无线网络中资源受限的视频编码设备等。Distributed Video Coding (DVC) is based on the information theory proposed by Slepian.Wolf and Wyner.Ziv in the 1970s, which transfers the computational complexity of the encoder to the decoder. It is characterized by simple encoding, complex decoding, compression performance close to traditional encoding methods, strong anti-error capability, and is suitable for video encoding equipment with limited resources in wireless networks.

分布式视频编码中多使用Turbo码或者LDPC码这样的信道编码对WZ帧进行编码。虽然Turbo码和LDPC码都是能够接近理论界的信道编码方案,但有研究结果表明LDPC码的整体性能要好于Turbo码,对于运动剧烈的视频,LDPC方案抗误码率性能更好。在分布式视频编码中,原始WZ帧与相应边信息间相关噪声模型的准确度对编码效率有很大影响,相关噪声模型越准确,LDPC码成功解码需要的校验位就越少,一方面降低了码率,提高了压缩效率;另一方面,减少了LDPC码解码的计算量。所以,解码端对相关噪声的准确建模是分布式视频编码的一个关键技术。In distributed video coding, channel coding such as Turbo code or LDPC code is often used to code WZ frames. Although both Turbo codes and LDPC codes are channel coding schemes close to the theoretical world, some research results show that the overall performance of LDPC codes is better than that of Turbo codes. For videos with intense motion, the LDPC scheme has better anti-bit error rate performance. In distributed video coding, the accuracy of the correlation noise model between the original WZ frame and the corresponding side information has a great influence on the coding efficiency. The more accurate the correlation noise model is, the less check digits are required for successful decoding of LDPC codes. On the one hand, The code rate is reduced, and the compression efficiency is improved; on the other hand, the calculation amount of LDPC code decoding is reduced. Therefore, accurate modeling of correlated noise at the decoder is a key technology in distributed video coding.

由于子带级的拉普拉斯分布模型在计算复杂度和精确度上具有良好的折中得到了广泛认可,现今的DVC系统大多采用拉普拉斯分布来描述原始WZ帧和边信息之间的噪声关系,近年来对相关噪声模型的研究主要在于如何获得更精确的拉普拉斯参数。但DVC系统中的DCT残差系数统计分布并不完全符合拉普拉斯分布这个假设,而是具有更尖的峰值特性和更长的尾部,为适应残差系数的这两个特性,本文提出基于K-Medoids聚类的拉普拉斯-柯西混合相关噪声模型的建模方法。该混合模型利用K-Medoids将子带残差分为大残差系数和小残差系数,对小残差系数的分布使用拉普拉斯模型来描述,对大残差系数的分布使用柯西分布来描述,增加了模型的精度,从而提高了系统的率失真性能。Since the sub-band-level Laplacian distribution model has a good trade-off in computational complexity and accuracy, it has been widely recognized. Most of today's DVC systems use Laplacian distribution to describe the relationship between the original WZ frame and side information. In recent years, the research on the correlation noise model mainly focuses on how to obtain more accurate Laplacian parameters. However, the statistical distribution of DCT residual coefficients in the DVC system does not fully conform to the assumption of Laplace distribution, but has sharper peak characteristics and longer tails. In order to adapt to these two characteristics of residual coefficients, this paper proposes A Laplacian-Cauchy Mixed Correlated Noise Modeling Method Based on K-Medoids Clustering. The hybrid model uses K-Medoids to divide the sub-band residuals into large residual coefficients and small residual coefficients. The distribution of small residual coefficients is described by the Laplace model, and the distribution of large residual coefficients is described by Cauchy distribution. to describe, increasing the accuracy of the model and thus improving the rate-distortion performance of the system.

发明内容Contents of the invention

技术问题:针对变换域分布式视频编码中原始Wyner-Ziv(WZ)帧与相应边信息的残差系数存在大残差和小残差系数统计分布与传统的拉普拉斯分布存在一定偏差的问题。为了减少这种差异,提出一种基于K-Mediods的混合分布相关噪声模型及其参数估计算法。该混合模型利用改进的拉普拉斯分布描述小残差系数的分布,采用柯西分布描述大残差系数。本文提出的混合模型建模方法能较精确地描述WZ帧和边信息间的残差系数分布,从而有效地改善了变换域分布式视频编码的率失真性能,并减少系统解码端计算复杂度。Technical problem: For the residual coefficients of the original Wyner-Ziv (WZ) frame and the corresponding side information in the transform domain distributed video coding, there are large residuals and small residual coefficients. The statistical distribution of the residual coefficients has a certain deviation from the traditional Laplace distribution. question. In order to reduce this difference, a K-Mediods-based mixed distribution correlated noise model and its parameter estimation algorithm are proposed. The mixed model uses the improved Laplace distribution to describe the distribution of the small residual coefficients, and uses the Cauchy distribution to describe the large residual coefficients. The hybrid model modeling method proposed in this paper can more accurately describe the distribution of residual coefficients between WZ frames and side information, thereby effectively improving the rate-distortion performance of distributed video coding in the transform domain and reducing the computational complexity of the system decoding end.

技术方案:Technical solutions:

1.一种分布式视频编码中相关噪声模型建模方法,其特征在于,该方法包含以下步骤:1. a correlation noise model modeling method in distributed video coding, it is characterized in that, the method comprises the following steps:

1)对于当前解码子带bk,每个系数和它与该子带残差均方的距离的绝对值组成一个2维特征向量,即子带bk中第n个残差特征向量表示成其中 D b k ( μ , v ) = C R XY b x ( μ , v ) - E ( C R XY b k ) ; 1) For the current decoding sub-band b k , each coefficient and the absolute value of its distance from the sub-band residual mean square form a 2-dimensional feature vector, that is, the nth residual feature vector in sub-band b k is expressed as in D. b k ( μ , v ) = C R X Y b x ( μ , v ) - E. ( C R X Y b k ) ;

2)利用K-Medoids聚类算法将残差特征向量分成大残差类与小残差类;2) Use the K-Medoids clustering algorithm to divide the residual feature vector into a large residual class and a small residual class;

3)使用改进的拉普拉斯分布描述小残差类,使用柯西分布描述大残差类。分别计算相应的分布参数,最终得到混合分布式相关噪声模型;3) Use the improved Laplace distribution to describe the small residual class, and use the Cauchy distribution to describe the large residual class. Calculate the corresponding distribution parameters respectively, and finally get the mixed distributed correlated noise model;

在步骤2)中,按照如下步骤进行K-Medoids聚类:In step 2), perform K-Medoids clustering according to the following steps:

1)初始化聚类中心:选择开始的三个残差特征矢量作为初始聚类中心 对应的类为S1 (k),S2 (k),S3 (k),令k=0;1) Initialize the clustering center: select the first three residual feature vectors as the initial clustering center The corresponding classes are S 1 (k) , S 2 (k) , S 3 (k) , let k=0;

2)样本聚类:将待分类的特征向量集逐个按最小距离原则划分给三类中的某一类,即:如果 d ij ( k ) = min j [ d ij ( k ) ] , ( i = 1,2 , . . . , N ) , j = ( 1,2,3 ) , 式中表示和类的中心的距离,上角标k表示迭代次数,这里的距离选择欧氏距离,于是产生新聚类 2) Sample clustering: the feature vector set to be classified One by one according to the principle of the minimum distance into one of the three categories, that is: if d ij ( k ) = min j [ d ij ( k ) ] , ( i = 1,2 , . . . , N ) , j = ( 1,2,3 ) , but In the formula express and class center of The superscript k indicates the number of iterations, and the distance here is Euclidean distance, so a new cluster is generated

3)重新计算聚类中心:与K-Means不同,K-Means选择当前cluster中所有数据点的平均值为新的中心点,而在K-Medoids中,将从当前cluster中选取一个到其他所有(当前cluster中的)点的距离之和最小的点作为中心点;3) Recalculate the cluster center: Unlike K-Means, K-Means selects the average of all data points in the current cluster as the new center point, while in K-Medoids, one will be selected from the current cluster to all other (in the current cluster) the point with the smallest sum of distances as the center point;

4)判断终止条件:如果(j=1,2,3),则结束,得到3个聚类,DCT残差系数被分为三个集合S1,S2,S3,否则,k=k+1,转至2)。4) Determine the termination condition: if (j=1,2,3), then end, get 3 clusters, DCT residual coefficients are divided into three sets S 1 , S 2 , S 3 , otherwise, k=k+1, go to 2) .

在所述步骤3)中,计算拉普拉斯分布的参数以及柯西分布的参数的具体流程为:In said step 3), the specific process for calculating the parameters of the Laplace distribution and the parameters of the Cauchy distribution is:

聚类之后,计算三个残差系数集合Sj(j=1,2,3)各自的方差,然后按从小到大的顺序,将其对应的残差系数集合分别记为S1,S2,S3,其中S1记为小系数集,而S2,S3则记为大系数集,S1基本关于0对称,为了计算柯西分布的参数的方便,对S1进行修正,记S1的上界和下界的绝对值的最小值为TL,之后将用柯西分布来描述大残差系数集,而用拉普拉斯分布描述小残差系数集;After clustering, calculate the respective variances of the three residual coefficient sets S j (j=1,2,3), and then record the corresponding residual coefficient sets as S 1 and S 2 respectively in ascending order , S 3 , where S 1 is recorded as a small coefficient set, while S 2 and S 3 are recorded as a large coefficient set, and S 1 is basically symmetrical about 0. In order to facilitate the calculation of the parameters of the Cauchy distribution, S 1 is modified and recorded as The minimum value of the absolute value of the upper and lower bounds of S 1 is TL, and then the Cauchy distribution will be used to describe the large residual coefficient set, and the Laplace distribution will be used to describe the small residual coefficient set;

柯西分布可以表示为:The Cauchy distribution can be expressed as:

pp (( xx )) == 11 ππ λλ λλ 22 ++ (( xx -- μμ )) 22

其中λ是形状参数,μ是位置参数,因为视频压缩编码中残差系数基本关于0对称,所以令μ=0。为了保持最后由拉普拉斯分布和柯西分布组合表示的概率密度还能满足那么对于柯西分布,得找到一个λ使得其概率密度在[-TL,TL]区间内的积分值等于拉普拉斯的概率密度在[-TL,TL]区间内的积分值,并且仍然能维持它的重尾特性。这样就能推导出λ。Wherein λ is a shape parameter, μ is a position parameter, because the residual coefficient in video compression coding is basically symmetrical about 0, so μ=0. In order to maintain the final probability density represented by the combination of Laplace distribution and Cauchy distribution can also satisfy Then for the Cauchy distribution, it is necessary to find a λ such that the integral value of its probability density in the [-TL, TL] interval is equal to the integral value of Laplace’s probability density in the [-TL, TL] interval, and still can maintain its heavy-tailed nature. In this way, λ can be derived.

令拉普拉斯概率密度在[-TL,TL]内的积分值为PL(TL),它可以按下式计算:Let the integral value of the Laplace probability density in [-TL,TL] be P L (TL), it can be calculated as follows:

PP LL (( TLTL )) == PP (( TLTL ≤≤ xx ≤≤ TLTL )) == ∫∫ -- TLTL TLTL αα bb kk 22 expexp (( -- αα bb kk || xx || )) dxdx == CC

其中 α b k = 2 / σ b k 2 , σ b k 2 = E ( | C R XY b k | 2 ) - E ( | C R XY b k | ) 2 计算。in according to α b k = 2 / σ b k 2 , σ b k 2 = E. ( | C R X Y b k | 2 ) - E. ( | C R X Y b k | ) 2 calculate.

令PC(LH)表示柯西概率密度在[-TL,TL]内的积分值,按下式计算:Let P C (LH) represent the integral value of the Cauchy probability density in [-TL,TL], and it can be calculated according to the following formula:

PP CC (( TLTL )) == PP (( -- TLTL ≤≤ xx ≤≤ TLTL )) == ∫∫ -- TLTL TLTL 11 ππ λλ λλ 22 ++ xx 22 dxdx == 22 ππ tanthe tan -- 11 (( TLTL λλ )) == PP LL (( TLTL )) == CC

这样就能得到: λ = TL tan ( πC / 2 ) . This gives: λ = TL the tan ( πC / 2 ) .

利用下式计算属于S1残差系数集合的拉普拉斯参数:The Laplace parameter belonging to the set of S 1 residual coefficients is calculated using the following formula:

αα 11 == 22 σσ 11 22

是S1残差系数集合的方差。 is the variance of the set of S 1 residual coefficients.

最终可以这样来表示相关噪声模型:Finally, the correlated noise model can be represented as follows:

pp (( CC RR XYX Y bb kk (( μμ ,, υυ )) )) == αα 00 22 expexp (( -- αα 00 || CC RR XYX Y bb kk (( μμ ,, υυ )) || )) ,, CC RR XYX Y bb kk (( μμ ,, υυ )) ∈∈ SS 11 11 ππ λλ λλ 22 ++ [[ CC RR XYX Y bb kk (( μμ ,, υυ )) ]] 22 ,, CC RR XYX Y bb kk (( μμ ,, υυ )) ∈∈ SS 22 ,, SS 33

有益效果:本发明与现有技术相比,具有以下优点:Beneficial effect: compared with the prior art, the present invention has the following advantages:

a)本发明方案提出了一种混合相关噪声模型建模方法,在该方法中,采用K-Medoids聚类算法来提高分类的准确性与鲁棒性。使用拉普拉斯分布描述小残差的分布,使用柯西分布描述大残差的分布。提高了相关噪声模型的准确性与自适应性能。a) The solution of the present invention proposes a mixed correlation noise model modeling method, in which the K-Medoids clustering algorithm is used to improve the accuracy and robustness of classification. Use the Laplace distribution to describe the distribution of small residuals, and the Cauchy distribution to describe the distribution of large residuals. Improved accuracy and adaptive performance of correlated noise models.

b)本文方法通过在解码端的改进,有效提高了DVC系统的率失真性能。b) The method in this paper effectively improves the rate-distortion performance of the DVC system by improving the decoder.

附图说明Description of drawings

图1是现有的基于变换域的分布式视频编码框架图。FIG. 1 is a frame diagram of an existing distributed video coding based on a transform domain.

图2是本发明改进的视频编码框架图。Fig. 2 is a frame diagram of the improved video coding of the present invention.

图3是本发明的混合相关噪声模型建模方法流程图。Fig. 3 is a flow chart of the mixed correlation noise model modeling method of the present invention.

具体实施方式Detailed ways

下面结合附图与具体实施方式对本发明作进一步详细描述。The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

图1是现有的基于变换域的分布式视频编码框架图,本发明提出了一种分布式视频编码中建立相关噪声模型及估计模型参数的方法,该混合模型首先利用K-Mediods将残差系数分为小残差和大残差,利用改进的拉普拉斯分布描述小残差系数的分布,采用柯西分布描述大残差系数。该文提出的混合模型(Hybrid Distribution CorrelationNoise Model,HDCNM)能较精确地描述WZ帧和边信息间的残差系数分布,从而有效地改善了变换域分布式视频编码的率失真性能,并减少系统解码端计算复杂度。改进后的视频编码框架如图2所示。Fig. 1 is the frame diagram of the existing distributed video coding based on the transform domain. The present invention proposes a method for establishing a correlated noise model and estimating model parameters in distributed video coding. The hybrid model first utilizes K-Mediods to convert the residual The coefficients are divided into small residuals and large residuals. The improved Laplace distribution is used to describe the distribution of the small residual coefficients, and the Cauchy distribution is used to describe the large residual coefficients. The Hybrid Distribution Correlation Noise Model (HDCNM) proposed in this paper can more accurately describe the distribution of residual coefficients between WZ frames and side information, thereby effectively improving the rate-distortion performance of distributed video coding in the transform domain and reducing the system Computational complexity of the decoder. The improved video coding framework is shown in Figure 2.

下面给出本发明方法的具体实施例:Provide the specific embodiment of the inventive method below:

1)对于当前解码子带bk,每个系数和它与该子带残差均方的距离的绝对值组成一个2维特征向量,即子带bk中第n个残差特征向量表示成其中 D b k ( μ , v ) = C R XY b x ( μ , v ) - E ( C R XY b k ) ; 1) For the current decoding sub-band b k , each coefficient and the absolute value of its distance from the sub-band residual mean square form a 2-dimensional feature vector, that is, the nth residual feature vector in sub-band b k is expressed as in D. b k ( μ , v ) = C R X Y b x ( μ , v ) - E. ( C R X Y b k ) ;

2)利用K-Medoids聚类算法将残差特征向量分成大残差类与小残差类2) Use the K-Medoids clustering algorithm to divide the residual feature vector into large residual class and small residual class

3)使用改进的拉普拉斯分布描述小残差类,使用柯西分布描述大残差类。分别计算相应的分布参数,最终得到混合分布式相关噪声模型。3) Use the improved Laplace distribution to describe the small residual class, and use the Cauchy distribution to describe the large residual class. The corresponding distribution parameters are calculated respectively, and finally a mixed distributed correlated noise model is obtained.

在步骤2)中,按照如下步骤进行K-Medoids聚类:In step 2), perform K-Medoids clustering according to the following steps:

1)初始化聚类中心:选择开始的三个残差特征矢量作为初始聚类中心 对应的类为S1 (k),S2 (k),S3 (k),令k=0;1) Initialize the clustering center: select the first three residual feature vectors as the initial clustering center The corresponding classes are S 1 (k) , S 2 (k) , S 3 (k) , let k=0;

2)样本聚类:将待分类的特征向量集逐个按最小距离原则划分给三类中的某一类,即:如果 d ij ( k ) = min j [ d ij ( k ) ] , ( i = 1,2 , . . . , N ) , j = ( 1,2,3 ) , 式中表示和类的中心的距离,上角标k表示迭代次数,这里的距离选择欧氏距离,于是产生新聚类 2) Sample clustering: the feature vector set to be classified One by one according to the principle of the minimum distance into one of the three categories, that is: if d ij ( k ) = min j [ d ij ( k ) ] , ( i = 1,2 , . . . , N ) , j = ( 1,2,3 ) , but In the formula express and class center of The superscript k indicates the number of iterations, and the distance here is Euclidean distance, so a new cluster is generated

3)重新计算聚类中心:与K-Means不同,K-Means选择当前cluster中所有数据点的平均值为新的中心点,而在K-Medoids中,将从当前cluster中选取一个到其他所有(当前cluster中的)点的距离之和最小的点作为中心点;3) Recalculate the cluster center: Unlike K-Means, K-Means selects the average of all data points in the current cluster as the new center point, while in K-Medoids, one will be selected from the current cluster to all other (in the current cluster) the point with the smallest sum of distances as the center point;

4)判断终止条件:如果(j=1,2,3),则结束,得到3个聚类,DCT残差系数被分为三个集合S1,S2,S3,否则,k=k+1,转至2)。4) Determine the termination condition: if (j=1,2,3), then end, get 3 clusters, DCT residual coefficients are divided into three sets S 1 , S 2 , S 3 , otherwise, k=k+1, go to 2) .

在所述步骤3)中,计算拉普拉斯分布的参数以及柯西分布的参数的具体流程为:In said step 3), the specific process for calculating the parameters of the Laplace distribution and the parameters of the Cauchy distribution is:

聚类之后,计算三个残差系数集合Sj(j=1,2,3)各自的方差,然后按从小到大的顺序,将其对应的残差系数集合分别记为S1,S2,S3,其中S1记为小系数集,而S2,S3则记为大系数集,S1基本关于0对称,为了计算柯西分布的参数的方便,对S1进行修正,记S1的上界和下界的绝对值的最小值为TL,之后将用柯西分布来描述大残差系数集,而用拉普拉斯分布描述小残差系数集;After clustering, calculate the respective variances of the three residual coefficient sets S j (j=1,2,3), and then record the corresponding residual coefficient sets as S 1 and S 2 respectively in ascending order , S 3 , where S 1 is recorded as a small coefficient set, while S 2 and S 3 are recorded as a large coefficient set, and S 1 is basically symmetrical about 0. In order to facilitate the calculation of the parameters of the Cauchy distribution, S 1 is modified and recorded as The minimum value of the absolute value of the upper and lower bounds of S 1 is TL, and then the Cauchy distribution will be used to describe the large residual coefficient set, and the Laplace distribution will be used to describe the small residual coefficient set;

柯西分布可以表示为:The Cauchy distribution can be expressed as:

pp (( xx )) == 11 ππ λλ λλ 22 ++ (( xx -- μμ )) 22

其中λ是形状参数,μ是位置参数,因为视频压缩编码中残差系数基本关于0对称,所以令μ=0。为了保持最后由拉普拉斯分布和柯西分布组合表示的概率密度还能满足那么对于柯西分布,得找到一个λ使得其概率密度在[-TL,TL]区间内的积分值等于拉普拉斯的概率密度在[-TL,TL]区间内的积分值,并且仍然能维持它的重尾特性。这样就能推导出λ。Wherein λ is a shape parameter, μ is a position parameter, because the residual coefficient in video compression coding is basically symmetrical about 0, so μ=0. In order to maintain the final probability density represented by the combination of Laplace distribution and Cauchy distribution can also satisfy Then for the Cauchy distribution, it is necessary to find a λ such that the integral value of its probability density in the [-TL, TL] interval is equal to the integral value of Laplace’s probability density in the [-TL, TL] interval, and still can maintain its heavy-tailed nature. In this way, λ can be derived.

令拉普拉斯概率密度在[-TL,TL]内的积分值为PL(TL),它可以按下式计算:Let the integral value of the Laplace probability density in [-TL,TL] be P L (TL), it can be calculated as follows:

PP LL (( TLTL )) == PP (( TLTL ≤≤ xx ≤≤ TLTL )) == ∫∫ -- TLTL TLTL αα bb kk 22 expexp (( -- αα bb kk || xx || )) dxdx == CC

其中 α b k = 2 / σ b k 2 , σ b k 2 = E ( | C R XY b k | 2 ) - E ( | C R XY b k | ) 2 计算。in according to α b k = 2 / σ b k 2 , σ b k 2 = E. ( | C R X Y b k | 2 ) - E. ( | C R X Y b k | ) 2 calculate.

令PC(LH)表示柯西概率密度在[-TL,TL]内的积分值,按下式计算:Let P C (LH) represent the integral value of the Cauchy probability density in [-TL,TL], and it can be calculated according to the following formula:

PP CC (( TLTL )) == PP (( -- TLTL ≤≤ xx ≤≤ TLTL )) == ∫∫ -- TLTL TLTL 11 ππ λλ λλ 22 ++ xx 22 dxdx == 22 ππ tanthe tan -- 11 (( TLTL λλ )) == PP LL (( TLTL )) == CC

这样就能得到: λ = TL tan ( πC / 2 ) . This gives: λ = TL the tan ( πC / 2 ) .

利用下式计算属于S1残差系数集合的拉普拉斯参数:The Laplace parameter belonging to the set of S 1 residual coefficients is calculated using the following formula:

αα 11 == 22 σσ 11 22

是S1残差系数集合的方差。 is the variance of the set of S 1 residual coefficients.

最终可以这样来表示相关噪声模型:Finally, the correlated noise model can be represented as follows:

pp (( CC RR XYX Y bb kk (( μμ ,, υυ )) )) == αα 00 22 expexp (( -- αα 00 || CC RR XYX Y bb kk (( μμ ,, υυ )) || )) ,, CC RR XYX Y bb kk (( μμ ,, υυ )) ∈∈ SS 11 11 ππ λλ λλ 22 ++ [[ CC RR XYX Y bb kk (( μμ ,, υυ )) ]] 22 ,, CC RR XYX Y bb kk (( μμ ,, υυ )) ∈∈ SS 22 ,, SS 33

Claims (3)

1. a correlated noise model modelling approach in distributed video coding, it is characterized in that, the method includes the steps of:
1) for current decoded sub-band b k, the absolute value of the distance of each coefficient and it and this subband residual mean square (RMS) forms 2 dimensional feature vectors, i.e. subband b kin the n-th residual error characteristic vector be expressed as wherein D b k ( μ , v ) = C R XY b k ( μ , v ) - E ( C R XY b k ) ;
2) K-Medoids clustering algorithm is utilized residual error characteristic vector to be divided into large residual error class and little residual error class;
3) use the laplacian distribution improved to describe little residual error class, use Cauchy to distribute and describe large residual error class; Calculate corresponding distributed constant respectively, finally obtain mixed distribution formula correlated noise model.
2. bit rate control method in a kind of distributed video coding according to claim 1, is characterized in that, described step 2) in, carry out K-Medoids cluster in accordance with the following steps:
1) initialization cluster centre: select three the residual error characteristic vectors started as initial cluster center corresponding class is make k=0;
2) sample clustering: by set of eigenvectors to be sorted the a certain class in three classes is allocated to one by one, if that is: by minimal distance principle (i=1,2 ..., N), j=(1,2,3), then in formula represent and class center distance, superscript k represents iterations, and distance here selects Euclidean distance, so produce new cluster
3) cluster centre is recalculated: different from K-Means, K-Means selects the mean value of all data points in current cluster to be new central point, and in K-Medoids, the minimum point of the distance sum of (in current cluster) point to other are all will be chosen as central point from current cluster;
4) end condition is judged: if (j=1,2,3), then terminate, and obtains 3 clusters, and DCT residual error coefficient is divided into three S set 1, S 2, S 3, otherwise k=k+1, goes to 2).
3. in a kind of distributed video coding according to claim 1 and 2, side information is improved one's methods, and it is characterized in that, step 3) in, the idiographic flow calculating the parameter of laplacian distribution and the parameter of Cauchy's distribution is:
After cluster, calculate three residual error coefficient S set jthe variance that (j=1,2,3) are respective, then by order from small to large, is designated as S respectively by the residual error coefficient set of its correspondence 1, S 2, S 3, wherein S 1be designated as little coefficient set, and S 2, S 3then be designated as large coefficient set, S 1substantially symmetrical about 0, in order to calculate the convenience of the parameter of Cauchy's distribution, to S 1revise, note S 1the upper bound and the minimum value of absolute value of lower bound be TL, large residual error coefficient collection will be described with Cauchy's distribution afterwards, and describe little residual error coefficient collection by laplacian distribution;
Cauchy's distribution can be expressed as:
p ( x ) = 1 π λ λ 2 + ( x - μ ) 2
Wherein λ is form parameter, and μ is location parameter, because in video compression coding, residual error coefficient is substantially symmetrical about 0, so make μ=0; Can also meet to keep the probability density finally represented by laplacian distribution and Cauchy's distributed combination so for Cauchy's distribution, a λ must be found to make the integrated value of its probability density in [-TL, TL] interval equal the integrated value of probability density in [-TL, TL] interval of Laplce, and still can maintain its heavy-tailed property; So just λ can be derived;
The integrated value of Laplacian probability density in [-TL, TL] is made to be P l(TL), it can be calculated as follows:
P L ( TL ) = P ( - TL ≤ x ≤ TL ) = ∫ - TL TL α b k 2 exp ( - α b k | x | ) dx = C
Wherein press α b k = 2 / σ b k 2 , σ b k 2 = E ( | C R XY b k | 2 ) - E ( | C R XY b k | ) 2 Calculate;
Make P c(LH) represent the integrated value of Cauchy probability density in [-TL, TL], be calculated as follows:
P C ( TL ) = P ( - TL ≤ x ≤ TL ) = ∫ - TL TL 1 π λ λ 2 + x 2 dx = 2 π tan - 1 ( TL λ ) = P L ( TL ) = C
So just can obtain: λ = TL tan ( πC / 2 ) ;
Utilize following formula to calculate and belong to S 1the Laplacian parameter of residual error coefficient set:
α 1 = 2 σ 1 2
s 1the variance of residual error coefficient set.
Final expression correlated noise model:
p ( C R XY b k ( μ , υ ) ) = α 0 2 exp ( - α 0 | C R XY b k ( μ , υ ) | ) , C R XY b k ( μ , υ ) ∈ S 1 1 π λ λ 2 + [ C R XY b k ( μ , υ ) ] 2 , C R XY b k ( μ , υ ) ∈ S 2 , S 3
CN201510086215.4A 2015-02-17 2015-02-17 Bit rate control method in a kind of distributed video coding Active CN104702961B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510086215.4A CN104702961B (en) 2015-02-17 2015-02-17 Bit rate control method in a kind of distributed video coding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510086215.4A CN104702961B (en) 2015-02-17 2015-02-17 Bit rate control method in a kind of distributed video coding

Publications (2)

Publication Number Publication Date
CN104702961A true CN104702961A (en) 2015-06-10
CN104702961B CN104702961B (en) 2018-06-01

Family

ID=53349672

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510086215.4A Active CN104702961B (en) 2015-02-17 2015-02-17 Bit rate control method in a kind of distributed video coding

Country Status (1)

Country Link
CN (1) CN104702961B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105227954A (en) * 2015-09-30 2016-01-06 南京邮电大学 Exponent number self-adapting regulation method is quantized in distributed video coding
CN107071447A (en) * 2017-04-06 2017-08-18 华南理工大学 A kind of correlated noise modeling method based on two secondary side information in DVC
CN108353193A (en) * 2015-08-19 2018-07-31 Lg 电子株式会社 Based on it is multiple based on the model of figure by using the method and apparatus of transformation encoding/decoding video signal
CN109934183A (en) * 2019-03-18 2019-06-25 北京市商汤科技开发有限公司 Image processing method and device, detection device and storage medium
CN110234011A (en) * 2019-04-19 2019-09-13 网宿科技股份有限公司 A kind of video-frequency compression method and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102724495A (en) * 2012-05-04 2012-10-10 西安电子科技大学 Wyner-Ziv frame quantification method based on rate distortion
CN103561269A (en) * 2013-08-14 2014-02-05 广西大学 Distributed video coding correlated noise model construction method based on multi-probability distribution

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102724495A (en) * 2012-05-04 2012-10-10 西安电子科技大学 Wyner-Ziv frame quantification method based on rate distortion
CN103561269A (en) * 2013-08-14 2014-02-05 广西大学 Distributed video coding correlated noise model construction method based on multi-probability distribution

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
VAN LUONG H ET AL.: "Side information and noise learning for distributed video coding", 《IEEE TRANSACTIONS ON IMAGE PROCESSING》 *
杨春玲: "分布式视频编码中拉普拉斯_柯西混合分布相关噪声模型研究", 《电子与信息学报》 *
谢小兰: "DCT域分布式视频编码中相关噪声模型研究", 《中国优秀硕士学位论文全文数据库信息科技辑,2014年第01期》 *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108353193A (en) * 2015-08-19 2018-07-31 Lg 电子株式会社 Based on it is multiple based on the model of figure by using the method and apparatus of transformation encoding/decoding video signal
CN108353193B (en) * 2015-08-19 2022-07-15 Lg 电子株式会社 Method and apparatus for processing video data based on multiple graph-based models
US11394972B2 (en) 2015-08-19 2022-07-19 Lg Electronics Inc. Method and device for encoding/decoding video signal by using optimized conversion based on multiple graph-based model
US12088804B2 (en) 2015-08-19 2024-09-10 Lg Electronics Inc. Method and device for encoding/decoding video signal by using optimized conversion based on multiple graph-based model
CN105227954A (en) * 2015-09-30 2016-01-06 南京邮电大学 Exponent number self-adapting regulation method is quantized in distributed video coding
CN107071447A (en) * 2017-04-06 2017-08-18 华南理工大学 A kind of correlated noise modeling method based on two secondary side information in DVC
CN107071447B (en) * 2017-04-06 2020-06-19 华南理工大学 Correlated noise modeling method based on secondary side information in DVC
CN109934183A (en) * 2019-03-18 2019-06-25 北京市商汤科技开发有限公司 Image processing method and device, detection device and storage medium
CN110234011A (en) * 2019-04-19 2019-09-13 网宿科技股份有限公司 A kind of video-frequency compression method and system
CN110234011B (en) * 2019-04-19 2021-09-24 网宿科技股份有限公司 Video compression method and system

Also Published As

Publication number Publication date
CN104702961B (en) 2018-06-01

Similar Documents

Publication Publication Date Title
CN111641832B (en) Encoding method, decoding method, device, electronic device and storage medium
CN104702961B (en) Bit rate control method in a kind of distributed video coding
CN113766229B (en) Encoding method, decoding method, device, equipment and readable storage medium
CN113613010A (en) Point cloud geometric lossless compression method based on sparse convolutional neural network
KR20120036834A (en) Method for encoding/decoding a 3d mesh model that comprises one or more components
CN112702600B (en) Image coding and decoding neural network layered fixed-point method
CN113347422B (en) Coarse-grained context entropy coding method
CN104199627B (en) Gradable video encoding system based on multiple dimensioned online dictionary learning
CN108093264B (en) Core image compression, decompressing method and system based on splits' positions perception
CN111316326A (en) Image encoding method, apparatus and computer-readable storage medium
CN104244009B (en) Bit rate control method in a kind of distributed video coding
CN104853215A (en) Video steganography method based on motion vector local optimality preservation
CN116961672A (en) Lossless data compression method based on transducer encoder
CN102025998B (en) Code book designing method for vector quantization of digital image signal
CN105915916A (en) Video steganalysis method based on motion vector rate-distortion performance estimation
CN114359291A (en) A method for training an instance segmentation model and an instance segmentation method
CN101511020B (en) Image compression method based on sparseness decompose
US20120215525A1 (en) Method and apparatus for mixed dimensionality encoding and decoding
JP2017158183A (en) Image processing device
CN109286817B (en) A Quantization Distortion Information Processing Method of DCT Coefficients in Video Coding
Hou et al. Learning-based Intra-Prediction For Point Cloud Attribute Transform Coding
CN107071447B (en) Correlated noise modeling method based on secondary side information in DVC
CN105306946A (en) Quality scalable video coding method based on mean square error threshold
CN116029345A (en) Intermediate layer feature compression transmission method, compressed data decoding method and device
Bayazit et al. 3-D mesh geometry compression with set partitioning in the spectral domain

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant