资源列表
adaptive_anisotropic_2D_gaussian_filter
- Gaussian filtering in one, two or three dimensions is among the most commonly needed tasks in signal and image processing. Finite impulse response filters in the time domain with Gaussian masks are easy to implement in either floating or fixe
plot_s_M
- 用于根据耦合矩阵绘制S曲线，用不同的颜色线条区分-For the S-curve is drawn according to the coupling matrix to distinguish between using a different color lines
video2
- opencv的运用，在初学的可以参考，对视频和摄像头的调用-opencv the use of the beginner' s to refer to the video and camera calls
Example11_2
- 是一个使用鼠标自由画图的例子。当拖动鼠标时，无论拖动多快，都可以画出很流畅的连线。-Paint is a free example of using the mouse. When dragging the mouse, regardless of how quickly drag, can draw a very smooth connection.
Untitled3
- The purpose of this chapter is to familiarize the reader with the basic propagation characteristics that describe various wireless communication channels, such as terrestrial, atmospheric, and ionospheric for VHF to the X-band. Well-known stand
hsvfeature1
- 基于matlab颜色特征图像检索的颜色特征的提取-Matlab color feature based on the color image retrieval feature extraction
m1
- 用边缘检测算法检测的圆的像的边缘点，并用多元线性回归求出椭圆的方程，然后按照我们的模型中提供的方法，求出每个圆心的像的位置-Using edge detection algorithm to detect the edge of the image circle points, and multiple linear regression equation of the ellipse obtained, and then follow the model provided by our met
New-Text-Document-(4)
- 通过定义曲面和均匀网格绘制一个具有光照和明暗处理效果的Bezier曲面（图1）的部分主要代码： -Bezier
A-new-adaptive-median-filter
- 一种新的自适应中值滤波方法。将3 x3窗口中心的极值点作为候选噪声点，若候选噪声点仍然是7 x7窗口的极值点，则该点即是噪声点。若以噪声点为中心的3 x3滤波窗口的中值不是噪声，则噪声用中值替换。重复以上过程，直到没有噪声点被替换。如果图像中仍然存在人的噪声团块，则噪声用相邻的三个信号点的灰度均值替换。实验结果表明，该方法能够有效去除脉冲噪声，并在抑制噪声的同时很好地保护图像的细节。-A new adaptive median filter. The extreme points of the
whiten-noise
- 白化噪声 使得高斯华 对于非高斯的信号有显著的应用 值得一看-whiten noise
4.17-Kalman-Filter-Three-Dimention
- 最经典的三维的卡尔曼滤波算法 MATLAB代码 含注释说明-MATLAB Code of Kalman Filtering
D2FFT
- 二维傅里叶变换，是求解3D图像中重要图像处理步骤，也可转到一维之后再按照一维的规则进行编码-After the two-dimensional Fourier transform, the 3D image is to solve an important image processing step can also go further in accordance with a one-dimensional one-dimensional coding rules