Showing Items 341350 of 595 on page 35 of 60: First Previous 30 31 32 33 34 35 36 37 38 39 40 Next Last
About: This is a implementation of the classic P3P(Perspective 3Points) algorithm problem solution in the Ransac paper "M. A. Fischler, R. C. Bolles. Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Comm. of the ACM, Vol 24, pp 381395, 1981.". The algorithm gives the four probable solutions of the P3P problem in about 0.1ms, and can be used as input of the consequent RANSAC step. The codes needs the numerics library VNL which is a part of the widely used computer vision library VXL. One can download & install it from http://vxl.sourceforge.net/. Changes:Initial Announcement on mloss.org.

About: It's a C++ program for symmetric matrix diagonalization, inversion and principal component anlaysis(PCA). The matrix diagonalization function can also be applied to the computation of singular value decomposition (SVD), Fisher linear discriminant analysis (FLDA) and kernel PCA (KPCA) if forming the symmetric matrix appropriately. Changes:Initial Announcement on mloss.org.

About: This program is a C++ implementation of Linear Discriminant Function Classifier. Discriminant functions such as perceptron criterion, cross entropy (CE) criterion, and least mean square (LMS) criterion (all for multiclass classification problems) are supported in it. The program uses a sparsedata structure to represent the feature vector to seek higher computational speed. Some other techniques such as online updating, weights averaging, gaussian prior regularization are also supported. Changes:Initial Announcement on mloss.org.

About: This program is a C++ implementation of Naive Bayes Classifier, which is a wellknown generative classification algorithm for the application such as text classification. The Naive Bayes algorithm requires the probabilistic distribution to be discrete. The program uses the multinomial event model for representation, the maximum likelihood estimate with a Laplace smoothing technique for learning parameters. A sparsedata structure is defined to represent the feature vector in the program to seek higher computational speed. Changes:Initial Announcement on mloss.org.

About: A simple and clear OpenCV based extended Kalman filter(EKF) abstract class implementation,absolutely following standard EKF equations. Special thanks to the open source project of KFilter1.3. It is easy to inherit it to implement a variable state and measurement EKF for computer vision and INS usages. Changes:Initial Announcement on mloss.org.

About: Supervised Latent Semantic Indexing(SLSI) is an supervised feature transformation method. The algorithms in this package are based on the iterative algorithm of Latent Semantic Indexing. Changes:Initial Announcement on mloss.org.

About: This program is used to extract SIFT points from an image. Changes:Initial Announcement on mloss.org.

About: LDPar is an efficient datadriven dependency parser. You can train your own parsing model on treebank data and parse new data using the induced model. Changes:Initial Announcement on mloss.org.

About: This program is used to extract HOG(histograms of oriented gradients) features from images. The integral histogram is used for fast histogram extraction. Both APIs and binary utility are provided. Changes:Initial Announcement on mloss.org.

About: This program is used to find point matches between two images. The procedure can be divided into two parts: 1) use SIFT matching algorithm to find sparse point matches between two images. 2) use "quasidense propagation" algorithm to get "quasidense" point matches. Changes:Initial Announcement on mloss.org.
