jamespayor / weighted-bipartite-perfect-matchingLinks
Fast C++ implementation of an O(NM) algorithm for the assignment problem.
☆53Updated 4 years ago
Alternatives and similar repositories for weighted-bipartite-perfect-matching
Users that are interested in weighted-bipartite-perfect-matching are comparing it to the libraries listed below
Sorting:
- C++ program to compute the maximum weighted bipartite matching of a graph☆37Updated 3 years ago
- Highly parallel DBSCAN (HPDBSCAN)☆44Updated 8 months ago
- KMeans clustering in Eigen.☆26Updated 9 years ago
- This is a library of incremental image alingment algorithms using OpenCV☆21Updated 2 years ago
- Automatically exported from code.google.com/p/vpdetection☆9Updated 10 years ago
- The C++ implementation of Multi-H algorithm, which is a multi-plane fitting technique. If you use this work for Academic purposes, pleas…☆32Updated 6 years ago
- C++ fast hierarchical clustering algorithms☆87Updated last year
- Probably the fastest C++ dbscan library.☆96Updated last year
- Implementation of Non-Maximum Suppression algorithm☆69Updated 3 years ago
- FastHOG library that has been fixed to work with CUDA 5.x on Ubuntu 12.04☆20Updated 11 years ago
- Murty's Algorithm for m-best assignments; Implementation inspired by Miller's pseudocode (see code)☆19Updated 6 years ago
- fast and energy-efficient computation of HOG features☆17Updated 6 years ago
- A tiny least squares solver targeting extreme performance on repeated minimizations☆44Updated 9 years ago
- Connected Component Labeling.☆43Updated 4 years ago
- A one header only DBSCAN (N-dimensions support) implementation☆122Updated 3 years ago
- C++ implementation of Selective Search☆40Updated 4 years ago
- The GMPHD filter based Online Multiple Object Tracker using Group Management and Relative Motion Analysis☆26Updated 5 years ago
- A class for performing principal component analysis using Eigen library☆30Updated 8 years ago
- Simple algo to find convex polygon intersection and compute area of polygone with using OpenCV☆50Updated 9 years ago
- Eigen based C++11 implementation of cubic spline approximation (smoothing)☆37Updated last year
- some test to implement cv::Mat conversion to numpy.array☆25Updated 8 years ago
- Graph plots, drawing, layout and windows in OpenCV☆127Updated 3 years ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Updated 12 years ago
- A fast, scalable and light-weight C++ Fréchet and DTW distance library, exposed to python and focused on clustering of polygonal curves.☆48Updated last year
- An GPU/CUDA implementation of the Hungarian algorithm☆111Updated 6 years ago
- ☆35Updated 9 years ago
- Implements the Agglomerative Hierarchical Clustering algorithm.☆68Updated 5 years ago
- This shows a basic implementation of the global nearest neighbour (GNN) multi target Tracker. Kalman filter is used for Tracking and Auct…☆50Updated 4 years ago
- C++ Implementation of the hungarian algorithm☆43Updated 6 years ago
- ☆41Updated last year