-
trackinger
目标跟踪程序,使用matlab编写,采用CV模型,卡尔曼跟踪,有轨迹模拟,给出了跟踪的误差
目标跟踪,采用CV模型,卡尔曼滤波,给出模拟结果和跟踪结果,给出误差分析(Target tracking program, using matlab prepared, using the CV model, Kalman tracking, trajectory simulations have given a tracking error target tracking, using the CV model, Kalman filter, and track the results of the simulation results are given, error analysis is given)
- 2021-04-24 17:28:47下载
- 积分：1
-
WF_1D_CDP
。基于Wirtinger流的相位恢复算法是由Emmanuel J. Candes等于2015年提出的新的相位恢复算法，该方法不再将光场函数局限于非凸集中，而是利用一种新的初始化方式以及迭代规则来寻找最优解。(a new approach about phase retri which is published in 2015)
- 2017-05-07 10:22:24下载
- 积分：1
-
白平衡代码
说明： 几个白平衡程序，都能运行出来，可以用于水下图像偏绿偏蓝现象的颜色调整(Several white balance programs can be run)
- 2020-11-25 14:49:38下载
- 积分：1
-
Image-Reconstruction
运用滤波反投影的方法对所输图像进行重建，其中可以对图像的滤波和插值进行选择。(Using filtered back-projection method for the reconstruction of the input images, which can filter and interpolation of images to choose.)
- 2009-10-09 18:35:43下载
- 积分：1
-
fcm1
此程序采用 FCM，模糊c 均值方法，用于边缘检测(This program uses FCM, fuzzy C mean method, for edge detection)
- 2020-10-12 23:27:32下载
- 积分：1
-
shift
实现shift算法，进行精确的图像识别，可以抵抗各种旋转、平移、缩放等仿射变换的攻击(Realize shift algorithm, an accurate image recognition, you can resist all kinds of rotation, translation, scaling affine transformation attack)
- 2007-09-26 14:19:07下载
- 积分：1
-
yuhuiweixiang
迂回位相全息图matlab程序，经测试能正常运行，并且全息图效果良好(Detour phase hologram matlab procedures, have been tested to normal operation, and good hologram effect)
- 2008-07-07 11:17:29下载
- 积分：1
-
source
代码中包含在MATLAB中实现DICOM文件的VOILUT感兴趣区域转换。将DICOM文件的数据重新存储为PNG格式的灰度图像。打开一个文件夹的DICOM文件并将其存储在另一个文件夹中以PNG格式储存。(Included in the MATLAB code to implement DICOM files VOILUT region of interest conversion. The data will be re-stored DICOM files in PNG format, grayscale images. Open a folder and stored in the DICOM files to another folder in PNG format.)
- 2011-11-01 22:41:25下载
- 积分：1
-
KPCAandPCA
含有pca和kpca算法，具有很好的在图像处理方面的应用(contain pca and kpca algorithm, is very good in image processing the application)
- 2006-08-26 23:02:05下载
- 积分：1
-
minimum-spanning-tree
在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)
- 2013-08-23 23:06:57下载
- 积分：1
