代码搜索结果

Only "example.m" and "optical_flow.m" have been properly documented. The code is an implementation of the phase-based optical flow algorithm described in Gautama, T. and Van Hulle, M.M. (2002). A P

function [bits_alloc,energy_alloc] = BitLoad(subchan_gains,total_bits,num_subc,gap,noise,M) % Bit Loading Algorithm % --------------------- % % Inputs : % subchan_gains : SubCarrier Gain

% Chow's Algorithm % ---------------- % This is based on the paper by Chow et al titled % % A Practical Discrete Multitone Transceiver Loading Algorithm % for Data Transmission over Spectrally Shaped

function [x,esq,j] = kmeanlbg(d,k) %KMEANLBG Vector quantisation using the Linde-Buzo-Gray algorithm [X,ESQ,J]=(D,K) % %Inputs: % D contains data vectors (one per row) % K is number of centres re

/* rand0.c -- produces random numbers */ /* uses ANSI C portable algorithm */ static unsigned long int next = 1; /* the seed */ int rand0(void) { /* magic formula to

/* s_and_r.c -- file for rand1() and srand1() */ /* uses ANSI C portable algorithm */ static unsigned long int next = 1; /* the seed */ int rand1(void) { /* magic formula to

function [P,itercount] = l2l1_resection(xm, Xlist, optim_bound, beta, maxiter) fprintf('\n\n******** Starting (L2,L1) Resectioning Algorithm ********\n\n'); nbrpoints = size(Xlist,2); nbrimages = 1;

function [U,itercount] = l2l1_triangulation(u, P, optim_bound, beta, maxiter) fprintf('\n\n******** Starting (L2,L1) Triangulation Algorithm ********\n\n'); alphaval = 0.5; opts.autoinit

Tree Structured Genetic Algorithm An algorithm for Genetic Programming Ben.McKay & Mark Willis (c)

Genetic Algorithm Optimization Toolbox Genetic Algorithm Optimization Toolbox (GAOT) GAOT implements simulated evolution i