这个代码实现了很好的

用于对彩色图像进行分割，很好的一个程序，大家请多支持我啊-Used for color image segmentation, a good a program, we like him to support me ah

对图像进行bluring.. 适用于pgm图像-right image bluring .. applicable to the pgm images

可以根据DICOM头信息，把图像文件按照树的结构分装在各个文件夹中。-according to the first DICOM information, and image files in accordance with the structure installed in various sub-folder.

PNG图像读写源码库 PNG图像读写源码库 PNG图像读写源码库 PNG图像读写源码库 -PNG Image PNG Image library to read and write source code source code library to read and write PNG image library to read and write source code to read and write PNG image library

该程序是用于图像处理的，包括对位图进行滤波，阈值分析等功能-that the procedure was used for image processing, including bitmap filtering, threshold analysis, and other functions

分而治之方法还可以用于实现另一种完全不同的排序方法，这种排序法称为快速排序（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

图像细化算法的代码,可以快速提取图象的基本骨架-source code for image thinnig, and it can extract the basic sketlon of images, fastly.

图形图象处理VC++编码,很好很使用,欢迎大家应用,希望与大家多交流-Graphic image processing VC++ Encoding, very good use, welcomed the U.S. application, I hope more exchanges with the U.S.

模式识别中几个聚类算法，也包括神经网络和遗传算法在图像识别中的应用-Pattern recognition of several clustering algorithms, including Neural Networks and Genetic Algorithm in Image Recognition

采用各向异性方法 填补一个缺损的轮廓，从而可以得到一个光滑完整的轮廓。- Completed contours correspond to ridges of an extension (ext) of the characteristic function of the uncompleted curve. Anisotropic extension is performed on the characteristic function fbound of an image set given by the binary map boundary to the whole image domain. Extension is initially driven by xi=(EigVect{1}, EigVect{2}) (which should match with the contour tangent direction) computed as the direction of maximum coherence of the distance map to the contour to close. It is updated every N iterations with DCV over the distance map to the ridges/thinning of the evolved image. Two different stop criteria are supported: Number of Connected Components ( numcomp ). Contour Completion. Stop when the extended contour (curve of level 1) has exactly Ncomp connected components. Difference between two consecutive iterations ( tol ) Speed Stabilizes ( speed_stab ). [extended]=ContourComple