登录
首页 » matlab » 592ICA

592ICA

于 2011-06-11 发布 文件大小:10218KB
0 214
下载积分: 1 下载次数: 4

代码说明:

  this is good source. try to explore it. and also youll find usefull when need to develop ica cases.

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

发表评论

0 个回复

  • vanishingalgorithm
    消隐算法 三维 消隐分类 画家算法 算法的介绍及例子说明(Vanishing algorithm 3 d Vanishing classification Painter algorithm The algorithm is introduced and examples )
    2012-03-21 16:18:31下载
    积分:1
  • Multivariate-Linear-Regression
    Multivariate Linear Regression
    2013-04-06 04:42:22下载
    积分:1
  • targettracking
    用最邻近数据关联算法实现目标跟踪,对研究目标跟踪领域的朋友有用(With the nearest neighbor data association algorithm for target tracking)
    2010-11-21 18:56:24下载
    积分:1
  • BKD
    一个帮助外汇交易者判断交易方向的信号,思路是进行突破交易,结合布林带通道和KD指标,KD上涨过程中过滤做空信号,KD下跌过程中,过滤做多信号。(A signal to help foreign exchange traders to judge the transaction direction, train of thought is a breakthrough deal with Bollinger channel and KD index, filter the short signal KD increases, KD falls in the process, filtering the signal to do more.)
    2014-12-15 02:19:54下载
    积分:1
  • pso-programs
    pso (PRACTICAL SWARM) toolbox
    2013-04-15 05:08:51下载
    积分:1
  • EnumerateAudioCaptureFilterCapabilities
    audio card enumerate searching ok. for multimedia developing project. thank you
    2014-01-08 17:50:46下载
    积分:1
  • kmeans
    k均值算法是一种迭代求解的聚类分析算法,其步骤是随机选取K个对象作为初始的聚类中心,然后计算每个对象与各个种子聚类中心之间的距离,把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。(kmeans algorithm is an iterative solution clustering analysis algorithm. First, the initial clustering centers are randomly selected. Then, distance between between each point ans others are calculated, and each data point is designed to its nearest clustering center.)
    2020-06-21 23:40:01下载
    积分:1
  • MATLABhelp
    一个很好的matlab中文帮助文档,希望对学matlab的人有所帮助(A very good Chinese matlab help document, in the hope that people learn matlab help)
    2007-12-04 08:28:09下载
    积分:1
  • LSSVM
    最小二乘支持向量机用于脑电心电处理的一段程序(Squares support vector machines for EEG ECG processing a program)
    2015-04-07 15:08:58下载
    积分:1
  • GraphSeg
    This paper addresses the problem of segmenting an image into regions. We defi ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an effi cient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the al-gorithm to image segmentation using two diff erent kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.
    2011-07-09 17:23:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载