继续神经网络编程，bp算法，delphi 2005下编译通过

一种新的计算马氏距离的算法，算法采用二次协方差矩阵操作，进而使距离考加入相对性因素。-a new Mahalanobis distance calculation algorithm, the algorithm using quadratic covariance matrix operations, thereby enabling the relative distance to take factors.

模糊C均值聚类算法的MATLAB实现，比较经典的程序-Fuzzy C-means clustering algorithm to achieve MATLAB, compare the classic procedure

图像感知，获取，采样，显示和量化；图案发显示，随机抖动法显示-Image perception, acquisition, sampling, display and quantification pattern hair show, random jitter display

vc图像处理比较全面的程序，提供了图象直方图均衡，robert,sobel,prewitt,kirsch,gauss等方法的边缘检测运算，中值滤波，二维FFT变换和DCT变换，图象的反转，旋转等一些基本的图象模板变换和点变换的功能。目前只处理256*256的图象-vc images deal with more comprehensive procedures, provided the image histogram equalization, robert, sobel, prewitt, kirsch, gauss and other methods of edge detection operator, median filtering, two-dimensional FFT transform and DCT transform, image reversal, rotating images, such as some basic templates and point transform transform function. Currently only deal with 256* 256 image

在活动轮廓模型的c++程序中，详细介绍了蛇轮廓模型的内外能量函数打击等。

用小波变换对图象进行灰度处理Wavelet-Using Wavelet Transform of image gray-scale deal with Wavelet

叠加椒盐噪声后进行二阶巴特沃斯(Butterworth)低通滤波,最后显示处理结果. 直接解压后将图片和程序放在同一个文件夹里.-after second-order Butterworth (Butterworth) low-pass filtering, Final results showed. Photo will be directly extracted and procedures on the same document folder.

本程序主要实现对退化图像进行复原，主要有运动模糊图像复原，逆滤波复原，维纳滤波复原-The main achievement of this procedure on the degradation of image recovery, there are motion-blurred image restoration, inverse filtering to recover, Wiener filter restoration

分而治之方法还可以用于实现另一种完全不同的排序方法，这种排序法称为快速排序（quick sort）。在这种方法中， n 个元素被分成三段（组）：左段l e f t，右段r i g h t和中段m i d d l e。中段仅包含一个元素。左段中各元素都小于等于中段元素，右段中各元素都大于等于中段元素。因此l e f t和r i g h t中的元素可以独立排序，并且不必对l e f t和r i g h t的排序结果进行合并。m i d d l e中的元素被称为支点( p i v o t )。图1 4 - 9中给出了快速排序的伪代码,,Delphi 赫夫曼编码.rar.rar - 用delhi做的程序实现了哈夫曼编码，做的还不错。,,Delphi -divide and rule method can be used to achieve an entirely different sort of way This sorting called Quick Sort (quick sort). In this approach, n elements is divided into three (group) : Left of the l e f t, Right of g h i r t and middle m i d e d l. Middle contains only one element. Left of the elements are less than equal to the middle element of the right elements are larger than the middle element. So l and f t e r t h i g of elemental independent sort, and no need to l and f t e r t h i g ranking results merger. M i d e d l The element known as Fulcrum (p i v o t). Figure 1 4-9 is given a quick sort of pseudo-code. Delphi Hefuman coding. rar.rar- delhi do wi

这是一个图形学中的直线裁减程序，能方便地实现窗口对直线的裁减。-This is a graphics straight reduction procedures, convenient to be able to realize the window of linear reductions.