图像修复cdd程序

计算矩阵各列与其他各列的互相关系数，并按照概率分布利用直方图的形式展示出来。该互相关系数的定义参考Michael Elad的《Sparse and Redundant Representations》p25 Definition2.3

字符识别matlab源代码，可运行，可以准确识别英文字母和数字。

gps 读取卫星星历文件计算卫星位置 gps 读取卫星星历文件计算卫星位置

【实例简介】基于ARM9+NRF24L01+OV7620图片传输，图片采集格式为rgb raw格式，经过转换为rgb565格式，并在4.3LCD上显示。包括nrf24l01 linux下驱动,linux版本为2.6.13，其他版本的话，可以修改下头文件的位置 OV7620是接在Atmega16单片机上的。http://blog.csdn.net/hwwr112100

【实例简介】本文基于最优线性二次型理论研究了带外部干扰的多智能体系统的最优控制问题. 首先在不考虑干扰的情况下，通过分析性能指标函数求得了最优的分布式控制协议. 然后假设系统存在外部干扰，采用DOBC的方法来估计实际扰动，在控制协议中增加干扰补偿项来消除干扰的影响. 接下来，将上述复合式控制协议设计为带有最小采样粒度的事件触发机制，运用现代控制理论和矩阵论等工具分析了多智能体算法，得到了分布式的事件触发条件. 最后，通过计算机仿真验证了本文所提算法的有效性.

一个小的均值漂移算法的MATLAB程序，供大家参考一下

跌倒检测器源码，利用加速度传感器，陀螺仪和地磁传感器实现跌倒检测

【实例简介】西交大王兆安教授的电力电子技术课件，第五版，有的资源第六章是空白，这里补充完整了。

OFDM调制解调程序 MATLAB源代码 详细注释

alternating direction method of multipliers优化算法讲解OutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsDual decompositionDual problemp convex equality constrained optimization problemminimizesubject to Ax= 6e Lagrangian: L(a, g)=f(a)+y(Ac-bdual function: g(y)=infx L(, g)e dual problem: maximize g(g)recover x*=argminL(, y*)Dual decompositionDual ascentgradient method for dual problem: y+l=yk +aVg(yky ")=A c-b, where a= argmin L(a, y")b dual ascent method isk+1gminz L(a, yk/-minimization(Axk+I-b)// dual updateworks, with lots of strong assumptionsDual decompositionDual decompositione suppose f is separablef(x)=f1(x1)+…+fN(xN),x=(x1Nthen L is separable in x: L(a, y)=L1(a1, 3)+...+Ln(N, 3)-y bLi(ai, y)=fi(ai)+y Aiaie -minimization in dual ascent splits into N separate minimizationsk+1argmin Li(li, y)Which can be carried out in parallelDual decompositionDual decompositiondual decomposition(Everett, Dantzig, Wolfe, Benders 1960-65k+1argLi(ei, y)N A: k+scatterupdate i in parallel, gather Ai k+solve a large problemby iteratively solving subproblems(in parallel)dual variable update provides coordinationworks, with lots of assumptions; often slowDual decompositionOutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsMethod of multipliersMethod of multipliersa method to robustify dual ascentb use augmented Lagrangian(Hestenes, Powell 1969),p>0(, y)=f(c)+y(Ax-b)+(p/2)Acmethod of multipliers( Hestenes, Powell; analysis in Bertsekas 1982)k+1argmin Lp(a, yD(A.(note specific dual update step length pMethod of multipliersMethod of multipliers dual update stepoptimality conditions( for differentiableAcx-b=0, Vf(a*)+A(primal and dual feasibility)Since ah+1minimizes Lp(a, y)k+1 kf(x4+1)+A7(y+p(AVxf(at)+adual update yti=y+p(k+1k+1dual feasibleprimal feasibility achieved in limit: A k+I-b>0Method of multipliers