This is an implementation of the Deformation and Light Invariant (DaLI) descriptor. The core of the library is written in C. Additionally a Matlab/Octave interface is provided.
This code is the implementation of the “A High Performance CRF Model for Clothes Parsing” paper. It contains all the code for being able to learn and run inference. The features for the Fashionista dataset must be downloaded separately.
This code is an implementation of the Geodesic Finite Mixture Models written in matlab. The core of the algorithm consists of a single file which can be called to perform the clustering. Additionally, several examples are provided to generate the figures from the paper.
- libdq, 2.2 (Feb, 2013)
- Library for using and manipulating unit dual quaternions to describe rigid body motions
- E. Simo-Serra
This is a library for using and manipulating unit dual quaternions (Clifford algebra Cl^+(0,3,1). Unit dual quaternions are useful for describing rigid body movements using screw theory. Main applications of using unit dual quaternions are found in kinematics.
The core of the library is written in C. However, a Lua interface is also provided which is installable by means of LuaRocks. This provides a simple interface for the quick prototyping of projects.
This library calculates the faces obtained by B-Tree Triangular Coding (BTTC). This is usually for subdividing an image into a triangular mesh. The core library is written in C but an octave/matlab interface is provided.
The main focus of this library is simplicity. The code is simple enough to directly integrate it into another program as it is a single C code file with no external dependencies.
ArtTreeKS is a dedicated kinematic synthesis solver for tree topologies. It is designed specifically for finite position kinematic synthesis and has support for both position constraints as well as velocity or acceleration constraints.
The solver employed is a hybrid solved that is based on a Genetic Algorithm (GA) built on top of a Levenberg-Marquadt local optimizer. This allows obtaining solutions for very complex tree topologies.
This is a simple C frontend for ARPACK. This allows easy access to calculating a subset of eigenvectors and eigenvalues of sparse matrices. Specifically it can solve two problems: - Av = vd - Av = Mvd Where A, M are sparse matrices, v is the subset of eigenvectors and d is the diagonal matrix of eigenvalues.