All entries.
Showing Items 531-540 of 623 on page 54 of 63: First Previous 49 50 51 52 53 54 55 56 57 58 59 Next Last

Logo GPgrid toolkit for fast GP analysis on grid input 0.1

by ejg20 - September 16, 2013, 18:01:16 CET [ BibTeX Download ] 2323 views, 872 downloads, 1 subscription

About: GPgrid toolkit for fast GP analysis on grid input

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 ] 2320 views, 642 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.


Logo WebEnsemble 1.0

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

About: Use the power of crowdsourcing to create ensembles.

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 NearOED 1.0

by gabobert - July 11, 2013, 16:54:12 CET [ Project Homepage BibTeX Download ] 2304 views, 689 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 Distributed Frank Wolfe Algorithm 0.02

by alirezabagheri - January 28, 2015, 00:35:03 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2281 views, 618 downloads, 2 subscriptions

About: Distributed optimization: Support Vector Machines and LASSO regression on distributed data

Changes:

Initial Upload


Logo Quasi Dense Matching 1.0.0

by openpr_nlpr - December 2, 2011, 04:44:19 CET [ Project Homepage BibTeX Download ] 2255 views, 670 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 Simple Generalized Learning Vector Quantization 1.0

by fmschleif - June 4, 2015, 10:49:49 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2252 views, 555 downloads, 2 subscriptions

About: Simple and hopefully clean and easy to follow implementation of the Generalized Learning Vector Quantizer (GLVQ) with variants for metric adaptation (RGLVQ, GMLVQ, LiRaM).

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 ] 2247 views, 514 downloads, 0 subscriptions

About: Boosting Methods for GAMLSS Models

Changes:

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


Logo Perspective 3 Points Solver 1.0.0

by openpr_nlpr - December 2, 2011, 05:31:04 CET [ Project Homepage BibTeX Download ] 2242 views, 690 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.


Showing Items 531-540 of 623 on page 54 of 63: First Previous 49 50 51 52 53 54 55 56 57 58 59 Next Last