在VC6.0中的一些基本操作,常常用来进行简单的学习和常规的练习...

连接边缘算法提取的孤立点，实现图像边缘连接-link the point to get edges in the image

很好用的体绘制算法程序，可以展现优美的图形算法。-good use of volume rendering algorithm procedures, able to display the beautiful graphics algorithm.

图像处理方面，主要完成将二值数字水印嵌入到原图像中完成隐藏，同时完成了提取过程的编码-Image processing, the main value of the completion of the second digital watermark is embedded in the completion of the original image to hide, at the same time to complete the extraction process of encoding

Floyd-Steinberg算法的源代码.要注意的是，误差传播有时会引起流水效应，即误差不断向下，向右累加传播。解决的办法是：奇数行从左到右传播，偶数行从右到左传播。-Floyd-Steinberg algorithm source code. It should be noted, Error Propagation sometimes causes water effects, that is, constant downward error, right cumulative spread. The solution is : OK whatever odd communication, even from right-to-left line transmission.

自己做的数字图像处理，用matlab做的gui界面。-Make their own digital image processing, matlab to do with the gui interface.

一个非常完成的图像滤波的例程，包含了常用的各种滤波方法，结合openCV使用，对于初学者很有帮助。-A very complete image filtering routines, contains a variety of commonly used filtering method, combined with openCV use, very helpful for beginners.

图像灰度拉伸、直方图均衡算法以及FCM聚类算法。-Image stretching, histogram equalization algorithm and the FCM clustering algorithm.

从单张图片中去除相机抖动造成的模糊的matlab程序，算法见Removing Camera Shake from a Single Image-err

用VTK与VC++混合编程实现对山地形等值线的绘制，内含人脑数据-with VTK and VC mixed programming the mountain terrain contour mapping, data containing the human brain

摘要：拐点是数字图像中的一个重要信息载体 提出一种新的拐点检测算法 该算法并非寻找连续空间中曲率的离散近似计算方法，而是源于离散曲线的外观特征，推导出离散曲线上拐点处k个点对间欧氏距离平方和局部最小这一重要性质。基于该性质，本算法首先利用Freeman链码的性质.过滤掉物体边界上明显不可能成为拐点的象素，然后在剩余的边界点中通过寻找该局部最小值定位出拐点。给出了本算法与四种著名拐点检测算法的对比实验。 -Abstract: The inflection point is a digital image of an important information carrier put forward a new turning point detection algorithm the algorithm does not look for continuous space discrete approximation of the curvature calculation method, but from the appearance of characteristics of discrete curve derived discrete curve the inflection point at k-points between the squared Euclidean distance and the local minimum of this important property. Based on the nature of the algorithm is the first to use Freeman chain code in nature. Filter out objects clearly can not become a turning point on the border pixel, and then in the remaining boundary points by finding out the turning point of the local minimum position. The algorithm is given inflection point detection algorithm with th