This site is dedicated to the Shape-Matching Framework project, implemented by Yanir Taflev, as part of a final academic work in college. Background: The Shape-Matching framework designed to provide algorithms so as the infrastructure to make it easy to align and match shapes. There are few main algorithms, each one uses different attitude and complement other aspect of shape matching issue. The framework currently in development stages, so feedbacks are more than appriciatable. License: The material introduced in this site is Open Source code. The code distributed under the name "Shape matching framework" is released for use under the AFL v3.0 (Academic Free License) terms. For further information and terms see here. Innovation: This project innovates in few subjects over other existing project: - This code is fully implemented using .NET C# language, the first that not using wrapped C++ code. - The project implements a uniform access to the algorithms, making it easy to use inside general applications. - Both the latest source code and the dlls are available to download. - Some algorithms are implemented first time outside MATLAB as Open Source. - The core implementation fully compatible with .NET 3.5 framework. - Uniform methods supported from .NET 2.0 framework and above. What is inside: There are three main algorithms that were implemented in this version: - Shape context matching. - Principal component analysis alignment (a.k.a. PCA). - Hausdorff distance - double sided. There are implementation of some auxiliary algorithms that one may find useful: - Thin Plate Splines (a.k.a. TPS). - Hungarian algorithm for perfect pairing. - Liniar algebra infrastructure including Inverse, Eigen values and vectors implementation. |
