-
devide
基于二维直方图的图像模糊聚类分割方法，内有算法的参考论文。(Two-dimensional histogram based on fuzzy clustering image segmentation algorithm, which algorithm has the reference papers.)
- 2008-04-03 09:05:45下载
- 积分：1
-
v60-22
This paper presents a new classification algorithm using
colour and texture for obstacle detection. Colour information is
computationally cheap to learn and process. However in many cases,
colour alone does not provide enough information for classification.
Texture information can improve classification performance but usually
comes at an expensive cost.
- 2010-05-13 07:13:53下载
- 积分：1
-
work
基于方向微分的运动模糊方向确定
该方法具体可参见张朝阳的“直线运动模糊图像的点扩展函数的研究”(The direction of motion blur based on the direction of determining differential)
- 2010-05-29 10:43:00下载
- 积分：1
-
matlab__leach
this code packet is very useful and heplful in your communication search.
- 2011-06-16 19:59:29下载
- 积分：1
-
gridding.tar
This is a work-in-progress. Please check back for updates, and check software carefully before using!
- 2014-10-14 13:20:25下载
- 积分：1
-
matlab
基于matlab的非线性方程组求解的方法(Matlab-based non-linear equation solving methods)
- 2009-04-14 09:55:33下载
- 积分：1
-
arrow
ARROW (5/20/2009) Draw a line with an arrowhead.
ARROW(Start,Stop) draws a line with an arrow from Start to Stop (points should be vectors of length 2 or 3, or matrices with 2 or 3 columns), and returns the graphics handle of the arrow(s). By itself, ARROW will use the mouse to allow selection.
- 2010-10-20 14:36:24下载
- 积分：1
-
pcmeassyencode
实现基本的PCM编译码功能，函数简单，程序可行(PCM encoding and decoding functions to achieve the basic function is simple, practical procedures)
- 2010-11-24 17:51:59下载
- 积分：1
-
JogoMinoria
The code was developed to genereate artificial market trajectory. It was also developed in matlab
- 2013-01-10 21:59:59下载
- 积分：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
