实现YUV

这个程序的功能实现了，将一幅彩色图像先变为灰度图像，然后在统计它的直方图，接着给变换后的图像输入目标，做剪影，最终把剪影后的结果输出-Function realization of this program, and will be a color image into a grayscale image first, and then its histogram statistics, and then after the image input to the transformation goals, to do silhouette, the final result after the output of the silhouette

计算机图形学的编程实践，包括画直线、反走样直线、画圆、 画椭圆、画矩形、画多边形、矩形填充、多边形填充、3D变换、光照、贴图等-computer graphics programming practice, including painting line, anti-aliasing straight Circle, painted oval, rectangular painting, drawing polygon, rectangle filling, polygon filling, 3D transformation, lighting, textures, etc.

基本的图像变换，包括：动态显示，几何变换，灰度变换，变换域处理，图像分割，小波变换等-The basic image transformation, including: dynamic display, geometric transform, grayscale transform, transform domain processing, image segmentation, wavelet transform, etc.

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

图像边沿处理、检测与提取，是常用的图像处理软件之一-Edge image processing, detection and extraction, is commonly used in image processing software, one of

数字图像处理中一个重要的滤波器，带走文档的详细描述。

图像分割与特征提取 C开发 The picture division and the characteristic withdraw--C development -Image Segmentation and Feature Extraction C Development The picture division and the characteristic withdraw- C development

自己写的多边形点在内判断的简单算法，运行没有出现问题，无论多边形情况（凹凸）-Write your own polygon points in a simple algorithm to determine, running no problems, regardless of polygons situation (bump)

基于kmeans的图像分割算法，首先得到图像，再确定分类，并计算各分类的均值，从而得到各个像素的分类。-Kmeans-based image segmentation algorithm, first of all get the image, and then determine the classification, and calculate the various categories mean, and thus obtain the classification of each pixel.

Fast computation of a discretized thin-plate smoothing spline for image data