chengxu

图片压缩到最小源码，例程程序结合易语言图像格式转换支持库，将快照的BMP图片转换成JPG图片，再将众多JPG图片压缩到一个压缩文件中，达到减小图片体积的效果。(Image compression to a minimum source , routine program combined image format conversion easy language support library , a snapshot of BMP images into JPG image , and then a large number of JPG images into a compressed file , to reduce the effect of image volume .)

通过非监督分类中的K-均值聚类对Indian pines高光谱图像进行分类(Classification of hyperspectral images of pines Indian by K-means of non supervised classification)

图形图像处理算法大全，包含各种算法的源码，只要经过简单修改就可变为程序(Daquan graphic image processing algorithms, including the source code for various algorithms, as long as you can into a program after a simple modification )

说明：  傅里叶分解计算基波有效值相位角和各次谐波的有效值和相位角(Fourier decomposition of computing fundamental RMS phase angle and harmonic RMS and phase angle)

计算两幅图像联合直方图的matlab小程序。可以用于图像分割及图像互信息的计算(calculated two joint histogram of the image of small Matlab procedures. Can be used for image segmentation and image mutual information calculation)

数字图像处理,离散小波dwt变换域中水印的嵌入(digital image processing, discrete wavelet transform domain dwt watermark embedding)

winform 多个 饼形图 分析人力资源数据

说明：  开源图形处理工具，可以处理图象，显示，投影转换，栅格和矢量数据处理(Open source graphics tool that can handle images, display, projection conversion, raster and vector data processing)

用MATLAB实现不规则图像的面积测量，采用像素灰度值的占比进行实现(Area Measurement of Irregular Images Using MATLAB)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)