rentigenzong

图像的纹理分析应用实例,主要可用于模式识别当中(image texture analysis application, which can be used for pattern recognition)

说明：  一个简单的画图程序，提供基本图元点、线、面，图元填充、裁剪的操作(Simple Draw)

运用openCV编写的C++图像色彩转移程序，原理是先转化到Lab图像，再保持L不变调整图像的a、b分量的均值跟方差。(Using openCV prepared C++ image color transfer process, the principle is first converted to Lab image, and then adjust the image to keep L constant a, b, with the mean variance component.)

雷达扫描程序，图形界面中显示雷达的运动情况。程序简单。可以学习 (AppWizard has created this spp application for you. This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your OpenGl application. )

一个简单的图像浏览器，对初学C++开发图像处理系统的朋友有启迪作用。(A simple image viewer, for beginners C++ image processing system developed friends revealing. )

说明：  用VB做的图像二值化的代码,希望能对大家有帮助(vb image test)

最小二乘法拟合圆vc实现，最小二乘法(least squares analysis)是一种 数学 优化 技术，它通过 最小化 误差 的平方和找到一组数据的最佳 函数 匹配。 最小二乘法是用最简的方法求得一些绝对不可知的真值，而令误差平方之和为最小。(least squares fitting round vc realized, least-squares method (least squares analysis) is a mathematical optimization techniques, It error by minimizing the square and a group of data to find the best matching function. Least-squares method is the most simple method to derive absolutely true value unknown, and so the sum of squared errors to the minimum.)

说明：  很有用的图像显示的源程序，是图像处理方面比较好用的程序！(very useful images of the source, the image processing is more user-friendly procedures.)

用C语言实现的离散傅里叶变换（DFT）的经典算法！比较实用！(C language classic of the discrete Fourier transform (DFT) algorithm! More practical!)

一个集成的图形界面的程序，可调用每一次作业子程序。 一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。 二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。 三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。） 五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 六、交互式Bezier曲线的输入绘制程序实现 (An integrated graphical interface of the program, each operation subroutine callable. One call a function of the point of the painting, with the DDA, the midpoint algorithm for drawing a straight line and the midpoint algorithm circle and oval. Second, the polygon scan conversion algorithm and region filling algorithm (scan line algorithm for must fill and edge flag algorithm based on the edge of the modulo operator is optional using the 4 regional connectivity recursive seed filling algorithm based on the area of seed filling, or scan line seed filling algorithm requires the seed point (x, y) can be entered interactively). Line Clipping polygon clipping algorithm animation achieved. (Two Line Clipping Algorithm and HS polygon-by-side clipping algorithm) polygon clipping algorithm animation requires draw a closed polygon, rectangle and then draw the crop window, and then select the the cropped button (or command), press the "on top of cutting "button (or the implementation of)