A fast mex version of the modified inpoly function.
please run mexme_inpoly.m to compile mex file on your plateform
please run test_inpoly.m for demo
SAT solvers by Cross-Entropy (CE) and a Botev-Kroeze (BK) optimization algorithms
CNF SAT problems can be formulated as :
S(X)=sum(j=1,...,m)C_j, where C_j=max(0 , (2X_i-1)*Aji
Please run the demo files
Here is another fast implementation of the FGT transform.
Multi-Knapsack solver by two stochastic solvers : i) by Cross-Entropy Method and ii) by Botev-Kroese Method for the following problem
st. WX <= c
Please run the demo files :
Return the optimal path given the adjacency/cost sparse matrix and source/destination nodes.
Run mexme_dijkstra.m to compile mex-files on your own-plateform.
Be sure that "mex -setup" have been done at least one.
em_uvp : Expectation-Maximization algorithm for a Univariate Poisson Mixture
[logl , R , P] = em_upm(Z , R0 , P0 , [nbite]);
Z Discrete measurements (1 x K x [n1] x ... x [nl])
Generates random 2D-paths between start and finish nodes according to densities distribution given by matrix C with leg's contrainsts defined by the adjacency matrix I.
P = path_generator(start , finish , I , [C] , [K] , [V] ,...
NDellipse returns 2d coordinates of several ellipsoids defined by NDslices.
Usage [x , y] = ndellipse(M , S , [H] , [R] , [N]);
M : Mean vector (d x 1 x [n1] , ... , [nl])
A demo illustring Particle filter for navigation with altimetric measurements. Performances of particle filter is compared with the Posterior Cramdodur-Rao Bounds
Please run mexme_pf_nav.m for compiling mex-files on your plateform (be...
Faces detection toolbox v 0.2
This toolbox provides some tools for faces detection/classification using Local Binary Patterns (and some variants) and Haar features.
Face detection is performed by...