Support Vector Machines (SVMs) have played a key role in broad classes of problems in various fields. However, with increasing amounts of data being generated by businesses and researchers, SVMs suffer from the proble...
详细信息
ISBN:
(纸本)0780375084
Support Vector Machines (SVMs) have played a key role in broad classes of problems in various fields. However, with increasing amounts of data being generated by businesses and researchers, SVMs suffer from the problem of large memory requirement and CPU time when trained in batch mode on large data set The training process involves the solution of a quadratic programming problem. In this paper, we attempt to overcome these limitations and propose an approach based on incremental learning technique and multiple proximal support vector machines classifier. Experiment on generated data set gives promising result.
This paper proposes a Rectangle Expansion Model, which is deduced from active contour model, especially for page layout analysis. The advantage of this model is the robust flexibility no needing to set so many thresho...
详细信息
ISBN:
(纸本)0780375084
This paper proposes a Rectangle Expansion Model, which is deduced from active contour model, especially for page layout analysis. The advantage of this model is the robust flexibility no needing to set so many thresholds as conventional method. Page Layout Analysis is an important part for OCR system to implement printed documents digitization, so this approach can improve the performance of character recognition.
This paper presents a new method of constructing multi-class SVM classifier, which is based on the structure of Decision Directed Acyclic Graph (DDAG) and using active constraint for each SVM classifier. For k-class p...
详细信息
ISBN:
(纸本)0780375084
This paper presents a new method of constructing multi-class SVM classifier, which is based on the structure of Decision Directed Acyclic Graph (DDAG) and using active constraint for each SVM classifier. For k-class problem, it combines k(k-1)/2 two-class SVM classifiers, one for each pair of classes. In order to speed up the training and decision process of the classifier, we make three changes on the standard two-class classifiers, i.e. large margin, 2-norm squared for the error for the soft margin and active constraint. While in the testing phase, we use a rooted binary directed acyclic graph which has k(k-1)/2 internal nodes and k leaves. Computational experiment indicates that this is a simple and fast approach to generate multi-class SVM classifiers.
In this paper we investigate the control of a PR manipulator to targets that lie on the boundary of its workspace within finite time. This is achieved by introducing a boundary avoidance parameter, Ε, into potential ...
详细信息
ISBN:
(纸本)9810474806
In this paper we investigate the control of a PR manipulator to targets that lie on the boundary of its workspace within finite time. This is achieved by introducing a boundary avoidance parameter, Ε, into potential functions defined by constraint boundaries that are incorporated into a Liapunov function. We report and compare on the speed of convergence in two simulationsthat utilise the unique nature of the sliding mode surfaces in both Cartesian and polar formulations.
This paper treats weight distributions of the coset leaders of binary linear block codes. We first present a method for computing the weight distribution of the coset leaders of a given code using two tables each of w...
详细信息
This paper treats weight distributions of the coset leaders of binary linear block codes. We first present a method for computing the weight distribution of the coset leaders of a given code using two tables each of which stores the weights of the coset leaders of a related code of the code. Then, the weight distributions of the coset leaders of the (N,K) Reed-Muller codes, binary primitive BCH codes, and their extended codes with N ≥ 128 and 29 ≥ N - K ≥ 42 that are obtained by using the computing method are given.
In this paper we study the existence and uniqueness of a solution for minimization problems with generic increasing functions in an ordered Banach space X. The standard approaches are not suitable in such a setting. W...
详细信息
In this paper we study the existence and uniqueness of a solution for minimization problems with generic increasing functions in an ordered Banach space X. The standard approaches are not suitable in such a setting. We propose a new type of perturbation adjusted for the problem under consideration, prove the existence and point out sufficient conditions providing the uniqueness of a solution. These results are proved by assuming that the space X enjoys the following property: each decreasing norm-bounded sequence has a limit. We supply a counterexample, which shows that this property is essential and give a modification of obtained results for the space C(T), which does not possess this property.
暂无评论