资源列表
pdf12
- 一种新的绘制一维,二维高斯密度函数的方法。-A new one-dimensional mapping, two-dimensional Gaussian density function method.
wave
- 这是一个改进小波变换算法,实验证实有效减少相干斑噪声-This is an improved wavelet transform algorithm, the experiment proved to be effective to reduce speckle noise
gaussian-core
- 本人初学图像处理。这是一个简单的高斯核设计源代码。-I am novice image processing. This is a simple design of the Gaussian kernel source code.
BEZIER
- 介绍如何在 VC++ 上进行BEZIER编程。 BEZIER绘图的一般过程可以看作这样的,先用 BEZIER语句在 BEZIER的绘图环境 , 然后把图传给操作系统的绘图环境 DeviceContext (DC)中,实实在在地画出到屏幕上. -Describes how VC++ on BEZIER program. BEZIER drawing general process can be viewed as such, first BEZIER statement BEZIER drawin
wavelet_denoising3_19
- 这是利用二维小波变化对图像进行消噪的例程,图像所含噪声主要是白噪声,主要集中在高频部分,程序给予了实现-Routine changes in the two-dimensional wavelet image denoising, image noise is mainly contained in the white noise is mainly concentrated in the high frequency part of the program given to the reali
GUIgamut
- 最终创建一个界面,通过这个界面设置有两个下来 菜单,可以打开图像,可以选择色域映射的算法,来判断超出色域的颜色在图像呈现。-the main goal is to check the special region of one image which some colors are out of gamut of the output device .
RightTriangle
- 判断三个点是否能够构成直角三角形 1.无法构成三角形,即三点共线 输出They are in a line 2.可以构成三角形,但不是直角三角形,输出no 3.可以构成直角三角形,输出yes-Can be configured to determine whether the three points right triangle 1. can not form a triangle, that is collinear output They are in a line 2
LodDistance_n3
- Log Distance n=3 code for large scale transmission
opengldraw
- 自己写的opengl8点画圆 完全按参考书方法,给初学者参考-Write your own opengl8 Point Circle in strict accordance with reference method, for advanced users
fishe
- 聚类分析 用于模式识别 可以在MATLAB上实现其编程-Clustering analysis is used to pattern recognition can achieve its programming on in MATLAB
syn9_2
- 评估圆形度、椭圆短长轴比、图斑与外接矩形面积比、等面积圆周长与图斑周长比、凸包周长与图斑周长比等5个形状特征,选出用于对灰度图像G形状分割时的最佳指标组合。-Assessment roundness, oval short major axis ratio of the circumscribed rectangular polygon area ratio, etc. polygon area and perimeter circumference ratio, convex hull sha
Untitled
- 对l 100,计算x(n)的m点DFT,其中m为64的整数倍-L 100, calculation of x (n) m point DFT, 64 m for integer times
