Projects running under windows.
Showing Items 81-100 of 171 on page 5 of 9: Previous 1 2 3 4 5 6 7 8 9 Next

About: We study the problem of robust feature extraction based on L21 regularized correntropy in both theoretical and algorithmic manner. In theoretical part, we point out that an L21-norm minimization can be justified from the viewpoint of half-quadratic (HQ) optimization, which facilitates convergence study and algorithmic development. In particular, a general formulation is accordingly proposed to unify L1-norm and L21-norm minimization within a common framework. In algorithmic part, we propose an L21 regularized correntropy algorithm to extract informative features meanwhile to remove outliers from training data. A new alternate minimization algorithm is also developed to optimize the non-convex correntropy objective. In terms of face recognition, we apply the proposed method to obtain an appearance-based model, called Sparse-Fisherfaces. Extensive experiments show that our method can select robust and sparse features, and outperforms several state-of-the-art subspace methods on largescale and open face recognition datasets.

Changes:

Initial Announcement on mloss.org.


Logo Uncorrelated Multilinear Principal Component Analysis 1.0

by hplu - June 18, 2012, 17:23:52 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2330 views, 459 downloads, 1 subscription

About: A Matlab implementation of Uncorrelated Multilinear PCA (UMPCA) for dimensionality reduction of tensor data via tensor-to-vector projection

Changes:

Initial Announcement on mloss.org.


About: Ran He, Wei-Shi Zheng,Tieniu Tan, and Zhenan Sun. Half-quadratic based Iterative Minimization for Robust Sparse Representation. Submitted to IEEE Trans. on Pattern Analysis and Machine Intelligence.

Changes:

Initial Announcement on mloss.org.


About: This code is developed for incorporating a class of linear priors into the regression model.

Changes:

Initial Announcement on mloss.org.


Logo WebEnsemble 1.0

by jungc005 - May 8, 2012, 22:24:44 CET [ BibTeX Download ] 1357 views, 460 downloads, 1 subscription

About: Use the power of crowdsourcing to create ensembles.

Changes:

Initial Announcement on mloss.org.


Logo Multilinear Principal Component Analysis 1.2 1.2

by openpr_nlpr - April 16, 2012, 09:04:08 CET [ Project Homepage BibTeX Download ] 1814 views, 545 downloads, 1 subscription

About: This archive contains a Matlab implementation of the Multilinear Principal Component Analysis (MPCA) algorithm and MPCA+LDA, as described in the paper Haiping Lu, K.N. Plataniotis, and A.N. Venetsanopoulos, "MPCA: Multilinear Principal Component Analysis of Tensor Objects", IEEE Transactions on Neural Networks, Vol. 19, No. 1, Page: 18-39, January 2008.

Changes:

Initial Announcement on mloss.org.


Logo Oboe A Chinese Syntactic Parser 1.0

by openpr_nlpr - April 9, 2012, 09:08:35 CET [ Project Homepage BibTeX Download ] 1922 views, 422 downloads, 1 subscription

About: Oboe is a software for Chinese syntactic parsing, and it can display syntactic trees in a graphical view with two kinds of representation: phrase tree and dependency tree. So it is very helpful for NLP researchers, especially for researchers focusing on syntax-based methods.

Changes:

Initial Announcement on mloss.org.


Logo TMBP 1.0

by zengjia - April 5, 2012, 06:42:26 CET [ BibTeX BibTeX for corresponding Paper Download ] 4123 views, 2013 downloads, 2 subscriptions

Rating Whole StarWhole StarWhole StarWhole StarWhole Star
(based on 1 vote)

About: Message passing for topic modeling

Changes:
  1. improve "readme.pdf".
  2. correct some compilation errors.

Logo MLPY Machine Learning Py 3.5.0

by albanese - March 15, 2012, 09:52:41 CET [ Project Homepage BibTeX Download ] 50419 views, 9525 downloads, 2 subscriptions

Rating Whole StarWhole StarWhole Star1/2 StarEmpty Star
(based on 3 votes)

About: mlpy is a Python module for Machine Learning built on top of NumPy/SciPy and of GSL.

Changes:

New features:

  • LibSvm(): pred_probability() now returns probability estimates; pred_values() added
  • LibLinear(): pred_values() and pred_probability() added
  • dtw_std: squared Euclidean option added
  • LCS for series composed by real values (lcs_real()) added
  • Documentation

Fix:

  • wavelet submodule: cwt(): it returned only real values in morlet and poul
  • IRelief(): remove np. in learn()
  • fix rfe_kfda and rfe_w2 when p=1

Logo Thresholding program 1.0

by openpr_nlpr - March 1, 2012, 03:18:52 CET [ Project Homepage BibTeX Download ] 3666 views, 443 downloads, 1 subscription

About: This is demo program on global thresholding for image of bright small objects, such as aircrafts in airports. the program include four method, otsu,2D-Tsallis,PSSIM, Smoothnees Method.

Changes:

Initial Announcement on mloss.org.


Logo JMLR LWPR 1.2.4

by sklanke - February 6, 2012, 19:55:41 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 27343 views, 3391 downloads, 1 subscription

