fatigue-driving-system

实现了Thien在他的文章《secret image sharing》中提出的（r，n）门限秘密图像分存方案。 (Thien in his article " secret image sharing" (r, n) Door Threshold Secret Image Sharing Scheme.)

VTK读取BMP序列图片实现MC算法面绘制，并且将绘制结果保存为STL格式。(VTK read BMP image sequences to achieve MC surface rendering algorithm, and the results will be drawn saved as STL format.)

说明：  Jpeg算法源代码，包含jpeg的各种算法实现的vc++的源代码(Jpeg algorithm source code, including the various algorithms jpeg of vc++ source code)

直方图均衡化处理编程指南及实验报告，数字图像处理及应用，阮秋琦教授，北京交通大学（资源分享）。(Histogram equalization processing programming guide and laboratory reports，Application of digital image processing and Beijing Jiaotong University, Professor Ruan Qiuqi)

图像处理系列之边缘检测篇 涵盖内容： 1>Roberts算子 2>Prewitt算子 3>Sobel算子 4>Laplacian算子(Edge Detection)

包括图像输入（打开文件、采集、捕捉图像、从剪贴板粘贴、打开扫描软件、灰度化、添加随机噪声、椒盐噪声、去噪声）、图像处理（几何变换、灰度反转、直方图均衡化、直方图统计、图像复原、边缘提取、伪彩色、二值化、图像变换）、图像输出（另存图像、打印输出、复制到剪贴板）(Including image input (open the file, capture, capture images, paste from the clipboard, open the scanning software, graying, adding random noise, Salt and pepper noise, to noise), image processing (geometric transformation, gray inversion, histogram equalization oriented, histogram statistics, image restoration, edge extraction, pseudo-color, binary, image transform), image output (save the image, print out, copy to clipboard))

这是一个比较全面的傅里叶变换，例子中含有测试的图片，能让人更加明白傅里叶变换的处理效果。(This is a more comprehensive Fourier transform, the example contains a picture of the test, can make people more aware of the Fourier transform of the treatment effect.)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)

用kinect获取3D图像，并从3D图像中用OpenCV方法从深度图中获取梯度边缘，从而得到更多信息，做后续处理(Get with kinect 3D images, and get the edge gradient from the depth map from a 3D image using OpenCV method to obtain more information, do follow-up treatment)

用C语言实现的离散傅里叶变换（DFT）的经典算法！比较实用！(C language classic of the discrete Fourier transform (DFT) algorithm! More practical!)