plateform stringclasses 1
value | repo_name stringlengths 13 113 | name stringlengths 3 74 | ext stringclasses 1
value | path stringlengths 12 229 | size int64 23 843k | source_encoding stringclasses 9
values | md5 stringlengths 32 32 | text stringlengths 23 843k |
|---|---|---|---|---|---|---|---|---|
github | noureldien/RecommenderSystem-master | sqlpu2lblk.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlpu2lblk.m | 3,099 | utf_8 | 1a67e45c349d19614e890521aed11db5 | %%***************************************************************************
%% sqlpu2lblk: decide whether to convert ublk to lblk
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 10 Jul 2007
%%*********************************************************************... |
github | noureldien/RecommenderSystem-master | Prod3.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/Prod3.m | 1,677 | utf_8 | 2ee9f0d732e5ea1f326bfcf275b0da3c | %%************************************************************
%% Prod3: compute the entries of Q = A*B*C specified in
%% nzlistQ.
%%
%% Q = Prod3(blk,A,B,C,sym,nzlistQ)
%% Important: (a) A is assumed to be symmetric if nzlistQ
%% has 2 columns (since mexProd2nz computes A'*B).
%% (b) T... |
github | noureldien/RecommenderSystem-master | sqlptermcode.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlptermcode.m | 1,230 | utf_8 | 40b494719c3c614b6196dd9846778c4c | %%*************************************************************************
%% sqlptermcode.m: explains the termination code in sqlp.m
%%
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***************************************************************... |
github | noureldien/RecommenderSystem-master | AXfun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/AXfun.m | 1,869 | utf_8 | e816cba65d629a72167375f9a7697b2f | %%*************************************************************************
%% AXfun: compute AX(k) = <Ak,X>, k = 1:m
%%
%% AX = AXfun(blk,At,permA,X);
%%
%% Note: permA may be set to [] if no permutation is neccessary.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Mod... |
github | noureldien/RecommenderSystem-master | NTpred.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/NTpred.m | 1,963 | utf_8 | 3a2374e8ffa4806b637e50e551b9c17c | %%**********************************************************************
%% NTpred: Compute (dX,dy,dZ) for NT direction.
%%
%% compute SVD of Xchol*Zchol via eigenvalue decompostion of
%% Zchol * X * Zchol' = V * diag(sv2) * V'.
%% compute W satisfying W*Z*W = X.
%% W = G'*G, where G = diag(sqrt(sv)) * (invZch... |
github | noureldien/RecommenderSystem-master | sqlp.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlp.m | 11,506 | utf_8 | d4acdbc7a5a1c0fd270f5d3de302c545 | %%*****************************************************************************
%% sqlp: solve an semidefinite-quadratic-linear program
%% by infeasible path-following method.
%%
%% [obj,X,y,Z,info,runhist] = sqlp(blk,At,C,b,OPTIONS,X0,y0,Z0);
%%
%% Input: blk: a cell array describing the block diagonal structu... |
github | noureldien/RecommenderSystem-master | infeaspt.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/infeaspt.m | 5,422 | utf_8 | ed7ce61d1094307a576ad8ddfd42bd30 | %%********************************************************************
%% infeaspt: generate an initial point for sdp.m
%%
%% [X0,y0,Z0] = infeaspt(blk,At,C,b,options,scalefac);
%%
%% options = 1 if want X0,Z0 to be scaled identity matrices
%% = 2 if want X0,Z0 to be scalefac*(identity matrices).
%%
%% SDP... |
github | noureldien/RecommenderSystem-master | Arrow.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/Arrow.m | 933 | utf_8 | 4a1803a8a960eba5462879d0ae4cbb78 | %%********************************************************
%% Arrow:
%%
%% Fx = Arrow(pblk,f,x,options);
%%
%% if options == 0;
%% Fx = Arr(F)*x
%% if options == 1;
%% Fx = Arr(F)^{-1}*x
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%********... |
github | noureldien/RecommenderSystem-master | mybicgstab.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/mybicgstab.m | 3,536 | utf_8 | 7ae20f5d14c6533fd9a50b23a1e5c8b3 | %%*************************************************************************
%% mybicgstab
%%
%% [xx,resnrm,flag] = mybicgstab(A,b,M1,tol,maxit)
%%
%% iterate on bb - (M1)*AA*x
%%
%% r = b-A*xtrue;
%%
%%*************************************************************************
function [xx,resnrm,flag] = mybicgstab(A,b... |
github | noureldien/RecommenderSystem-master | degeneracy.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/degeneracy.m | 5,175 | utf_8 | 52287ec83b17f60c33554d7a25764672 | %%***************************************************************
%% degeneracy: determine if an SDP problem is non-degenerate.
%%
%% [ddx,ddz,B1,B2,sig1,sig12] = degeneracy(blk,At,X,y,Z);
%%
%% Assume that strict complementarity holds:
%% for primal non-degeneracy, we need rank([B1 B2]) = m
%% for dual non-degeneracy,... |
github | noureldien/RecommenderSystem-master | mytime.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/mytime.m | 557 | utf_8 | 2d076b8ed1091521bbe986194c6e2b84 | %%*********************************************
%% mytime:
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*********************************************
function [hh,mm,ss] = mytime(t)
t = round(t);
h = floor(t/3600);
m = floor(rem(t,3600)/60);
s ... |
github | noureldien/RecommenderSystem-master | validate.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/validate.m | 7,427 | utf_8 | 60774ce6b3bd16bde97e4078d89db39b | %%***********************************************************************
%% validate: validate data
%%
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***********************************************************************
function [blk,At,C,b,di... |
github | noureldien/RecommenderSystem-master | svec.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/svec.m | 2,027 | utf_8 | 43bbe7c274d2d1bfb1014fc2000f47e3 | %*********************************************************
%% svec: compute the vector svec(M),
%%
%% x = svec(blk,M,isspx);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%**********************************************************
function x = s... |
github | noureldien/RecommenderSystem-master | read_sedumi.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/read_sedumi.m | 7,265 | utf_8 | 2035885c053fc9de89cf19fa667603d2 | %%*******************************************************************
%% Read in a problem in SeDuMi format.
%%
%% [blk,A,C,b,perm] = read_sedumi(fname,b,c,K)
%%
%% Input: fname.mat = name of the file containing SDP data in
%% SeDuMi format.
%%
%% Important note: Sedumi's notation for free variab... |
github | noureldien/RecommenderSystem-master | qprod.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/qprod.m | 655 | utf_8 | 2d6550b139b2dfcf3d134f61deec3686 | %%***************************************************
%% qprod:
%%
%% Input: A = [A1 A2 ... An]
%% x = [x1; x2; ...; xn]
%% Output: [A1*x1 A2*x2 ... An*xn]
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%**************************************... |
github | noureldien/RecommenderSystem-master | nzlist.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/nzlist.m | 5,014 | utf_8 | 1225b63fe9e00df09546243f60599dc2 | %%***********************************************************************
%% nzlist: find the combined list of non-zero elements
%% of Aj, j = 1:k, for each k,
%% assuming that the Aj's are permuted such that
%% A1 has the fewest nonzero elements, followed by A2, and so on.
%%
%% [isspA,nzlistA,... |
github | noureldien/RecommenderSystem-master | detect_lblk.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/detect_lblk.m | 4,228 | utf_8 | a69e3486a171d0169d9b62b749ed6cd8 | %%*******************************************************************
%% detect_lblk: detect diagonal blocks in the SDP data.
%%
%% [blk,At,C,diagblkinfo,blockchange,parbarrier,X,Z] = ...
%% detect_lblk(blk,At,C,b,parbarrier,X,Z);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. ... |
github | noureldien/RecommenderSystem-master | gdcomp.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/gdcomp.m | 5,041 | utf_8 | 798f2741f8133bfe774e59417201fb41 | %%*********************************************************************
%% gdcomp: Compute gd = 1/td in Equation (15) of the paper:
%%
%% R.M. Freund, F. Ordonez, and K.C. Toh,
%% Behavioral measures and their correlation with IPM iteration counts
%% on semi-definite programming problems,
%% Mathematical Programm... |
github | noureldien/RecommenderSystem-master | blkbarrier.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/blkbarrier.m | 1,795 | utf_8 | 77a6eb1f1708aa69217000d27735efa0 | %%********************************************************************
%% blkbarrier: calculate
%% [-v(p)*logdet(X{p}), v(p)*logdet(Z{p}) + n*v(p)*(1-log(v(p)))]
%% [-v(p)*log(gam(X{p})), v(p)*log(gam(Z{p})) + v(p)]
%% [-v(p)*log(X{p}), v(p)*log(Z{p}) + n*v(p)*(1-log(v(p)))]
%%***********************************... |
github | noureldien/RecommenderSystem-master | sqlpmain.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlpmain.m | 29,621 | utf_8 | d052de03de9bd9acef64a9af06d356db | %%*************************************************************************
%% sqlp: main solver
%%
%%*************************************************************************
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%****************************... |
github | noureldien/RecommenderSystem-master | HKMpred.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/HKMpred.m | 2,818 | utf_8 | da0e8d9efacd9a7cebaae5ea2ad63de9 | %%*******************************************************************
%% HKMpred: Compute (dX,dy,dZ) for the H..K..M direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******************************************************************
func... |
github | noureldien/RecommenderSystem-master | read_sdpa.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/read_sdpa.m | 7,591 | utf_8 | 211ea10474df1ffe50a0c5456e1cbe41 | %%*******************************************************************
%% Read in a problem in SDPA sparse format.
%%
%% [blk,At,C,b] = read_sdpa(fname)
%%
%% Input: fname = name of the file containing SDP data in
%% SDPA foramt.
%% Important: the data is assumed to contain only
%% semide... |
github | noureldien/RecommenderSystem-master | sortA.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sortA.m | 2,639 | utf_8 | c998ea7df87432b78f6c001d0bbc5318 | %%*********************************************************************
%% sortA: sort columns of At{p} in ascending order according to the
%% number of nonzero elements.
%%
%% [At,C,b,X0,Z0,permA,permZ] = sortA(blk,At,C,b,X0,Z0);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tut... |
github | noureldien/RecommenderSystem-master | blkeig.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/blkeig.m | 2,412 | utf_8 | 97da97f8165585de45eae52a86e0f127 | %%***************************************************************************
%% blkeig: compute eigenvalue decomposition of a cell array
%% whose contents are square matrices or the diagonal
%% of a diagonal matrix.
%%
%% [d,V] = blkeig(blk,X);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. ... |
github | noureldien/RecommenderSystem-master | HKMrhsfun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/HKMrhsfun.m | 3,358 | utf_8 | b1e6a8305128af799634b9ef7324cfeb | %%*******************************************************************
%% HKMrhsfun: compute the right-hand side vector of the
%% Schur complement equation for the HKM direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***********... |
github | noureldien/RecommenderSystem-master | linsysolve.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/linsysolve.m | 7,741 | utf_8 | 2091e9d1c0858acfd5c4e07842ed787d | %%***************************************************************
%% linsysolve: solve linear system to get dy, and direction
%% corresponding to unrestricted variables.
%%
%% [xx,coeff,L,resnrm] = linsysolve(schur,UU,Afree,EE,rhs);
%%
%% child functions: symqmr.m, mybicgstable.m, linsysolvefun.m
%%
%% SDPT... |
github | noureldien/RecommenderSystem-master | schurmat_qblk.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/schurmat_qblk.m | 3,205 | utf_8 | d154ddca57828c83c43efd37fbe64829 | %%*******************************************************************
%% schurmat_qblk: compute schur matrix corresponding to SOCP blocks.
%%
%% HKM direction: output = schur + Ax*Ae' + Ae*Ax' - Ad*Ad'
%% NT direction: output = schur + Ae*Ae' - Ad*Ad'
%%
%% where schur = A*D*A', and Ad is the modification to ADA'
%% s... |
github | noureldien/RecommenderSystem-master | ops.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/ops.m | 11,548 | utf_8 | 0931c97ce9eb7f01a28fac581153ca1c | %%******************************************************************
%% ops:
%%
%% Z = ops(X,operand,Y,alpha);
%%
%% INPUT: X = a matrix or a scalar
%% or a CELL ARRAY consisting only of matrices
%% operand = sym, transpose, triu, tril,
%% real, imag, sqrt, abs, ... |
github | noureldien/RecommenderSystem-master | schurmat_lblk.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/schurmat_lblk.m | 1,010 | utf_8 | 11b66919604e457c631f5ed67225fc45 | %%*******************************************************************
%% schurmat_lblk: compute A*D*A'
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******************************************************************
function [schur,UU,EE] = schu... |
github | noureldien/RecommenderSystem-master | sqlpmisc.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlpmisc.m | 4,078 | utf_8 | 1dc032b6e1fd72eb26f2f3e519a746dd | %%*****************************************************************************
%% sqlpmisc:
%% unscale and produce infeasibility certificates if appropriate
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004.
%%******************************************... |
github | noureldien/RecommenderSystem-master | checkdense.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/checkdense.m | 730 | utf_8 | 6d44b41643ef16f78b42927e1fc03dd8 | %%********************************************************************
%% checkdense : identify the dense columns of a matrix
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%********************************************************************
funct... |
github | noureldien/RecommenderSystem-master | NTrhsfun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/NTrhsfun.m | 4,253 | utf_8 | 51c74223afc232c456def8488b51aa3f | %%*******************************************************************
%% NTrhsfun: compute the right-hand side vector of the
%% Schur complement equation for the NT direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***************... |
github | noureldien/RecommenderSystem-master | SDPvalBounds.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/SDPvalBounds.m | 1,843 | utf_8 | fa3af856805cc15685c38e69218a8ffb | %%*****************************************************************
%% compute lower and upper bounds for the exact primal
%% optimal value.
%%
%% LB <= true optimal dual value = true optimal primal value <= UB.
%%
%%*****************************************************************
function [LB,UB] = SDPvalBo... |
github | noureldien/RecommenderSystem-master | NTscaling.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/NTscaling.m | 1,847 | utf_8 | 82a266e8bf9cf33993f0bff10650c15c | %%**********************************************************************
%% NTscaling: Compute NT scaling matrix
%%
%% compute SVD of Xchol*Zchol via eigenvalue decompostion of
%% Zchol * X * Zchol' = V * diag(sv2) * V'.
%% compute W satisfying W*Z*W = X.
%% W = G'*G, where G = diag(sqrt(sv)) * (invZchol*V)'
%... |
github | noureldien/RecommenderSystem-master | linsysolvefun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/linsysolvefun.m | 1,276 | utf_8 | 7ca4a2896ad33a210a95d53138f0676f | %%*************************************************************************
%% linsysolvefun: Solve H*x = b
%%
%% x = linsysolvefun(L,b)
%% where L contains the triangular factors of H.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***************... |
github | noureldien/RecommenderSystem-master | sqlpdemo.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlpdemo.m | 6,011 | utf_8 | 793deabad8688259781993ce346cea24 | %%*****************************************************************
%% Examples of SQLP.
%%
%% this is an illustration on how to use our SQLP solvers
%% coded in sqlp.m
%%
%% feas = 1 if want feasible initial iterate
%% = 0 otherwise
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tu... |
github | noureldien/RecommenderSystem-master | gpcomp.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/gpcomp.m | 5,268 | utf_8 | 0e3f81e97b731bf8646b4ffd7e894f03 | %%*********************************************************************
%% gpcomp: Compute tp=1/gp in Proposition 2 of the paper:
%%
%% R.M. Freund, F. Ordonez, and K.C. Toh,
%% Behavioral measures and their correlation with IPM iteration counts
%% on semi-definite programming problems,
%% Mathematical Programmin... |
github | noureldien/RecommenderSystem-master | sqlparameters.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlparameters.m | 5,137 | utf_8 | 76bbd09e284250f7770836baabcc95e5 | %%*************************************************************************
%% parameters.m: set OPTIONS structure to specify default
%% parameters for sqlp.m
%%
%% OPTIONS.vers : version of direction to use.
%% 1 for HKM direction
%% 2 for NT direction
%... |
github | noureldien/RecommenderSystem-master | convertcmpsdp.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/convertcmpsdp.m | 3,465 | utf_8 | 6bd9a62cfb0249da5d75665cfb26063b | %%*********************************************************
%% convertcmpsdp: convert SDP with complex data into one
%% with real data by converting
%%
%% C - sum_{k=1}^m yk*Ak psd
%% to
%% [CR,-CI] - sum ykR*[AkR,-AkI] psd
%% [CI, CR] [AkI, AkR]
%%
%% ykI = 0 for k = 1:m
%%
%% [bblk,AAt,C... |
github | noureldien/RecommenderSystem-master | sqlpsummary.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlpsummary.m | 4,047 | utf_8 | 78361a4e3dfeaeb73a7102b08ad30733 | %%*****************************************************************************
%% sqlpsummary: print summary
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*****************************************************************************
function sq... |
github | noureldien/RecommenderSystem-master | checkdepconstr.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/checkdepconstr.m | 6,926 | utf_8 | 186362786fef9d7d3328ab9e5a9e117c | %%*****************************************************************************
%% checkdepconst: compute AAt to determine if the
%% constraint matrices Ak are linearly independent.
%%
%% [At,b,y,idxB,neardepconstr,feasible,AAt] = checkdepconstr(blk,At,b,y,rmdepconstr);
%%
%% rmdepconstr = 1, if want to rem... |
github | noureldien/RecommenderSystem-master | convertRcone.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/convertRcone.m | 948 | utf_8 | afa3b210699dbf796a257cb53e92ef0d | %%***************************************************************
%% convertRcone: convert rotated cone to socp cone
%%
%% [blk,At,C,b,T] = convertRcone(blk,At,C,b);
%%
%%***************************************************************
function [blk,At,C,b,T] = convertRcone(blk,At,C,b)
T = cell(size(blk,1),1);
for p =... |
github | noureldien/RecommenderSystem-master | qops.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/qops.m | 1,421 | utf_8 | bddd4e93643ef0eb5b6868ef41d2bec7 | %%********************************************************
%% qops: Fu = qops(pblk,w,f,options,u);
%%
%% options = 1, Fu(i) = <wi,fi>
%% = 2, Fu(i) = 2*wi(1)*fi(1)-<wi,fi>
%% = 3, Fui = w(i)*fi
%% = 4, Fui = w(i)*fi, Fui(1) = -Fui(1).
%% options = 5, Fu = w [ f'*u ; ub + fb*alp ], where
%% ... |
github | noureldien/RecommenderSystem-master | HKMdirfun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/HKMdirfun.m | 1,703 | utf_8 | 2e90b8de8daed6f5a9a6894232dbff6a | %%*******************************************************************
%% HKMdirfun: compute (dX,dZ), given dy, for the HKM direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******************************************************************... |
github | noureldien/RecommenderSystem-master | symqmr.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/symqmr.m | 3,957 | utf_8 | bf28cb72305cb0378a7b572d42f39ff6 | %%*************************************************************************
%% symqmr: symmetric QMR with left (symmetric) preconditioner.
%% The preconditioner used is based on the analytical
%% expression of inv(A).
%%
%% [x,resnrm,solve_ok] = symqmr(A,b,L,tol,maxit)
%%
%% child function: linsysolvefu... |
github | noureldien/RecommenderSystem-master | validate_startpoint.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/validate_startpoint.m | 3,067 | utf_8 | 572146bf8639c3d5066b6a790bca3ba8 | %%***********************************************************************
%% validate_startpoint: validate_startpoint starting point X0,y0,Z0
%%
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%********************************************************... |
github | noureldien/RecommenderSystem-master | Atyfun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/Atyfun.m | 1,471 | utf_8 | 5af173811d5528ab49ca2a48bd4748ce | %%*********************************************************
%% Atyfun: compute sum_{k=1}^m yk*Ak.
%%
%% Q = Atyfun(blk,At,permA,isspAy,y);
%%
%% Note: permA and isspAy may be set to [].
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%**************... |
github | noureldien/RecommenderSystem-master | blkcholfun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/blkcholfun.m | 1,247 | utf_8 | 6d78842d748fad818d79a003e1238916 | %%******************************************************************
%% blkcholfun: compute Cholesky factorization of X.
%%
%% [Xchol,indef] = blkcholfun(blk,X,permX);
%%
%% X = Xchol'*Xchol;
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******... |
github | noureldien/RecommenderSystem-master | smat.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/smat.m | 880 | utf_8 | 184f4081013cebeae6150a22b224ebf9 | %%*********************************************************
%% smat: compute the matrix smat(x).
%%
%% M = smat(blk,x,isspM);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%**********************************************************
function M = ... |
github | noureldien/RecommenderSystem-master | sqlpcheckconvg.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/sqlpcheckconvg.m | 8,298 | utf_8 | 6acb41aefb05d5a53dbd501dabab2b33 | %%*****************************************************************************
%% sqlpcheckconvg: check convergence.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*****************************************************************************
func... |
github | noureldien/RecommenderSystem-master | SDPT3soln_SEDUMIsoln.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/SDPT3soln_SEDUMIsoln.m | 2,743 | utf_8 | 1f7236a38116d782e7084afc40e90a10 | %%**********************************************************
%% SDPT3soln_SEDUMIsoln: convert SQLP solution in SDPT3 format to
%% SeDuMi format
%%
%% [xx,yy,zz] = SDPT3soln_SEDUMIsoln(blk,X,y,Z,perm);
%%
%% usage: load SEDUMI_data_file (containing say, A,b,c,K)
%% [blk,At,C,b,perm] = read_s... |
github | noureldien/RecommenderSystem-master | detect_ublk.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/detect_ublk.m | 2,815 | utf_8 | 819f087d73a97e1717b952ca2f3a407d | %%*******************************************************************
%% detect_ublk: search for implied free variables in linear
%% block.
%% [blk2,At2,C2,ublkinfo] = detect_ublk(blk,At,C);
%%
%% i1,i2: indices corresponding to splitting of unrestricted varaibles
%% i3 : remaining indices in the linear ... |
github | noureldien/RecommenderSystem-master | combine_blk.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/combine_blk.m | 2,358 | utf_8 | 205279faec8f7b11c04bc75707a6eb77 | %%*******************************************************************
%% combine_blk: combine small SDP blocks together,
%% combine all SOCP blocks together, etc
%%
%% [blk2,At2,C2,blkinfo] = combine_blk(blk,At,C);
%%
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%%... |
github | noureldien/RecommenderSystem-master | Prod2.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/Prod2.m | 1,882 | utf_8 | b291dcf07608872ed75bd82e48ff0b54 | %%*******************************************************************
%% Prod2: compute the block diagonal matrix A*B
%%
%% C = Prod2(blk,A,B,options);
%%
%% INPUT: blk = a cell array describing the block structure of A and B
%% A,B = square matrices or column vectors.
%%
%% options = 0 if no special str... |
github | noureldien/RecommenderSystem-master | NTdirfun.m | .m | RecommenderSystem-master/cvx/sdpt3/Solver/NTdirfun.m | 1,614 | utf_8 | a236e4d45e59db8824375b14ed6090a1 | %%*******************************************************************
%% NTdirfun: compute (dX,dZ), given dy, for the NT direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******************************************************************
... |
github | noureldien/RecommenderSystem-master | make.m | .m | RecommenderSystem-master/cvx/examples/make.m | 23,756 | utf_8 | c82aef30a6a97533a232e958096b146f | function make( varargin )
%
% Determine the base path
%
odir = pwd;
base = mfilename('fullpath');
base = fileparts( base );
%
% Check the force and runonly flags
%
args = varargin;
is_octave = exist( 'OCTAVE_VERSION', 'builtin' );
if is_octave,
force = true;
runonly = true;
indexonly = ... |
github | noureldien/RecommenderSystem-master | cantilever_beam_plot.m | .m | RecommenderSystem-master/cvx/examples/cvxbook/Ch04_cvx_opt_probs/cantilever_beam_plot.m | 1,050 | utf_8 | e8c8c9e1b601e4102f96e0436649d132 | % Plots a cantilever beam as a 3D figure.
% This is a helper function for the optimal cantilever beam example.
%
% Inputs:
% values: an array of heights and widths of each segment
% [h1 h2 ... hN w1 w2 ... wN]
%
% Almir Mutapcic 01/25/06
function cantilever_beam_plot(values)
N = length(values)/2;
for k ... |
github | noureldien/RecommenderSystem-master | simple_step.m | .m | RecommenderSystem-master/cvx/examples/circuit_design/simple_step.m | 248 | utf_8 | ce47b4b6778bdb78f1098a2f2dc06205 | % Computes the step response of a linear system
function X = simple_step(A,B,DT,N)
n = size(A,1);
Ad = expm( full( A * DT ) );
Bd = ( Ad - eye(n) ) * B;
Bd = A \ Bd;
X = zeros(n,N);
for k = 2 : N,
X(:,k) = Ad*X(:,k-1)+Bd;
end
|
github | noureldien/RecommenderSystem-master | spectral_fact.m | .m | RecommenderSystem-master/cvx/examples/filter_design/spectral_fact.m | 1,292 | utf_8 | 014eebfa2dfbbd038c1383ff2ef97b0e | % Spectral factorization using Kolmogorov 1939 approach.
% (code follows pp. 232-233, Signal Analysis, by A. Papoulis)
%
% Computes the minimum-phase impulse response which satisfies
% given auto-correlation.
%
% Input:
% r: top-half of the auto-correlation coefficients
% starts from 0th element to end of the au... |
github | noureldien/RecommenderSystem-master | polar_plot_ant.m | .m | RecommenderSystem-master/cvx/examples/antenna_array_design/polar_plot_ant.m | 1,149 | utf_8 | 34a08a3bc75c474d61e01ea58b16e54e | % Plot a polar plot of an antenna array sensitivity
% with lines denoting the target direction and beamwidth.
% This is a helper function used in the broadband antenna examples.
%
% Inputs:
% X: an array of abs(y(theta)) where y is the antenna array pattern
% theta0: target direction
% bw: total beamw... |
github | noureldien/RecommenderSystem-master | spectral_fact.m | .m | RecommenderSystem-master/cvx/examples/antenna_array_design/spectral_fact.m | 1,385 | utf_8 | 570e7ae2165d19abd477494c52e609f8 | % Spectral factorization using Kolmogorov 1939 approach
% (code follows pp. 232-233, Signal Analysis, by A. Papoulis)
%
% Computes the minimum-phase impulse response which satisfies
% given auto-correlation.
%
% Input:
% r: top-half of the auto-correlation coefficients
% starts from 0th element to end of the aut... |
github | noureldien/RecommenderSystem-master | plotgraph.m | .m | RecommenderSystem-master/cvx/examples/graph_laplacian/plotgraph.m | 3,172 | utf_8 | a46b1d761798c492e96a5b9504aea9aa | function plotgraph(A,xy,weights)
% Plots a graph with each edge width proportional to its weight.
%
% Edges with positive weights are drawn in blue; negative weights in red.
%
% Input parameters:
% A --- incidence matrix of the graph (size is n x m)
% (n is the number of nodes and m is the number of e... |
github | noureldien/RecommenderSystem-master | disp.m | .m | RecommenderSystem-master/cvx/lib/@cvxprob/disp.m | 5,405 | utf_8 | 308868023e62c32fac37cc6621ed8af5 | function disp( prob, prefix )
if nargin < 2, prefix = ''; end
global cvx___
p = cvx___.problems( prob.index_ );
if isempty( p.variables ),
nvars = 0;
else
nvars = length( fieldnames( p.variables ) );
end
if isempty( p.duals ),
nduls = 0;
else
nduls = length( fieldnames( p.duals ) );
end
neqns = ( len... |
github | noureldien/RecommenderSystem-master | apply.m | .m | RecommenderSystem-master/cvx/lib/@cvxtuple/apply.m | 505 | utf_8 | b8d18946eb97e640bab87ef5e3256e8c | function y = apply( func, x )
y = do_apply( func, x.value_ );
function y = do_apply( func, x )
switch class( x ),
case 'struct',
y = cell2struct( do_apply( func, struct2cell( x ) ), fieldnames( x ), 1 );
case 'cell',
y = cellfun( func, x, 'UniformOutput', false );
otherwise,
y = fev... |
github | noureldien/RecommenderSystem-master | cvx_setdual.m | .m | RecommenderSystem-master/cvx/lib/@cvxtuple/cvx_setdual.m | 954 | utf_8 | f7aebcdf404f92b69aeb57a379454249 | function x = setdual( x, y )
x.dual_ = y;
x.value_ = do_setdual( x.value_, y );
function x = do_setdual( x, y )
switch class( x ),
case 'struct',
nx = numel( x );
if nx > 1,
error( 'Dual variables may not be attached to struct arrays.' );
end
f = fieldnames(x);
y... |
github | noureldien/RecommenderSystem-master | testall.m | .m | RecommenderSystem-master/cvx/lib/@cvxtuple/testall.m | 452 | utf_8 | a576b02def941cd1a47e7117b3e8bf82 | function y = testall( func, x )
y = do_test( func, x.value_ );
function y = do_test( func, x )
switch class( x ),
case 'struct',
y = do_test( func, struct2cell( x ) );
case 'cell',
y = all( cellfun( func, x ) );
otherwise,
y = feval( func, x );
end
% Copyright 2005-2014 CVX Researc... |
github | noureldien/RecommenderSystem-master | disp.m | .m | RecommenderSystem-master/cvx/lib/@cvxtuple/disp.m | 1,366 | utf_8 | 3a4d5bcb53c9621413fb3d692ab7e328 | function disp( x, prefix )
if nargin < 2,
prefix = '';
end
disp( [ prefix, 'cvx tuple object: ' ] );
prefix = [ prefix, ' ' ];
do_disp( x.value_, {}, prefix, prefix, '' );
if ~isempty( x.dual_ ),
dn = cvx_subs2str( x.dual_ );
disp( [ prefix, 'dual variable: ', dn(2:end) ] );
end
function do_disp( x, f, f... |
github | noureldien/RecommenderSystem-master | sparsify.m | .m | RecommenderSystem-master/cvx/lib/@cvx/sparsify.m | 4,193 | utf_8 | 1554241e0afa377229282abbd78c22ba | function x = sparsify( x, mode )
global cvx___
error( nargchk( 2, 2, nargin ) );
persistent remap
%
% Check mode argument
%
if ~ischar( mode ) || size( mode, 1 ) ~= 1,
error( 'Second arugment must be a string.' );
end
isobj = strcmp( mode, 'objective' );
pr = cvx___.problems( end );
touch( pr.se... |
github | noureldien/RecommenderSystem-master | prelp.m | .m | RecommenderSystem-master/cvx/sedumi/conversion/prelp.m | 3,887 | utf_8 | 4d1e23d094e3f1b35ec666df11a34003 | % PRELP Loads and preprocesses LP from an MPS file.
%
% > [A,b,c,lenx,lbounds] = PRELP('problemname')
% The above command results in an LP in standard form,
% - Instead of specifying the problemname, you can also use PRELP([]), to
% get the problem from the file /tmp/default.mat.
% - Also, you may type PRE... |
github | noureldien/RecommenderSystem-master | feasreal.m | .m | RecommenderSystem-master/cvx/sedumi/conversion/feasreal.m | 4,144 | utf_8 | 454dcb6c42c0642ed5c5a524e84bec58 | % FEASREAL Generates a random sparse optimization problem with
% linear, quadratic and semi-definite constraints. Output
% can be used by SEDUMI. All data will be real-valued.
%
% The following two lines are typical:
% > [AT,B,C,K] = FEASREAL;
% > [X,Y,INFO] = SEDUMI(AT,B,C,K);
%
% An extended version is:
% > [... |
github | noureldien/RecommenderSystem-master | sdpa2vec.m | .m | RecommenderSystem-master/cvx/sedumi/conversion/sdpa2vec.m | 2,352 | utf_8 | f055b4df357f6cf3b426ce27869bc738 | % x = sdpavec(E,K)
% Takes an SDPA type sparse data description E, i.e.
% E(1,:) = block, E(2,:) = row, E(3,:) = column, E(4,:) = entry,
% and transforms it into a "long" vector, with vectorized matrices for
% each block stacked under each other. The size of each matrix block
% is given in the field K.s.
% **********... |
github | noureldien/RecommenderSystem-master | blk2vec.m | .m | RecommenderSystem-master/cvx/sedumi/conversion/blk2vec.m | 1,653 | utf_8 | 0d48b96f66e746fce480e7a3e9c271a5 | % x = blk2vec(X,nL)
%
% Converts a block diagonal matrix into a vector.
%
% ********** INTERNAL FUNCTION OF FROMPACK **********
function x = blk2vec(X,nL)
%
% This file is part of SeDuMi 1.1 by Imre Polik and Oleksandr Romanko
% Copyright (C) 2005 McMaster University, Hamilton, CANADA (since 1.1)
%
% Copyright (C)... |
github | noureldien/RecommenderSystem-master | writesdp.m | .m | RecommenderSystem-master/cvx/sedumi/conversion/writesdp.m | 4,708 | utf_8 | 31f196bca4c11b9610c98de8e4d7b107 | % This function takes a problem in SeDuMi MATLAB format and writes it out
% in SDPpack format.
%
% Usage:
%
% writesdp(fname,A,b,c,K)
%
% fname Name of SDPpack file, in quotes
% A,b,c,K Problem in SeDuMi form
%
% Notes:
%
% Problems with complex data are not allowed.
%
% ... |
github | noureldien/RecommenderSystem-master | frompack.m | .m | RecommenderSystem-master/cvx/sedumi/conversion/frompack.m | 2,509 | utf_8 | a4730dcb4ec069944953dce753da973d | % FROMPACK Converts a cone problem in SDPPACK format to SEDUMI format.
%
% [At,c] = frompack(A,b,C,blk) Given a problem (A,b,C,blk) in the
% SDPPACK-0.9-beta format, this produces At and c for use with
% SeDuMi. This lets you execute
%
% [x,y,info] = SEDUMI(At,b,c,blk);
%
% IMPORTANT: this function assumes that th... |
github | noureldien/RecommenderSystem-master | feascpx.m | .m | RecommenderSystem-master/cvx/sedumi/conversion/feascpx.m | 4,385 | utf_8 | c48c6cf336cdb94ad12b04e1efd2417b | % FEASCPX Generates a random sparse optimization problem with
% linear, quadratic and semi-definite constraints. Output
% can be used by SEDUMI. Includes complex-valued data.
%
% The following two lines are typical:
% > [AT,B,C,K] = FEASCPX;
% > [X,Y,INFO] = SEDUMI(AT,B,C,K);
%
% An extended version is:
% > [AT... |
github | noureldien/RecommenderSystem-master | cvx_glpk.m | .m | RecommenderSystem-master/cvx/shims/cvx_glpk.m | 4,344 | utf_8 | 2a1ccba01ab8cc7e099853c4bbfe81b1 | function shim = cvx_glpk( shim )
% CVX_SOLVER_SHIM GLPK interface for CVX.
% This procedure returns a 'shim': a structure containing the necessary
% information CVX needs to use this solver in its modeling framework.
if ~isempty( shim.solve ),
return
end
if isempty( shim.name ),
fname = 'glpk.m';
ps =... |
github | noureldien/RecommenderSystem-master | cvx_sedumi.m | .m | RecommenderSystem-master/cvx/shims/cvx_sedumi.m | 10,740 | utf_8 | fb45695a2c0dd7b2bd1dd9884504f6fb | function shim = cvx_sedumi( shim )
% CVX_SOLVER_SHIM SeDuMi interface for CVX.
% This procedure returns a 'shim': a structure containing the necessary
% information CVX needs to use this solver in its modeling framework.
global cvx___
if ~isempty( shim.solve ),
return
end
if isempty( shim.name ),
fname = ... |
github | noureldien/RecommenderSystem-master | cvx_sdpt3.m | .m | RecommenderSystem-master/cvx/shims/cvx_sdpt3.m | 12,657 | utf_8 | 508f2ab7f97c915f8b3d4d479b38aa53 | function shim = cvx_sdpt3( shim )
% CVX_SOLVER_SHIM SDPT3 interface for CVX.
% This procedure returns a 'shim': a structure containing the necessary
% information CVX needs to use this solver in its modeling framework.
global cvx___
if ~isempty( shim.solve ),
return
end
if isempty( shim.name ),
fname = 's... |
github | ParkTJT/Speex-master | echo_diagnostic.m | .m | Speex-master/jni/libspeex/echo_diagnostic.m | 2,076 | utf_8 | 8d5e7563976fbd9bd2eda26711f7d8dc | % Attempts to diagnose AEC problems from recorded samples
%
% out = echo_diagnostic(rec_file, play_file, out_file, tail_length)
%
% Computes the full matrix inversion to cancel echo from the
% recording 'rec_file' using the far end signal 'play_file' using
% a filter length of 'tail_length'. The output is saved to 'o... |
github | p5a0u9l/myASR-master | preComputeTrainMfcc.m | .m | myASR-master/preComputeTrainMfcc.m | 1,890 | utf_8 | c8c7f458f99dcdec45c7843ecb18be8a | function preComputeTrainMfcc(list)
%% PRECOMPUTEALLMFCC
global baseline obsMat
list = filterList(list, 'train_.*_.*');
%% Iterate over training list and generate features
for i = 1:length(list)
wavName = list{i};
fprintf('preComputeAllMfcc %d of %d\n', i, length(list));
if baseline
obsMat.(wavName) = al... |
github | p5a0u9l/myASR-master | myASR.m | .m | myASR-master/myASR.m | 5,639 | utf_8 | 9d70f1518b9bac153ddb7ec315a7e511 | function myASR(varargin)
%% myASR
%% Initialization and Setup
global debug p featureRoot trainRoot myVocab testLexicon fs
global nTestWord nTrainWord obsMat wavMat trainLexicon
debug = 1;
wavMat = matfile('TIDIG'); tic;
nTrainWord = 150;
nTestWord = 100;
p = inputParser;
addParameter(p, 'HMMTRAIN', 0);
addParameter(p... |
github | p5a0u9l/myASR-master | mfcc.m | .m | myASR-master/mfcc.m | 2,898 | utf_8 | 46fea2ffa907edad9abd1e9e701eab98 | %% MFCC
function [c, dc] = mfcc(s, C, B, M)
% Inputs
% s - the speech signal
% C - the # of cepstral coefficients
% B - the # of mel-scale filter banks
% M - the order of MFCC derivative deltas
debug = 0;
%% Setup and Iniz.
% function handles
hz2mel = @(hz)(1125*log(1 + hz/700));
mel2hz = @(mel)(700*exp(mel/1125) - 7... |
github | p5a0u9l/myASR-master | myHmmTrain.m | .m | myASR-master/myHmmTrain.m | 2,013 | utf_8 | 8895844a6392cd101057a9f1766199fc | function [prior, a_ij, mu, sigma] = myHmmTrain(data, initialStateDist, a_ij, mu, sigma)
%% iniz
max_iter = 200;
thresh = 5e-4;
nTrain = length(data);
N = size(data{1}, 1);
M = length(initialStateDist);
expNumTrans = zeros(M, M);
expNumVisits = zeros(M, 1);
gammaSum = zeros(M, 1);
m = zeros(N, M);
op = zeros(N, N, M)... |
github | p5a0u9l/myASR-master | forwardbackward.m | .m | myASR-master/forwardbackward.m | 1,213 | utf_8 | afb513bef87b1c3b9eb04cbd2742dc09 | function [alpha, beta, gamma, loglik, xiSum] = forwardbackward(prior, a_ij, B)
%% Iniz.
[M, T] = size(B);
scale = ones(1, T);
loglik = 0;
alpha = zeros(M, T);
beta = zeros(M, T);
gamma = zeros(M, T);
xiSum = zeros(M, M);
%% Forwards
t = 1;
alpha(:, 1) = prior .* B(:,t);
[alpha(:, t), scale(t)] = normalise(alpha(:, t... |
github | p5a0u9l/myASR-master | record_voice.m | .m | myASR-master/record_voice.m | 364 | utf_8 | 7ca608533579af2e4b0e664537afd0f3 | %% functions
function s = record_voice(time, cli)
y = audiorecorder(8000, 16, 1); % creates the record object.
if cli
fprintf('\nRecording in 3 ')
for i = 1:3
pause(1)
fprintf('%d ', 3 - i)
end
end
recordblocking(y, time); % records 4 seconds of speech
s = getaudiodata(y); % extracts the signal as ... |
github | rlayne/ELF-v2.0-Descriptor-master | genDescriptor.m | .m | ELF-v2.0-Descriptor-master/genDescriptor.m | 4,632 | utf_8 | 412a6db3a67f8277b4b92f62531f31a2 | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | genHSLabels2.m | .m | ELF-v2.0-Descriptor-master/genHSLabels2.m | 1,067 | utf_8 | dd097a00f7d996872dd7e2ff162fe718 | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | genSchmidLabels2.m | .m | ELF-v2.0-Descriptor-master/genSchmidLabels2.m | 1,256 | utf_8 | d4d26dacf08ae5c57833f413a03387ea | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | genFeatureSlices.m | .m | ELF-v2.0-Descriptor-master/genFeatureSlices.m | 1,564 | utf_8 | 11cbcbb3fe71901993207e5ada79575c | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | genGaborLabels2.m | .m | ELF-v2.0-Descriptor-master/genGaborLabels2.m | 1,126 | utf_8 | 877671e5e5930a9110003754aafebc83 | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | genYCCLabels2.m | .m | ELF-v2.0-Descriptor-master/genYCCLabels2.m | 1,357 | utf_8 | bc175e86d0c6c50c4aad324c07571a0a | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | schmid_sep.m | .m | ELF-v2.0-Descriptor-master/schmid_sep.m | 1,656 | utf_8 | 97da32d87a12684864192bbde9874d95 | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | genRGBLabels2.m | .m | ELF-v2.0-Descriptor-master/genRGBLabels2.m | 1,037 | utf_8 | 4231a3b411a9da4af9286deb696dab3d | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | gethists_specific.m | .m | ELF-v2.0-Descriptor-master/gethists_specific.m | 1,755 | utf_8 | abb948a2e2989f8c3280171c3c31dcc4 | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | rlayne/ELF-v2.0-Descriptor-master | gabor_sep.m | .m | ELF-v2.0-Descriptor-master/gabor_sep.m | 1,438 | utf_8 | 02d7c9d849146c4af0f35472dfdafcfe | %-------------------------------------------------------------------------------
%- CPYRGT1: (c) 2015 Vision Group, Queen Mary University of London
%- CPYRGT2: (c) 2015 Vision Semantics Ltd.
%-
%- C.AUTHR: Ryan Layne, <r.d.c.layne [at] qmul.ac.uk>
%- LICENSE: Academic use only, no commercial usage without direct consen... |
github | tuandn8/GM_PHD_Filter-master | unifpdf_2d.m | .m | GM_PHD_Filter-master/unifpdf_2d.m | 1,467 | utf_8 | 2abdd4346466807e621afcf11262f51e | %unifpdf_2d
%Last modified 21 November 2013
%Matlab code by Bryan Clarke b.clarke@acfr.usyd.edu.au
%A 2D uniform PDF function.
%xrange and yrange are inclusive limits of region
%z is a 2D sample point.
%This is used in the clutter function (i.e. we assume a uniform
%distribution of clutter).
%This implementation is... |
github | tuandn8/GM_PHD_Filter-master | CalculateOSPAMetric.m | .m | GM_PHD_Filter-master/CalculateOSPAMetric.m | 4,438 | utf_8 | 069a054f2b7c7497cf21f100416e5302 | %CalculatePerformanceMetric
%Last modified 21 November 2013
%Matlab code by Bryan Clarke b.clarke@acfr.usyd.edu.au
%This is an implementation of the Optimal Subpattern Assignment
%(OSPA) metric proposed by Schuhmacher et al in
%Schuhmacher, D.; Ba-Tuong Vo; Ba-Ngu Vo, "A Consistent Metric for Performance Evaluation ... |
github | tuandn8/GM_PHD_Filter-master | Hungarian.m | .m | GM_PHD_Filter-master/Hungarian.m | 9,130 | utf_8 | e8286e01317f1b102271408762e5030c | %This code is available online at http://ba-ngu.vo-au.com/vo/OSPA_for_Tracks.zip
function [Matching,Cost] = Hungarian(Perf)
%
% [MATCHING,COST] = Hungarian_New(WEIGHTS)
%
% A function for finding a minimum edge weight matching given a MxN Edge
% weight matrix WEIGHTS using the Hungarian Algorithm.
%
% An edge weight o... |
github | tuandn8/GM_PHD_Filter-master | error_ellipse.m | .m | GM_PHD_Filter-master/error_ellipse.m | 8,066 | utf_8 | 88ee33435327a635d2d76393c95234ae | function h=error_ellipse(varargin)
% ERROR_ELLIPSE - plot an error ellipse, or ellipsoid, defining confidence region
% ERROR_ELLIPSE(C22) - Given a 2x2 covariance matrix, plot the
% associated error ellipse, at the origin. It returns a graphics handle
% of the ellipse that was drawn.
%
% ERROR_ELLIPSE(C33) ... |
github | tuandn8/GM_PHD_Filter-master | Calculate_Jacobian_H.m | .m | GM_PHD_Filter-master/Calculate_Jacobian_H.m | 2,029 | utf_8 | b7d0229df0c179d15dcf4f554f64ce1f | %% Calculate_Jacobian_H
%Calculates the Jacobian of a range-bearing measurement model
%xS and yS are the position of the sensor
%xL, yL, vxL, vyL are the state of the landmark (position and velocities)
%Velocities are not used.
%This function is re-implemented as a one-line anonymous function in
%GM_EKF_PHD_Initialise_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.