搜索资源列表
effciit
- 分形图象压缩中的固定方块分割,给大家一起分享,希望你们也不要吝啬哦-fractal image compression fixed box segmentation, to share with everyone, I hope you do not mean oh
CoalManage_51aspx
- This is not a very mean things.
xiaokongzinews2_51aspx
- This is not a very mean things
zongheshili_51aspx
- This is not a very mean things
DataGrid
- This is not a very mean things
DataList
- This is not a very mean things
DropDownList
- This is not a very mean things
2009_An_Improved_SPIHT_Algorithm_Based_on_Pixel_Do
- 基于像素域的改進的SPIHT算法:分層樹的集分割算法是一種簡單、有效的嵌入式零樹編碼算法.在算法的基礎上提出了一種基于空域的改進方法.首先將圖像的偶數裂像素減去相鄰兩奇數列的均值,形成分裂圖像.然后將分裂圖像的奇數列提取出來作為主圖像,將偶數列提取出來作為幅圖像.最后將主幅圖像以合適的權值分別進行壓縮-Pixel-based domain improved SPIHT algorithm: the set partitioning in hierarchical tree algorithm i
proje
- applied k means clustering for vector quanta and used huffman for image compression matlab code
mse.zip
- mean squre error for the new compression ratio,mean squre error for the new compression ratio
sypj
- 建立一个实测信号的样本,这里我建立四个随机信号的样本,因为方便显示,蓝色信号为有用信号(正弦信号),黑色的四个信号是随机信号分别与正弦信号叠加形成的实测信号,最后红色的信号为样本的均值信号,即为时域同步平均效果下的信号。-A sample of the measured signal, I created four random signal samples, because it' s easy to display, blue signal is useful signal (sinu
Huffman-algorithm-code
- 哈夫曼树是一种树形结构,用哈夫曼树的方法解编程题的算法就叫做哈夫曼算法。树并不是指植物,而是一种数据结构,因为其存放方式颇有点象一棵树有树叉因而称为树。 最简哈夫曼树是由德国数学家冯。哈夫曼 发现的,此树的特点就是引出的路程最短。 概念理解:1.路径 从树中一个节点到另一个节点之间的分支构成这两个节点之间的路径。2.路径长度 路径上的分支数目称作路径长度。-Huffman tree is a tree structure, Huffman tree algorithm method to sol
1.odt
- mean absolute difference between two images
mos
- mos评分,可以将最近流行的压缩感知运用到一起,对压缩还原后的语音进行评测-Mean Opinion Score
pendingcurve
- The NLMS (normalized least mean square algorithm) is used in number of signal processing and control applications. It works by adapting the finite impulse response filters co-efficient. The weight vector can be calculated easily by using NLMS the val
