-
61IC_H4231
PAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4，ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，......
ZPAV (H265) 基本算法 ：
1，图象与声音分解与合成 ：小波 ；
2，图象与声音前处理 ：小波子带零交叉降噪，目标纹理处理，语音处理 ；
3，速率控制 ：小波子带熵速率控制 ；
4，量化与反量化 ：小波子带熵量化与反量化 ；
5，低频分量和高频分量的降维 ：小波子带邻域交叉降维 ；
6，运动矢量和量化表的分解与合成 ：广义小波 ；
7，位面编码 ：数学形态小波，多级树集合群，嵌入零树，位面降维 ；
8，位流编码 ：算术编码，熵编码 ；
9，运动估计 ：宏块最优决策，运动矢量预测 ；
A，运动搜索 ：钻石，大钻石，小钻石，方形 ；
B，图象与声音后处理 ：低通滤波，断点重构，宏块平滑 ；
C，误码纠错 ：矢量仿真，帧间仿真 。
(The PAV (H265) is the audio and video compression and decompression protocol, is very different from H264/MPEG4
ZPAV (H265) algorithm is a wavelet, multi-level tree collection group, and generalized wavelets, mathematical morphology, wavelet, ...
ZPAV (H265) algorithm:
1, image and sound decomposition and synthesis: wavelet
2, image and sound processing: wavelet sub-band zero-crossing noise, target texture processing, speech processing
3, the rate control: wavelet subband entropy rate control
4, quantization and inverse quantization: Wavelet subband entropy quantization and inverse quantization
5, the dimensionality reduction of the low frequency component and high frequency components: the wavelet subbands neighborhood cross-dimensionality reduction
6, the decomposition and synthesis of the motion vector and quantization tables: generalized wavelet
7, bit-plane coding: the mathematical form of wavelet multi-level tree collection group, embedded zerotree, bit plane)
- 2012-03-07 16:22:55下载
- 积分：1
-
bnpts点云文件bunny
bnpts点云文件 进过压缩处理 大约100000个点(bnpts)
- 2010-11-01 10:57:16下载
- 积分：1
-
w_ipp-sample-data
w_ipp-sample-data-compression，Intel，IPP函数库，文件数据快速压缩解压缩工具包。可以进行数据加密解密告诉处理( W_ipp-sample-data-compression, Intel, IPP library, file compression and decompression tool for fast data packet. You can tell the encryption and decryption of data processing)
- 2011-10-07 19:43:38下载
- 积分：1
-
gwbssrari
这里给出的源代码huffman.zip用8种不同的方式实现了Huffman编码算法。这些代码意在演示不同Huffman算法的实现原理，比较算法执行效率的差别，但并没有针对实际应用环境的需求，做更多的空空空间或效率优化。全部代码以C++语言开发，为了更容易地实现各种数据结构，代码中大量应用了标准C++库与模板技术。——总之，这些代码的作用在于示例与演示；如果大家想把这些代码应用在实际应用中，可能还需要
(The given here source code huffman.zip eight different ways to achieve the Huffman coding algorithm. These codes are intended to demonstrate different Huffman algorithm implementation principle, the difference of the algorithm execution efficiency, but does not demand for practical application environment, do more empty space or efficiency optimization. The entire code C++ language development code in order to make it easier to achieve a variety of data structures, a large number of applications the standard C++ library template.- In short, these code examples and demonstration If we want the code used in practical applications may also need)
- 2012-08-23 20:05:50下载
- 积分：1
-
263yasuoyuv
263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)
- 2008-06-12 20:20:49下载
- 积分：1
-
SourceCode
赫夫曼编/译码器源码，已生成的每个字符的赫夫曼编码，对任意字符文本进行编码，再译码(Huffman encoder/decoder source code, Huffman coding, each character has been generated, the text of any character encoding, decoding)
- 2013-04-24 10:36:09下载
- 积分：1
-
ZIP
zip压缩源代码，附有整个工程，保证能用，可应用于文件压缩，内存压缩(zip compressed source code, with the whole project, and ensure that use, can be applied to file compression, memory compression)
- 2008-12-15 21:33:12下载
- 积分：1
-
7zipDll
完善后的LZMA(7ZIP)压缩DLL文件,且带有示范使用源码。(Perfect after LZMA (7ZIP) compressed DLL files, and a demonstration on the use of source code.)
- 2007-09-24 12:25:04下载
- 积分：1
-
ivsdk
非常好的视频压缩filter,可以实现mpeg2 mpeg1的视频压缩，用户可以自己选择码率(very good video compression filter can achieve mpeg1 mpeg2 video compression, Users can choose Rate)
- 2006-08-10 15:58:10下载
- 积分：1
-
FDR-COMPRESS
一种改进的方案，它针对硬故障集的特点利用指示频率连续长度码(FDR码)进行二次编码压缩。该方法充分利用测试集中无关位较多而测试模式之间变化位较少的特征，应用贪心算法对预先计算的测试集进行了重新排序，尽可能的使相邻的向量间具有最少的不同位，排列成一个最佳的差分向量序列，然后应用FDR码对差分向量序列进行编码,最后对压缩结果重新分块，按照一次压缩的流程进行二次压缩。在解压时，使用片上解压电路解压，能高效地还原出原测试集。最后通过对Soc部分标准电路硬故障集的测试结果显示，本方案具有较好的压缩率。(a new improved method was proposed in the paper,the method using Frequency-Directed Run-length(FDR codes)coding for the twice aimed at hard-fault. It fully takes advantage of the characters that there are many don’t-care bits in the test set but a few different bits between the test patterns, Then it applies the greed calculate way to sort the precomputed test sets and make the close together vector have the least different sites possibly. It uses the FDR codes to coding the vectors,then blocks the results and uses the FDR codes to compress for the second time.
Decompression used of on-chip circuit extract unpack,it will be deoxidize the original test efficient.using the hard-fault to compress and the experimental results prove that the improved coding method of this paper has the better compression ratios has been proved at last.
)
- 2009-05-12 14:32:23下载
- 积分：1
