SRM-torqueplot

Decompose image into subbands, denoise, and recompose again. fh = decomp_reconst(im,Nsc,Nor,block,noise,parent,covariance,optim,sig) covariance: are we considering covariance or just variance? optim: for choosing between BLS-GSM (optim = 1) and MAP-GSM (optim = 0) sig: standard deviation (scalar for uniform noise or matrix for spatially varying noise) Version using the Full steerable pyramid (2) (High pass residual splitted into orientations). JPM, Univ. de Granada, 5/02 Last Revision: 11/04

说明：  introduction to matlab

《MATLAB数学手册》电子书详细讲解matlab中矩阵及其运算、数值计算与数据分析、符号运算、概率统计、优化问题、模糊逻辑、绘图与图形处理，欢迎下载("MATLAB Mathematics Handbook" this book explain in detail in matlab matrix and its computation, numerical computation and data analysis, symbolic computation, probability and statistics, optimization, fuzzy logic, graphics and image processing, welcome to download)

在RGB、HSV、YCBCR空间提取得到了高质量的印章，算法鲁棒性很强。(the seal is well recognized in the space of RGB、HSV and YCBCR,and the method is robust.)

现成的——leach协议剩余节点和时间关系的awk脚本(Ready-made- leach agreement between the remaining nodes and the time awk script)

基于MATLAB的46个实用程序 本人已经试验过 全部成功 希望对大家有用(46 utility based on MATLAB I have tested all the success the hope that useful)

EM-Based Adaptive Frequency Domain Estimation of Doppler Shifts with CRLB Analysis for CDMA Systems

mantle json to model

自己写的一个OFDM发送接收的程序，注释详尽，适合初学者，有图形验证。可实现IFFT过采样，以及prefix(Writing their own to send an OFDM reception process, detailed notes, suitable for beginners, there is graphical verification. Can achieve over-sampling IFFT and prefix)

用镜像矩阵求出矩阵的QR分解（正交三角分解），并求解线性方程组，该方法不必选主元，但其计算过程非常稳定。也可用于求矩阵的广义逆和求解线性最小二乘问题。子过程QRDCMP用镜像矩阵求m*n矩阵A的QR分解，A=Q^TR,其中Q是m*m正交矩阵，R为m*n上三角矩阵；子过程QRBKSB用矩阵的QR分解求解线性方程组Ax=b，其中A为n阶非奇异方阵。(Matrix obtained with the mirror matrix QR decomposition (orthogonal triangular decomposition), and solving linear equations, the method does not have to choose the main element, but its calculation process is very stable. Can also be used to find the generalized inverse matrix and solving linear least squares problems. Sub-process of the mirror matrix QRDCMP m* n matrix A QR decomposition, A = Q ^ TR, wherein Q is a m* m orthogonal matrix, R is m* n upper triangular matrix subprocess QRBKSB a QR decomposition to solve the matrix linear equations Ax = b, where A is non-singular square matrix of order n.)