基于MATLAB的MMSE算法估计

禁忌搜索算法+蚁群算法，两种算法的融合解决矩形排样

这是一篇关于大气湍流退化图像复原的硕士论文，我用matlab对该论文中阐述的方法进行了仿真

自学是门手艺(整理)-源自GitHub李笑来,在GitHub上阅读感觉不是很方便,所以整理成了PDF文件,可以打印下载,整理时间(2019-4-1),如果不想花费积分,也可以自行去GitHub上观看,学习

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

此matlab代码是parzen窗非参数估计概率密度函数的，以及parzen窗做分类器

对应22239-2008信息系统安全等级保护基本要求（1级、2级、3级）,汇总为一张思维导图展示

自己整理的Axure元件库 方便快速画WEB原型 其中的动画效果都有，直接运行就可查看自己需要的原型内容 集合了很多资源的整合版

盈建科地震波库

matlab与VREP通信控制四轮小车到达指定位置，matlab控制小车实现转向、调速、调偏差，里面含有VERP建立四轮小车的模型

基于小波变换的静态图像数字水印matlab的实现最低有效位方法(LSB) ：这是一种典型的空间域数据隐藏算法，L. F. Tumer 与R. G. Van Schyadel等先后利用此方法将特定的标记隐藏于数字音频和数字图像内。该方法是利用原始数据的最低几位来隐藏信息。LSB 方法的优点是有较大的信息隐藏量，但采用此方法实现的数字水印是很脆弱的，无法经受一些无损和有损的信息处理，而且如果确切地知道水印隐藏在几位LSB中，数字水印很容易被擦除或绕过。