-
hough
一些源代码，主要是图像处理方面的，希望对以后的读者有帮助(Some source code, mainly image processing, and hope to help future readers)
- 2010-07-18 10:40:45下载
- 积分：1
-
Projet
Magnetic levitation controller
- 2010-09-21 23:17:15下载
- 积分：1
-
Kalman
MATLAB实现Kalman滤波，注释详细，对Kalman滤波过程有详尽的解释，是初学者入门进阶的好程序(MATLAB implementation Kalman filtering, detailed notes on the Kalman filtering process has a detailed explanation on entry Advanced beginners are good procedures)
- 2009-03-04 08:53:25下载
- 积分：1
-
AVRStudio
AVRSTUDIO设置熔丝位加密内容，希望对大家有帮助！(AVRSTUDIO set fuse bits encrypted content, we want to help!)
- 2011-09-15 16:56:56下载
- 积分：1
-
ESPRIT
ESPRIT是“Estimating signal parameters viarotational invariance techniques”的缩写，含义是“借助旋转不变技术估计信号参数”，它是由Roy[221等人于1986年提出的另一种基于子空间的DOA估计方法。
应用领域
侧向定位 信号处理
思想
ESPRIT的思想在于，将传感器阵列分解为两个完全相同的子阵列，两个子阵中每两个相对应的阵元具有相同的平移，即要求阵列具有平移不变性，每两个位移相同的阵元匹配成对。所幸的是实际中许多阵列满足这个条件，比如等距直线阵。(ESPRIT is "Estimating signal parameters viarotational invariance techniques" acronym, meaning "With ESPRIT estimation of signal parameters", it is by Roy [221, who in 1986 proposed DOA estimation method based on subspace another.
Applications
Lateral positioning signal processing
Thinking
ESPRIT thinking that the sensor array is divided into two identical sub-arrays, each of the two sub-arrays of two corresponding array element has the same translation, which requires an array with translation invariance, the displacement of each of the two identical arrays yuan matching pairs. Fortunately, many of the actual array satisfy this condition, such as equidistant linear array.)
- 2014-02-19 13:17:31下载
- 积分：1
-
simple-bp
一个简单的bp算法，运行中可以看到每一步的结果。适合初学者。(A simple BP algorithm, the operation can be seen in the results of each step. Suitable for beginners.)
- 2014-11-06 11:14:23下载
- 积分：1
-
sp_sen
prob of detection vs prob of false alarm
- 2016-04-14 12:28:15下载
- 积分：1
-
spectral_clustering_cogs118b-master
1. 按照式计算相似性矩阵
2. 排除自身的相似度
3. 按照式计算归一化矩阵
4. 按照式计算归一化拉普拉斯图矩阵L
5. 计算L的特征向量，将前个特征值最大的向量按列放置成一个矩阵，即依次为前个特征值最大的特征向量
6. 归一化X形成矩阵Y
7. 对矩阵Y按每行为一个数据点，进行k-means聚类，第行所属的类就是原来所属的类。(1. similarity matrix based on formula computation
2. rule out your own similarity.
3. normalized matrix based on formula computation
4. normalized formula Laplasse matrix L according to formula.
5. Calculate the eigenvectors of L. Place the vectors with the largest eigenvalues in columns into a matrix, that is, the eigenvectors with the largest eigenvalues in turn.
6. normalized X formation matrix Y
7. K-means clustering is applied to matrix Y according to one data point per behavior. The first row belongs to the original class.)
- 2018-11-16 09:14:48下载
- 积分：1
-
xiashan
MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<>
迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)
- 2013-05-15 08:52:09下载
- 积分：1
-
chap04
matlab实例clearN=100f=zeros(50,50) f(15:35,23:28)=1 figure(1)imshow(f, notruesize )F=fft2(f,N,N) F2=fftshift(abs(F)) figure(2)x=1:N y=1:N mesh(x,y,F2(x,y)) colormap(gray) colorbar(matlab)
- 2009-09-21 09:38:52下载
- 积分：1
|
联系客服（QQ：3324461878）
