-
DMA
一、直接数据通道传送
二、常用DMAC芯片— Intel 8237
三、IBM PC/XT中的 DMA 控制逻辑
四、应用举例
(A direct transfer two data channels, often DMAC chip- Intel 8237 3, IBM PC/XT in the DMA control logic 4, Application Examples)
- 2010-08-05 00:15:09下载
- 积分：1
-
matlab
摘 要:针对茄子图像的灰度和颜色特点,利用MATLAB中丰富的图像处理函数,分别进行了色差分割和色调分割。在
色调分割中,采用了自动选取阈值的Otsu法。在去除残留噪音的处理中,采用标注的方法对二值图像的各连通区域进行面积
统计。保留最大面积的区域,从而使分割效果大大改善。利用多参数来衡量分割效果,使评价做到最大程度的客观、合理。(Based on the gray- level and color characteristics of eggp lant image, hue and color- difference segmentation were
conducted by using the rich image p rocessing functions embedded inMATLAB. The auto threshold- adap tivemethod ofOtsu operation
was specially used for hue segmentation. And upon the elimination of the residue noise, labelingmethod for statistical calculation was
introduced for the connected regions of the binary image. Themaximum areaswere p reserved to imp rove segmentation effects. In addi2
tion, multi- indiceswere app lied to assess the effect of segmentation, in order to get impersonal and reasonable assessment)
- 2009-05-12 11:21:14下载
- 积分：1
-
target-tracking-using-kalman
matlab编写的用卡尔曼滤波实现目标跟踪(matlab prepared using Kalman filter tracking)
- 2013-10-17 15:49:05下载
- 积分：1
-
ypml110-dbscan-clustering
说明： dbscan聚类代码及说明，包含多个文件的代码。(DBSCAN clustering code and description)
- 2019-04-13 11:39:59下载
- 积分：1
-
Turbo_simulink
Turbo码仿真程序。有Turbo码的编码，MAP算法，迭代译码，删余和没删余的。(Turbo code simulation program. Turbo codes have coding, MAP algorithm, iterative decoding, censored and no more than delete the remaining.)
- 2021-02-04 19:59:57下载
- 积分：1
-
Assignment
说明： Matlab 模拟仿真 MIMO
直线基站均匀分布
蒙特卡罗仿真信道容量。(Matlab simulation MIMO linear Monte-Carlo simulation of uniformly distributed base station channel capacity.)
- 2010-03-23 05:29:18下载
- 积分：1
-
0067_slide
this is a brain image
- 2009-06-15 19:25:12下载
- 积分：1
-
LTE_System_Level_1.0_r247
LTE仿模型，十分好用，可以快速帮你理解
(ofdm simulation model, is very easy to use, can quickly help you understand)
- 2010-05-07 19:23:28下载
- 积分：1
-
stbc
空时分组码stbc的matlab仿真程序。(STBC stbc the matlab simulation program.)
- 2010-06-24 10:09:52下载
- 积分：1
-
DTW
DTW算法的程序，申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划，为每个格点 （i，j）都计算其三个可能的前续格点的累积距离D1，D2，D3。考虑到边界问题，有些前续格点可能不存在，因此加入一些判断条件最后利用最小值函数min()，找到三个前续格点的累积 距离作为累积距离，与当前帧的匹配距离d（i，j）相加，作为当前格点的累积距离。该计算过程一直达到格点（n，m），并将D（n，m）输出，作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)
- 2014-05-05 14:30:21下载
- 积分：1
