ofdm

root finding by false position

Radius Basic Function 神经网络的预测程序(Radius Basic Function neural network prediction program)

可以读取yuv文件，输入文件夹名字、图像尺寸、帧数等，为处理yuv文件的前提(Input: filename- YUV sequence file dims- dimensions of the frame [width height] numfrm- number of frames to read startfrm- [optional, default = 0] specifies from which frame to start reading with the convention that the first frame of the sequence is 0- numbered)

Face Detection and Tracking Detect a Face

基于矩阵特征向量分解的高分辨阵列测向技术(Based on the feature vector matrix decomposition of finding high-resolution array technology)

用OpenCV实现的Matlab中形态学细化、提取骨架、收缩算法。测试效果与Matlab相同。(Algorithms of morphological thinning,Skeleton and Shrink,ported from Matlab to OpenCV.)

语音增强之谱相减算法，加窗分帧频域处理，计算信噪比及画出波形对比。(Spectral subtraction speech enhancement algorithm, window-frame frequency domain processing to calculate the signal-to-noise ratio and draw the waveform comparison.)

function [L,C] = kmeans(X,k) KMEANS Cluster multivariate data using the k-means++ algorithm. [L,C] = kmeans(X,k) produces a 1-by-size(X,2) vector L with one class label per column in X and a size(X,1)-by-k matrix C containing the centers corresponding to each class. Version: 07/08/11 Authors: Laurent Sorber (Laurent.Sorber@cs.kuleuven.be) References: [1] J. B. MacQueen, "Some Methods for Classification and Analysis of MultiVariate Observations", in Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, L. M. L. Cam and J. Neyman, eds., vol. 1, UC Press, 1967, pp. 281-297. [2] D. Arthur and S. Vassilvitskii, "k-means++: The Advantages of Careful Seeding", Technical Report 2006-13, Stanford InfoLab, 2006.

介绍压缩采样新技术的优点，将其应用于阵列信号的处理中(Describes the advantages of sampling new compression technologies, the treatment applied to the array signals)

时隙ALOHA协议是对ALOHA协议的简单修改，把传输时间分为一个个时隙，数据包只能在时隙的开始进行并行传输。在当前的时隙中产生的数据包只能在下一个时隙的开始进行并行传输。(Time slot ALOHA protocol is simple modification of ALOHA protocol, the transmission time is divided into a time slot, packets can only be the beginning of time slot for parallel transmission. In the current time slot of packets can only be the beginning of the next time slot for parallel transmission. )