This paper introduces a binary large margin classifier that approximates each class with an hyper disk constructed from its training samples. For any pair of classes approximated with hyper disks, there is a correspon...
详细信息
Ancient Chinese characters normally have complex structures which are composed of many strokes. Different characters may show a similar shape which results in unsatisfactory answers for their image retrieving using th...
详细信息
This paper introduces a binary large margin classifier that approximates each class with an hyper disk constructed from its training samples. For any pair of classes approximated with hyper disks, there is a correspon...
详细信息
This paper introduces a binary large margin classifier that approximates each class with an hyper disk constructed from its training samples. For any pair of classes approximated with hyper disks, there is a corresponding linear separating hyper plane that maximizes the margin between them, and this can be found by solving a convex program that finds the closest pair of points on the hyper disks. More precisely, the best separating hyper plane is chosen to be the one that is orthogonal to the line segment connecting the closest points on the hyper disks and at the same time bisects the line. The method is extended to the nonlinear case by using the kernel trick, and the multi-class classification problems are dealt with constructing and combining several binary classifiers as in Support Vector machine (SVM) classifier. The experiments on several databases show that the proposed method compares favorably to other popular large margin classifiers.
The phenomenon of person name ambiguity is widespread on web pages in that one name may be used by different people. It is important to uniquely identify the given person on the web. In this paper, the method Baidu-PN...
详细信息
The phenomenon of person name ambiguity is widespread on web pages in that one name may be used by different people. It is important to uniquely identify the given person on the web. In this paper, the method Baidu-PND is proposed by the authors. It is an unsupervised name disambiguation method based on Baidu Encyclopedia. We extract three features including background knowledge, contextual feature and Related-Set of the characters from the online Baidu Encyclopedia. The weights of the features are studied by logistic regression algorithm. Then we make a linear fusion of the features. The maximum combined value is selected as the correct person on web pages. Experiments are conducted to measure the performance of Baidu-PND, which show that the performance is higher than we expected, validating its feasibility and effectiveness for person name disambiguation on web pages. And, Baidu-PND is a new method for knowledge mining based on Baidu Encyclopedia.
In computer games, high-quality pathfinding algorithms are important to bring satisfactory experiences to the players, which may improve the playability of computer game. The method of KM-A* belongs to hierarchical pa...
详细信息
In computer games, high-quality pathfinding algorithms are important to bring satisfactory experiences to the players, which may improve the playability of computer game. The method of KM-A* belongs to hierarchical pathfinding, which incorporates the information of obstacle distribution when partitioning game maps using K-means clustering. This algorithm reduced unnecessary storage and unnatural paths in some open areas. However, the found path by KM-A* is very unstable and the quality closely depends on the clustering results. In this paper, we proposed an improved KM-A* algorithm, which aims to enhance the stability and quality of pathfinding. First, an agglomerative hierarchical clustering algorithm is used to determine the initial cluster centers, and K-Means algorithm is then applied to cluster obstacle nodes with k values which can possibly generate best cluster categories on game maps. Secondly, the strengthened form of DB Index criteria is defined by adding impact factors to the standard DB Index criteria to measure the quality of clustering results. Finally the best clustering is selected based on this new DB Index, which will provide a guidance to further generate an abstract map for on-line pathfinding. Experiments are conducted to compare the performance of KM-A* and improved KM-A*, which show that the latter can find more stable paths and use less on-line processing time.
In this paper, we propose a new L1-Norm-Based two-dimensional locality preserving projections (2DLPP-L1). Traditional 2D-LPP can preserve local structure and extract feature directly form matrices, which shows great a...
详细信息
In this paper, we propose a new L1-Norm-Based two-dimensional locality preserving projections (2DLPP-L1). Traditional 2D-LPP can preserve local structure and extract feature directly form matrices, which shows great advantages. However, it is based on L2 norm. It is well known that L2-norm-based criterion is sensitive to outliers. We generalize 2D-LPP to its corresponding L1-norm-based version, i.e. 2DLPP-L1, which is more robust against outliers. To evaluate the performance of 2DLPP-L1, several experiments are performed on the ORL face databases. Experimental results demonstrate that 2DLPP-L1 has better performance than its related methods.
Content-based image retrieval has become an important research area. In order to extract the semantic information within the user’s query concept, we propose an image retrieval method based on regional objects. It is...
详细信息
Content-based image retrieval has become an important research area. In order to extract the semantic information within the user’s query concept, we propose an image retrieval method based on regional objects. It is regarded as the pre-processing of a given query image, that is to say, when we get a query image, it needs us to segment the regional object which is useful or interesting, and retrieve according to the segmented fragment. Moreover, we propose a correlation coefficient based color representation. Experimental results demonstrate that our proposed approach performs much better than its related methods. Furthermore, the presented system has a high retrieval precision and keeps color consistency between the similarity images.
The radial basis function network (RBFN) has been widely used in various fields such as function regression, pattern recognition, and error detection, etc. However, the structural parameters of RBFN including the numb...
详细信息
The radial basis function network (RBFN) has been widely used in various fields such as function regression, pattern recognition, and error detection, etc. However, the structural parameters of RBFN including the number of hidden units, centers vectors, and widths (variances) are one of the most important issues when training a RBFN, which greatly affect the performance of RBFN. So, the objective of this paper is to construct an elementary survey about this problem. Firstly, the fundamental knowledge and notations of RBFN is introduced. Secondly, we summarize most existing network structure initialization methods for RBFN and categorize them into four goups. Then some typical appraoches for each category are introduced and discussed. The disadvantages and virtues for parts of methods are also introduced. Finally, the paper is concluded with a discussion of current difficulties and possible future directions about RBFN architecture selection.
Based on a knowledge base, we propose a new method to realize free-style Chinese keyword search over relational databases. Firstly, an index (also called knowledge base) is built by extracting related information of C...
详细信息
Printed mathematical formulas edited by different soft wares have some obvious differences. To distinguish it before recognition is beneficial to the formula recognition. Based on the statistical analysis to the chara...
详细信息
暂无评论