All entries.
Showing Items 521-530 of 619 on page 53 of 62: First Previous 48 49 50 51 52 53 54 55 56 57 58 Next Last

About: This library implements the Optimum-Path Forest classifier for unsupervised and supervised learning.

Changes:

Initial Announcement on mloss.org.


Logo CMatrix Class 1.0.0

by openpr_nlpr - December 2, 2011, 05:28:41 CET [ Project Homepage BibTeX Download ] 2146 views, 605 downloads, 1 subscription

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: Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, they are either for error correction or for error detection, and learning a general framework that systematically unifies these two aspects and explore their relation is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve the robust sparse representation problem. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to performing both error correction and error detection. More specifically, by using the additive form of HQ, we propose an L1-regularized error correction method by iteratively recovering corrupted data from errors incurred by noises and outliers; by using the multiplicative form of HQ, we propose an L1-regularized error detection method by learning from uncorrupted data iteratively. We also show that the L1-regularization solved by soft-thresholding function has a dual relationship to Huber M-estimator, which theoretically guarantees the performance of robust sparse representation in terms of M-estimation. Experiments on robust face recognition under severe occlusion and corruption validate our framework and findings.

Changes:

Initial Announcement on mloss.org.


Logo CFSPCommunityDetection 1.0

by tbuehler - October 13, 2014, 05:36:24 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2129 views, 562 downloads, 1 subscription

About: A community detection method based on constrained fractional set programming (CFSP).

Changes:

Initial Announcement on mloss.org.


Logo Auto encoder Based Data Clustering Toolkit 1.0

by openpr_nlpr - February 10, 2015, 08:30:55 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2125 views, 404 downloads, 2 subscriptions

About: The auto-encoder based data clustering toolkit provides a quick start of clustering based on deep auto-encoder nets. This toolkit can cluster data in feature space with a deep nonlinear nets.

Changes:

Initial Announcement on mloss.org.


Logo NearOED 1.0

by gabobert - July 11, 2013, 16:54:12 CET [ Project Homepage BibTeX Download ] 2113 views, 641 downloads, 1 subscription

About: The toolbox from the paper Near-optimal Experimental Design for Model Selection in Systems Biology (Busetto et al. 2013, submitted) implemented in MATLAB.

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 ] 2113 views, 640 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 Perspective 3 Points Solver 1.0.0

by openpr_nlpr - December 2, 2011, 05:31:04 CET [ Project Homepage BibTeX Download ] 2102 views, 655 downloads, 1 subscription

About: This is a implementation of the classic P3P(Perspective 3-Points) 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 381-395, 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.


Logo r-cran-gamboostLSS 1.0-3

by r-cran-robot - November 16, 2011, 00:00:00 CET [ Project Homepage BibTeX Download ] 2098 views, 474 downloads, 0 subscriptions

About: Boosting Methods for GAMLSS Models

Changes:

Fetched by r-cran-robot on 2013-04-01 00:00:04.956804


Logo BLOG 0.9.1

by jxwuyi - April 27, 2015, 06:52:05 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2097 views, 463 downloads, 3 subscriptions

About: Bayesian Logic (BLOG) is a probabilistic modeling language. It is designed for representing relations and uncertainties among real world objects.

Changes:

Initial Announcement on mloss.org.


Showing Items 521-530 of 619 on page 53 of 62: First Previous 48 49 50 51 52 53 54 55 56 57 58 Next Last