登录
首页 » matlab » wave-denoise

wave-denoise

于 2014-05-25 发布 文件大小:1KB
0 324
下载积分: 1 下载次数: 49

代码说明:

  程序利用小波分解将声音信号分解为高频与低频部分,而后利用软阈值方法确定高频与低频各自的小波重构系数,将高频与低频部分重构还原信号达到降噪的目的。(Program using wavelet decomposition sound signal into high and low parts, then use soft threshold method to determine the high and low frequency coefficients of each wavelet reconstruction, reconstruction of the high and low frequency part of the purpose of noise reduction signal reaches.)

文件列表:

wave-denoise.m,2921,2014-05-25

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

发表评论

0 个回复

  • CHM
    matlab的一些应用性文章(some application articles about matlab)
    2005-02-04 16:20:49下载
    积分:1
  • high-frequency-
    高频段超方向性天线阵列设计 (Ultra high frequency band directional antenna array design)
    2013-11-24 18:21:00下载
    积分:1
  • inv_Pake
    park反变换,matlab simulink仿真模型搭建(Park inverse transformation)
    2019-03-10 17:41:44下载
    积分:1
  • Image-Processing-with-MATLAB
    matlab for images processing
    2011-01-21 20:11:44下载
    积分:1
  • Harris-corner-detector
    Harris 角点检测,简单初等代码,具体过程(harris corner detector)
    2011-08-30 17:12:19下载
    积分:1
  • xiaobo
    小波神经网络的PPT,包括很多实用性的东西(Wavelet Neural Networks PPT, including a lot of practical things)
    2013-04-14 19:46:54下载
    积分:1
  • mycontourlet
    基非下采样的Contourlet变换的图像融合,要放到NSCT工具包中执行(Under the base of non-sampling Contourlet transform image fusion, to put the implementation of the toolkit NSCT)
    2010-10-30 10:48:17下载
    积分:1
  • CrankNicolson_DiffusionProblem
    CankNicolson scheme to solve the diffusion equation for different initial conditions
    2010-12-01 03:04:53下载
    积分:1
  • rdzeni_far5
    far field modelling of active optical fibre 5 core
    2011-02-09 04:36:24下载
    积分:1
  • 5
    说明:  利用Dijkstra算法来求网络图的最短路径,找到从起点P1到终点Pn的最短路径,由于上述算法使用了连接线中点的条件,不是整个规划空间的最优路径,然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整,让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
    2011-05-10 16:03:58下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载