MeanShift

卡尔曼滤波是一种数据处理方法，它是一种线性最小方差无偏估计准则，基于系统 状态估计和当前观测，通过引入状态空间而获得的新的状态估计.本篇论文陈述了卡尔曼滤 波的基本思路和算法；并通过仿真，显示卡尔曼滤波的功能，以及如何用它来跟踪方向确定、速度恒定的飞行器。 (Kalman filter is a data processing method, which is a linear minimum variance unbiased estimation criteria, based on system state estimation and the current observations, obtained by introducing the state space of the new state estimate of the Kalman filter thesis statement the basic ideas and algorithms and through simulation, shows Kalman filtering functions, and how to use it to keep track of the direction determined constant speed aircraft.)

本代码功能是将图像旋转任意角度，为进一步的图像处理做铺垫。(The code function is to rotate the image at any angle, laying the groundwork for further image processing.)

用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)

本文提出了基于二维混沌映射的数字图像水印算法，混沌具有随机性、似噪声及对初始条件的极端敏感性等特点。将经过二维混沌映射置乱后的数字水印信号嵌入图像小波域的低频系数，实现了数字水印的隐蔽性、保密性和稳固性；利用二维混沌映射Arnold变换对水印信号进行置乱，不仅增强了水印信号保密性，同时有效提高了视觉上抵抗图像剪切攻击的能力。(In this paper, two-dimensional chaotic map based on digital image watermarking algorithm, Chaos with random noise and the likelihood of extreme sensitivity to initial conditions and so on. Two-dimensional chaotic map will be scrambling after the digital watermark embedded image signal of the low-frequency coefficients in wavelet domain, the realization of a digital watermark hidden, security and stability the use of two-dimensional chaotic map on Arnold transform scrambling watermark signal, not only enhances the confidentiality of the watermark signal at the same time improve the visual image shear resistance attacks.)

生成四副条纹图，进行四步相移，并且进行相位解包裹，并以图片形式输出结果(Generate four fringes, were four-step phase shift and phase unwrapping, and output as a picture)

说明：  实现了图像的打开功能，并能实现图像打开时的扫描，渐进，马赛克等功能(To realize the image of the open function, and can achieve image scans open, progressive, mosaic and other functions)

实现凸多边形排样，使用临界多边形NFP判断两个凸多边形形是否相交,使用启发式算法提高效率， (Convex polygon nesting, polygon NFP to determine whether two convex polygon-shaped intersection, the use of heuristic algorithms to improve efficiency,)

说明：  一个简单的画图程序，提供基本图元点、线、面，图元填充、裁剪的操作(Simple Draw)

sobel segmentation, this algorithme has a great effect for segmenting

K均值聚类算法对图像进行分割，实验用程序，亲测可用。(K-means clustering algorithm for image segmentation, experimental procedures, pro-test is available.)