About: Locally Weighted Projection Regression (LWPR) is a recent algorithm that achieves nonlinear function approximation in high dimensional spaces with redundant and irrelevant input dimensions. At its [...]

Changes:

Version 1.2.4

  • Corrected typo in lwpr.c (wrong function name for multi-threaded helper function on Unix systems) Thanks to Jose Luis Rivero

Logo BCILAB 1.0-beta

by chkothe - January 6, 2012, 23:47:55 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3335 views, 666 downloads, 1 subscription

About: MATLAB toolbox for advanced Brain-Computer Interface (BCI) research.

Changes:

Initial Announcement on mloss.org.


Logo Efficient Nonnegative Sparse Coding Algorithm 1.0

by openpr_nlpr - January 4, 2012, 09:44:18 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2089 views, 440 downloads, 1 subscription

About: Nonnegative Sparse Coding, Discriminative Semi-supervised Learning, sparse probability graph

Changes:

Initial Announcement on mloss.org.


Logo Kernel Machine Library 0.2

by pawelm - December 27, 2011, 17:14:01 CET [ Project Homepage BibTeX BibTeX for corresponding Paper ] 3442 views, 131 downloads, 1 subscription

About: The Kernel-Machine Library is a free (released under the LGPL) C++ library to promote the use of and progress of kernel machines.

Changes:

Updated mloss entry (minor fixes).


About: In this paper, we propose an improved principal component analysis based on maximum entropy (MaxEnt) preservation, called MaxEnt-PCA, which is derived from a Parzen window estimation of Renyi’s quadratic entropy. Instead of minimizing the reconstruction error either based on L2-norm or L1-norm, the MaxEnt-PCA attempts to preserve as much as possible the uncertainty information of the data measured by entropy. The optimal solution of MaxEnt-PCA consists of the eigenvectors of a Laplacian probability matrix corresponding to the MaxEnt distribution. MaxEnt-PCA (1) is rotation invariant, (2) is free from any distribution assumption, and (3) is robust to outliers. Extensive experiments on real-world datasets demonstrate the effectiveness of the proposed linear method as compared to other related robust PCA methods.

Changes:

Initial Announcement on mloss.org.


About: This code is developed based on Uriel Roque's active set algorithm for the linear least squares problem with nonnegative variables in: Portugal, L.; Judice, J.; and Vicente, L. 1994. A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation 63(208):625-643.Ran He, Wei-Shi Zheng and Baogang Hu, "Maximum Correntropy Criterion for Robust Face Recognition," IEEE TPAMI, in press, 2011.

Changes:

Initial Announcement on mloss.org.


Logo Urheen 1.0.0

by openpr_nlpr - December 2, 2011, 05:40:08 CET [ Project Homepage BibTeX Download ] 1456 views, 385 downloads, 1 subscription

About: Urheen is a toolkit for Chinese word segmentation, Chinese pos tagging, English tokenize, and English pos tagging. The Chinese word segmentation and pos tagging modules are trained with the Chinese Tree Bank 7.0. The English pos tagging module is trained with the WSJ English treebank(02-23).

Changes:

Initial Announcement on mloss.org.


Logo Naive Bayes EM Algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:35:09 CET [ Project Homepage BibTeX Download ] 2291 views, 507 downloads, 1 subscription

About: OpenPR-NBEM is an 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. OpenPR-NBEM uses the multinomial event model for representation. The maximum likelihood estimate is used for supervised learning, and the expectation-maximization estimate is used for semi-supervised and un-supervised learning.

Changes:

Initial Announcement on mloss.org.


Logo Local Binary Pattern 1.0.0

by openpr_nlpr - December 2, 2011, 05:33:44 CET [ Project Homepage BibTeX Download ] 1536 views, 498 downloads, 1 subscription

About: This is a class to calculate histogram of LBP (local binary patterns) from an input image, histograms of LBP-TOP (local binary patterns on three orthogonal planes) from an image sequence, histogram of the rotation invariant VLBP (volume local binary patterns) or uniform rotation invariant VLBP from an image sequence.

Changes:

Initial Announcement on mloss.org.


Logo Two stage Sparse Representation 1.0.0

by openpr_nlpr - December 2, 2011, 05:32:31 CET [ Project Homepage BibTeX Download ] 1230 views, 414 downloads, 1 subscription

About: This program implements a novel robust sparse representation method, called the two-stage sparse representation (TSR), for robust recognition on a large-scale database. Based on the divide and conquer strategy, TSR divides the procedure of robust recognition into outlier detection stage and recognition stage. The extensive numerical experiments on several public databases demonstrate that the proposed TSR approach generally obtains better classification accuracy than the state-of-the-art Sparse Representation Classification (SRC). At the same time, by using the TSR, a significant reduction of computational cost is reached by over fifty times in comparison with the SRC, which enables the TSR to be deployed more suitably for large-scale dataset.

Changes:

Initial Announcement on mloss.org.


Showing Items 81-100 of 171 on page 5 of 9: Previous 1 2 3 4 5 6 7 8 9 Next