登录
首页 » matlab » Zhang(zhongwenzhushi)

Zhang(zhongwenzhushi)

于 2015-08-24 发布 文件大小:3KB
0 212
下载积分: 1 下载次数: 3

代码说明:

  对张正友标定得程序重新详细标注了中文注释,方便初学者尽快入门,在最短的时间内了解程序流程,提高学习效率!(Zhang Zhengyou matlab calibration procedures, in order to facilitate a beginner, a code re-done every detail marked Chinese comments, so that we can understand the flow of the program as soon as possible!)

文件列表:

Zhang(zhongwenzhushi).m,6105,2011-06-14

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

发表评论

0 个回复

  • DiffStrip
    傅里叶时域频域变换图形处理S参数在时域的应用(Fourier time domain frequency domain transform graphics processing S-parameters in the application of the time-domain)
    2012-09-05 17:03:20下载
    积分:1
  • shendutuxiang
    深度图像处理,主要的是对深度图像进行区域分割(depth map)
    2010-06-04 21:07:41下载
    积分:1
  • waveletdecomposition
    对红外图像进行增强,采用多小波分解进行分层增强(Infrared image enhancement, wavelet decomposition of multi-layered enhancement)
    2010-10-09 20:51:39下载
    积分:1
  • gradephase
    传统的相位编组,将梯度分为8个方向,对边缘检测有很好的效果。(Traditional phase grouping, will be divided into eight direction of the gradient of edge detection are very good results.)
    2020-07-14 21:18:51下载
    积分:1
  • SEEDS超素分割算法的源码
    SEEDS超像素分割算法的源码,C++实现,可运行(The source code of SEEDS Superpixel picture segmentation)
    2020-06-27 04:00:01下载
    积分:1
  • some-examples
    一些matlab图像图像处理例程,骨架,灰度图像梯度,凸壳,细化.(Some image image processing matlab routines, skeleton, grayscale gradient, convex hull, thinning.)
    2011-07-05 09:31:32下载
    积分:1
  • work7
    实现图像匹配,ssda算法,自主截图选择匹配位置(To achieve image matching, ssda algorithm, self-selection match position screenshots)
    2010-03-10 21:25:37下载
    积分:1
  • Wavelet_ROMP
    压缩感知CS——采用小波变换进行稀疏表示,高斯随机矩阵为观测矩阵,重构算法为ROMP算法,对256*256的lena图处理,比较原图和ROMP算法在不同采样比例(0.74、0.5、0.3)下的重构效果,并各运行50次,比较算法性能PSNR和每次的运行时间 (Compressed sensing CS- using wavelet transform as sparse representation, Gaussian random matrix as the observation matrix and ROMP algorithm as the reconstruction algorithm. Compare lena figure and the reconstruction results using ROMP algorithm at different sampling ratio (0.74,0.50.3),then each runs 50 times, compare the performance of PSNR and each running time)
    2013-01-19 12:54:34下载
    积分:1
  • 24368
    程序将界面与数据处理分开,界面采用MFC的对话框模板,对注册、训练、识别和主界面分别建立一个类,通过消息处理函数与用户进行交互,利用多线程来实时显示图像。 数据处理又分为了CFaceAlign(人脸检测+几何归一化)、CLightPrep(光照归一化)、CFaceFeature(Gabor特征提取)、CSubspace(计算Fisherface子空间)四个类,还有一个类 CFaceMngr 负责管理界面与数据之间的交流。这样的程序结构使对界面和算法彼此独立,互不影响。 每个类的具体方法请见相应头文件中的注释。(The program will interface with the data processing separate interface using MFC dialog template, registration, training, recognition and the main interface, respectively, to create a class that interacts with the user through a message handler, using multiple threads to display images in real time.   Data processing is divided into a CFaceAlign (Face Detection+ geometric normalization), CLightPrep (illumination normalization), CFaceFeature (Gabor feature extraction), CSubspace (computing Fisherface subspace) four categories, as well as a class is responsible for managing CFaceMngr interface and data exchange between. Such a program structure allows for interfaces and algorithms are independent of each other. Specific methods of each class, see the comments in the appropriate header files.)
    2015-04-13 10:05:34下载
    积分:1
  • algorithm-of-findpath
    绣花问题是连续型的填充,在不同区域的缝制过程中,缝针不能提针,因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法:先对轮廓走向进行 定义,通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割,采用交点的特征值比较彻底的解 决了分割时的重点问题,将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”,通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历(缝制)序列和每 个节点的缝制方向,最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)
    2012-12-09 23:26:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载