RSS Feed - Blog
About: This is a library for solving nu-SVM by using Wolfe's minimum norm point algorithm. You can solve binary classification problem. 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.
|
About: Gaussian processes with general nonlinear likelihoods using the unscented transform or Taylor series linearisation. Changes:Initial Announcement on mloss.org.
|
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.
|
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.
|
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: Log-linear analysis for high-dimensional data Changes:Initial Announcement on mloss.org.
|
About: Regularization paTH for LASSO problem (thalasso) thalasso solves problems of the following form: minimize 1/2||X*beta-y||^2 + lambda*sum|beta_i|, where X and y are problem data and beta and lambda are variables. Changes:Initial Announcement on mloss.org.
|
About: The bufferkdtree package is a Python library that aims at accelerating nearest neighbor computations using both k-d trees and modern many-core devices such as graphics processing units (GPUs). Changes:Initial Announcement on mloss.org.
|
About: Software for Automatic Construction and Inference of DBNs Based on Mathematical Models Changes:Initial Announcement on mloss.org.
|
About: MIPS is a software library for state-of-the-art graph mining algorithms. The library is platform independent, written in C++(03), and aims at implementing generic and efficient graph mining algorithms. Changes:description update
|
About: a parallel LDA learning toolbox in Multi-Core Systems for big topic modeling. Changes:Initial Announcement on mloss.org.
|
About: Kaiye Wang, Ran He, Wei Wang, Liang Wang, Tiuniu Tan. Learning Coupled Feature Spaces for Cross-modal Matching. In ICCV, 2013. Changes:Initial Announcement on mloss.org.
|
About: This is an unoptimized implementation of the RFD binary descriptor, which is published in the following paper. B. Fan, et al. Receptive Fields Selection for Binary Feature Description. IEEE Transaction on Image Processing, 2014. doi: http://dx.doi.org/10.1109/TIP.2014.2317981 Changes:Initial Announcement on mloss.org.
|
About: This provide a semi-supervised learning method based co-training for RGB-D object recognition. Besides, we evaluate four state-of-the-art feature learing method under the semi-supervised learning framework. Changes:Initial Announcement on mloss.org.
|
About: Recur is a collection of Gstreamer plugins and language modelling tools based on recurrent neural networks. Changes:Initial Announcement on mloss.org.
|
About: This evaluation toolkit provides a unified framework for evaluating bag-of-words based encoding methods over several standard image classification datasets. Changes:Initial Announcement on mloss.org.
|
About: MALSS is a python module to facilitate machine learning tasks. Changes:Initial Announcement on mloss.org.
|
About: This program is used to extract SIFT points from an image. Changes:Initial Announcement on mloss.org.
|