资源列表
libyuv
- libyuv 一个开源的色彩转换工具，在Android平台上使用了neon指令集优化。-An open source libyuv color conversion tool, on the Android platform using the neon instruction set optimization.
HistDemoA---12
- 通过c++程序实现对位图图像的直方图处理程序，在一个界面中显示处理前后的图像-Realization of the bitmap image by the histogram processing program c++ program, before and after the image processing is displayed in a single interface
HistDemoA
- 通过建立几个类实现对位图文件的直方图均衡化。-Realize the bitmap file histogram equalization.
qmdzy
- vc6.0用MFC制作opencv简单的图像处理-MFC make opencv simple image processing
3D_Math_PerlinNoise2D_Ocean
- 柏林噪声海洋模拟 柏林噪声海洋模拟 柏林噪声海洋模拟-perlin noise ocean simulation perlin noise ocean simulation perlin noise ocean simulation
20140811
- 贴图库sdk,PHP语言SDK (包括贴图库上传Token生成PHPSDK以及简易的一个演示PHPdemo)-Stickers gallery sdk, PHP language SDK (including stickers Gallery and upload Token generation PHPSDK a simple demo PHPdemo)
CarNumberRecognition
- 本算法主要分成这几个部分，图像输入、图像预处理、去噪、车牌字符分割和字符识别。-The algorithm is divided into several parts, image input, image preprocessing, de-noising, license plate character segmentation and character recognition.
Graphics-comprehensive-experiment
- 1.1实现绘制Bresenham直线 运用Bresenham算法，通过点绘制实现直线。 1.2实现种子填充算法 运用4连通种子填充算法，实现填充矩形的颜色填充和矩形框内的颜色填充。 1.3实现几何变换 运用glRotated、glTranslated、glScaled实现几何图像的旋转、平移、放大、缩小。 1.4实现窗口裁剪 通过Cohen_Sutherland、Sutherland_Hodgman实现线段裁剪和多边形裁剪。 1.5实现绘制曲线 通过Bezie
Byangtiao
- OpenGL用二次或三次B样条或Bezier曲线算法生成曲线。-OpenGL B-spline curves or Bezier curve algorithm used to generate two or three times.
Bezier
- 用二次或三次B样条或Bezier曲线算法生成曲线。-Generated by a quadratic curve or a cubic B-spline or Bezier curve algorithm.
Sutherland_Hodgman
- 实验四 编程实现Cohen-Sutherland线段裁剪算法或者Sutherland-Hodgman多边形裁剪算法 对各种情况进行测试，验证算法实现的完整性 -Experiments four programming Cohen-Sutherland line clipping algorithm or Sutherland-Hodgman polygon clipping algorithms for testing a variety of situations, to ver
Cohen_Sutherland
- 实验四 编程实现Cohen-Sutherland线段裁剪算法或者Sutherland-Hodgman多边形裁剪算法 对各种情况进行测试，验证算法实现的完整性 -Experiments four programming Cohen-Sutherland line clipping algorithm or Sutherland-Hodgman polygon clipping algorithms for testing a variety of situations, to ver