All entries.
Showing Items 391-400 of 642 on page 40 of 65: First Previous 35 36 37 38 39 40 41 42 43 44 45 Next Last

Logo Naive Bayes Classifier 1.0.0

by openpr_nlpr - December 2, 2011, 05:25:44 CET [ Project Homepage BibTeX Download ] 4645 views, 1042 downloads, 1 subscription

About: This program is a C++ implementation of Naive Bayes Classifier, which is a well-known 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 sparse-data structure is defined to represent the feature vector in the program to seek higher computational speed.

Changes:

Initial Announcement on mloss.org.


Logo OpenCV Based Extended Kalman Filter Frame 1.0.0

by openpr_nlpr - December 2, 2011, 05:23:56 CET [ Project Homepage BibTeX Download ] 3333 views, 889 downloads, 1 subscription

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.


Logo Supervised Latent Semantic Indexing 1.0.0

by openpr_nlpr - December 2, 2011, 05:20:50 CET [ Project Homepage BibTeX Download ] 2530 views, 696 downloads, 1 subscription

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.


Logo SIFT Extractor 1.0.0

by openpr_nlpr - December 2, 2011, 05:18:35 CET [ Project Homepage BibTeX Download ] 2620 views, 816 downloads, 1 subscription

About: This program is used to extract SIFT points from an image.

Changes:

Initial Announcement on mloss.org.


Logo Layer Based Dependency Parser 1.0.0

by openpr_nlpr - December 2, 2011, 04:51:23 CET [ Project Homepage BibTeX Download ] 2417 views, 655 downloads, 1 subscription

About: LDPar is an efficient data-driven 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.


Logo Quasi Dense Matching 1.0.0

by openpr_nlpr - December 2, 2011, 04:44:19 CET [ Project Homepage BibTeX Download ] 2709 views, 768 downloads, 1 subscription

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 "quasi-dense propagation" algorithm to get "quasi-dense" point matches.

Changes:

Initial Announcement on mloss.org.


Logo Probabilistic Latent Semantic Indexing 1.0.0

by openpr_nlpr - December 2, 2011, 04:42:02 CET [ Project Homepage BibTeX Download ] 2476 views, 662 downloads, 1 subscription

About: Hofmann, T. 1999. Probabilistic latent semantic indexing. In Proceedings of the 22nd ACM-SIGIR International Conference on Research and Development in Information Retrieval (Berkeley,Calif.), ACM, New York, 50–57.

Changes:

Initial Announcement on mloss.org.


Logo Agglomerative MeanShift Clustering 1.0.0

by openpr_nlpr - December 2, 2011, 04:38:13 CET [ Project Homepage BibTeX Download ] 3113 views, 870 downloads, 1 subscription

About: Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets. For the purpose of algorithm speedup, an agglomerative MS clustering method called Agglo-MS was developed, along with its mode-seeking ability and convergence property analysis. The method is built upon an iterative query set compression mechanism which is motivated by the quadratic bounding optimization nature of MS. The whole framework can be efficiently implemented in linear running time complexity.

Changes:

Initial Announcement on mloss.org.


Logo Calculate Normalized Information Measures 1.0.0

by openpr_nlpr - December 2, 2011, 04:35:32 CET [ Project Homepage BibTeX Download ] 2901 views, 743 downloads, 1 subscription

About: The toolbox is to calculate normalized information measures from a given m by (m+1) confusion matrix for objective evaluations of an abstaining classifier. It includes total 24 normalized information measures based on three groups of definitions, that is, mutual information, information divergence, and cross entropy.

Changes:

Initial Announcement on mloss.org.


Showing Items 391-400 of 642 on page 40 of 65: First Previous 35 36 37 38 39 40 41 42 43 44 45 Next Last