calibration-3-cameras

这个函数分配一个数据缓冲区与多个颜色指定系统上的乐队。这种类型的缓冲区允许表示彩色图像(例如,RGB)。 这个函数为每个指定分配缓冲区,一个二维表面颜色乐队。您可以使用MbufAlloc1d()和MbufAlloc2d()来创建单独的乐队一或二维 数据缓冲区,分别。 分配一个缓冲区后,我们建议您检查是否操作成功,使用MappGetError(),或通过验证,不是M_NULL返回的缓冲区的标识符。(This function allocates a data buffer with multiple color bands on the specified system. This type of buffer allows for the representation of color images (for example, RGB). This function allocates buffers that have a two-dimensional surface for each specified color band. You can use MbufAlloc1d() and MbufAlloc2d() to create single band one- or two-dimensional data buffers, respectively. After allocating a buffer, we recommend that you check if the operation was successful, using MappGetError(), or by verifying that the buffer identifier returned is not M_NULL.)

本文是中值滤波的一些应用，个人觉得中值滤波比一些算子滤波效果要好得多(This article is median filtering applications, personal feel median filter is much better than some of the filtering effect of the operator)

基于opencv的C语言的疲劳驾驶检测代码，肤色检测人脸(fatigue driving detecting)

计算机图形学中实现多边形平移，旋转，缩放变换。(Polygons in computer graphics to achieve translation, rotation, scaling transformation.)

改进的聚类光流法，聚类方法有kmeans和DBSCAN，光流法金字塔LK可以用，HS光流法占用内存太多。(Improved clustering optical flow method, clustering method kmeans and DBSCAN, pyramid LK optical flow method can be used, HS optical flow occupy too much memory.)

canny边缘检测，还有车道线检测。效果还可以。(canny edge detection, and lane detection. The effect can be.)

pca-sift算法的实现，采用vc2008开发环境，进行开发，独立运行(pca-sift algorithm, using vc2008 development environment to develop, operate independently)

说明：  opencv入门程序，使用opencv模式读取图像并显示，在vs环境下调用matlab进行图像读取和显示(opencv entry procedures, read the image using opencv mode and display, in the vs environment, call matlab to read and display the image)

通过点云数据的格网化，建立格网分块索引，这是一种有效的点云数据存储方式。( Through the point cloud data grid , the establishment of a grid block index, which is a valid point cloud data storage. )

说明：  SIFT算法的区域匹配，比原有的SIFT+KD树匹配更加高效、准确。(different area SIFT algorithm which is better than the original SIFT and KD tree match.)