登录
首页 » matlab » Parzen-window

Parzen-window

于 2014-08-13 发布 文件大小:55KB
0 221
下载积分: 1 下载次数: 78

代码说明:

  这是一个有关parzen窗估计的代码,用来估计概率密度函数。采用了方窗、指数窗、高斯窗函数三种核函数,附有matlab程序。(This is an estimate of the code related to parzen window, used to estimate the probability density function. With a side window, the index window, Gaussian window function three kinds of kernel function, with matlab program.)

文件列表:

parzen窗密度估计.doc,88064,2014-08-13
Untitled.m,1102,2014-05-08

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

发表评论

0 个回复

  • SER_zf_sic
    V-BLAST over rayleigh fading channel ZF equalizer with dimension 2x2 4x4 and 2x4
    2009-12-13 07:33:48下载
    积分:1
  • spectral-analysis
    这是三组程序,分别计算hibert变换,小波时频分布,wigner-vill分布,并且画出谱图(This is three groups of program, calculate hibert transform, wavelet time-frequency distribution, wigner- vill distribution, and draw the spectrogram)
    2014-10-31 15:34:08下载
    积分:1
  • inc-cond
    The file introduces a method for maximum power point tracking of a photovoltaic array by incremental conductance.
    2013-11-07 07:52:20下载
    积分:1
  • newton_iteration
    这是我自己写的亲测可用的matlab 牛顿迭代法函数程序(This is the Newton iteration program based on MATLAB written by myself)
    2014-01-07 16:32:32下载
    积分:1
  • m_files_1
    This code is used to cut selected part of the image that is of course after you decompress.   And run the code in the image circle separated.
    2014-08-13 21:59:48下载
    积分:1
  • zhinengkongzhiziliao
    智能控制编程及其在matlab中如何应用实现(Intelligent control programming and its implementation in matlab how to apply)
    2013-08-31 13:01:03下载
    积分:1
  • mfileshowto
    How to create m-files in Matlab guide.
    2009-05-19 14:35:58下载
    积分:1
  • YTY_GA_Final
    To find the largest fitness value and its location 寻找最大适应性及相应的位置! Population N=50;crossover bits=n/2 (half of bits of an individual) with random locations,mutation bits = 4 种群数 N=50,交换位数= n/2, 即个体位数的一半,且位置随机; 变异位数统一取为4; Nc=20,28,36,44,individuals for crossover(交换的个数)。 Nm=1,5,10,15, individuals for mutation(变异的个数)。 (To find the largest fitness value and its location to find the location of the maximum adaptability and the corresponding! Population N = 50 crossover bits = n/2 (half of bits of an individual) with random locations, mutation bits = 4 population size N = 50, exchange digits = n/2, ie half of the median individual, and random position variation is taken as unity median 4 Nc = 20,28,36,44, individuals for crossover (exchange number). Nm = 1,5,10,15, individuals for mutation (the number of variations.))
    2010-12-27 21:23:27下载
    积分:1
  • FR
    With FR conjugate gradient method for solving unconstrained problem
    2013-08-29 14:33:16下载
    积分:1
  • New-methods-for-MRI-denoising
    New methods for MRI denoising based on sparseness andself-similarity
    2013-11-16 10:09:46下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载