K-SVD 源代码
K-SVD是一种经典的字典训练算法,依据误差最小原则,对误差项进行SVD分解,选择使误差最小的分解项作为更新的字典原子和对应的原子系数,经过不断的迭代从而得到优化的解。
1. compile: mpicc svd.c -o svd -lm 2. run: mpirun -np 4 svd 3. result: Input of file "dataIn.txt" 4 4 1.000000 …
1. compile: mpicc svd.c -o svd -lm 2. run: mpirun -np 4 svd 3. result: Input of file "dataIn.txt" 4 4 1.000000 …
1. compile: mpicc svd.c -o svd -lm 2. run: mpirun -np 4 svd 3. result: Input of file "dataIn.txt" 4 4 1.000000 …
function svd_mud() %2005.12.13 load r; for i=1:1000 [U,S,V] = svd(r(:,i));
function svd_mud() %2005.12.13 load r; for i=1:1000 [U,S,V] = svd(r(:,i));
function [w A p]=ComputeW_D(C,s12,s13) for i=1:3 Ci=C{i}; a{i}=Ci(1,1); b{i}=Ci(1,2); c{i}=Ci(2,2); …
1. compile: mpicc svd.c -o svd -lm 2. run: mpirun -np 4 svd 3. result: Input of file "dataIn.txt" 4 4 1.000000 …
#include main() { int b[6],k=2520/6,j,m,x,y,p=0; y=x=k-k/2; for(m=0,j=7;m