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

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 bayes scala 0.5-SNAPSHOT

by danielkorzekwa - January 9, 2015, 19:23:48 CET [ Project Homepage BibTeX Download ] 3021 views, 929 downloads, 2 subscriptions

About: It is a Scala library for building Bayesian Networks with discrete/continuous variables and running deterministic Bayesian inference

Changes:

Initial Announcement on mloss.org.


Logo SkyVoice TTS and SDK 1.0

by openpr_nlpr - September 10, 2012, 03:48:47 CET [ Project Homepage BibTeX Download ] 4049 views, 927 downloads, 1 subscription

About: Text-to-Speech (TTS) is a kind of speech processing technology that converts text into speech. It involves phonetics, linguistics, digital signal processing technology, computer technology, multimedia technology, and other technologies. It is a frontier technology in Chinese information processing field. With TTS technology, any text used to be read by eyes can also be listened by ears.

Changes:

Initial Announcement on mloss.org.


Logo Aboleth 0.7

by dsteinberg - December 14, 2017, 02:39:19 CET [ Project Homepage BibTeX Download ] 3153 views, 922 downloads, 3 subscriptions

About: A bare-bones TensorFlow framework for Bayesian deep learning and Gaussian process approximation

Changes:

Release 0.7.0

  • Update to TensorFlow r1.4.

  • Tutorials in the documentation on:

  • Interfacing with Keras

  • Saving/loading models

  • How to build a variety of regressors with Aboleth

  • New prediction module with some convenience functions, including freezing the weight samples during prediction.

  • Bayesian convolutional layers with accompanying demo.

  • Allow the number of samples drawn from a model to be varied by using placeholders.

  • Generalise the feature embedding layers to work on matrix inputs (instead of just column vectors).

  • Numerous numerical and usability fixes.


About: FAST is an implementation of Hidden Markov Models with Features. It allows features to modify both emissions and transition probabilities.

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 ] 3134 views, 920 downloads, 1 subscription

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

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 Two stage Sparse Representation 1.0.0

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


About: Learns dynamic network changes across conditions and visualize the results in Cytoscape.

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.


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