登录
首页 » Matlab » 无搜索四叉树分形编码

无搜索四叉树分形编码

于 2023-08-04 发布 文件大小:3.23 kB
0 30
下载积分: 2 下载次数: 1

代码说明:

无搜索四叉树分形编码算法。本算法根据一个日本人04年的一篇论文编写。算法可以自动识别图像的高频、低频区域,自适应的采取不同大小的数据块进行分形编码。缺点:由于没有进行详尽严格的调试,导致没有达到论文所说的很高的编码速度,但是基本思路正确,如果有需要做参考的朋友可以下载看看。

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

发表评论

0 个回复

  • bp.pso
    说明:  标准BP神经网络算法程序:动量BP算法程序:% 调用 TRAINGDX 算法训练 BP 网络 粒子群优化神经网络源程序(The standard BP neural network algorithm procedure: momentum BP algorithm procedure: TRAINGDX called BP network training algorithm particle swarm optimization neural network source code)
    2020-11-12 19:59:43下载
    积分:1
  • plotR
    MATLAB,传输矩阵法,仿真相移光纤光栅反射谱,可以随意改变相移位置和相移大小(MATLAB,Phase-shifted fiber grating)
    2011-08-11 17:09:15下载
    积分:1
  • FCM
    fcm 及快速fcm实现图像分割,还带有GUI界面(fcm fcm and fast image segmentation, but also with GUI interface)
    2014-02-27 19:14:57下载
    积分:1
  • Image_processing_matlab
    上课时做的matlab图像处理实验,包括卷积,拉普拉斯变换,罗伯特算子,种子算法,等等(Matlab class to do the image processing experiments, including convolution, Laplace transform, Robert operator, seed algorithm, and so on)
    2009-03-31 16:25:34下载
    积分:1
  • EKFUKFMatlabtoolbox
    现代信号处理中的扩展卡尔曼滤波和无迹卡尔曼滤波的介绍,以及matlab的实现方法。(EKF UKF)
    2010-11-24 20:33:33下载
    积分:1
  • refbook
    MATLAB commands by functional area
    2011-04-13 21:57:12下载
    积分:1
  • lte3
    lte code fore simulation with matlab
    2013-08-24 20:44:01下载
    积分:1
  • spwm
    说明:  用proteus仿真实现逆变器,基本实现闭环控制,单片机是ATMEGA88。(The inverters are simulated by proteus, and the closed-loop control is basically realized. The single chip computer is ATMEGA88.)
    2019-07-10 15:16:08下载
    积分:1
  • 遗传算法求解多旅行商问题
    说明:  旅行商问题(TravelingSalesmanProblem,TSP)是一个经典的组合优化问题。经典的TSP可以描述为:一个商品推销员要去若干个城市推销商品,该推销员从一个城市出发,需要经过所有城市后,回到出发地。应如何选择行进路线,以使总的行程最短。从图论的角度来看,该问题实质是在一个带权完全无向图中,找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列,随着顶点数的增加,会产生组合爆炸,它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
    2020-06-17 11:00:02下载
    积分:1
  • timefreqtb-0.2
    这是时频分析技术及其应用一书中的时频工具箱,总共两个,这是第二个(This is the time-frequency analysis technology and its applications book of the time-frequency toolbox, a total of two, which is the second)
    2012-11-20 13:19:46下载
    积分:1
  • 696518资源总数
  • 104432会员总数
  • 16今日下载