登录
首页 » Matlab » An Improved SPIHT Algorithm Based on Wavelet Coefficient Blocks for Image Coding

An Improved SPIHT Algorithm Based on Wavelet Coefficient Blocks for Image Coding

于 2023-04-13 发布 文件大小:429.33 kB
0 58
下载积分: 2 下载次数: 1

代码说明:

一种改进的层次树集合划分方法

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • chaoticsecureimagedata
    通过细胞神经网络混沌系统对图像数据进行加密和解密 (Through the cellular neural networks for image data of chaotic systems for encryption and decryption )
    2020-07-04 14:20:01下载
    积分:1
  • vbhmm
    Ensemble Learning for Hidden Markov Models.
    2011-03-25 03:44:44下载
    积分:1
  • martin-matlab__
    spectral subtraction
    2011-11-10 13:18:54下载
    积分:1
  • 13.信源数估计MDL算法MATLAB程序
    基于MDL的信源数估计算法,直接点开文件就可以运行(Source number estimation algorithm based on MDL)
    2021-04-07 15:39:01下载
    积分:1
  • SVM_FCM
    说明:  SVM和FCM的matlab平台简单教程及实现(SVM and FCM matlab simple tutorial)
    2020-05-12 17:19:40下载
    积分:1
  • 完整可用的定功率单环控制程序
    包括广义互相关函数GCC时延估计,用于信号特征提取、信号消噪,matlab开发工具箱中的支持向量机,matlab程序运行时导入数据文件作为输入参数,MIMO OFDM matlab仿真,本程序的性能已经达到较高水平。
    2023-04-30 05:25:02下载
    积分:1
  • ECSMiner
    一种数据挖掘分类算法的MATLAB实现。(classification in matlab.)
    2013-12-21 15:30:03下载
    积分:1
  • 2
    说明:   有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。 现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。 可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入: 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数,每组有一对数字。 输出: 可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
    2015-03-22 23:35:47下载
    积分:1
  • cd
    说明:  code for image subtraction
    2014-01-27 14:07:44下载
    积分:1
  • Duffing
    说明:  Method for solving Duffing Equation via incremental Harmonic Balance method
    2019-12-10 07:36:07下载
    积分:1
  • 696518资源总数
  • 106227会员总数
  • 11今日下载