The Experts below are selected from a list of 466425 Experts worldwide ranked by ideXlab platform
Robert P W Duin - One of the best experts on this subject based on the ideXlab platform.
-
support vector domain Description
Pattern Recognition Letters, 1999Co-Authors: David M J Tax, Robert P W DuinAbstract:This paper shows the use of a data domain Description Method, inspired by the support vector machine by Vapnik, called the support vector domain Description (SVDD). This data Description can be used for novelty or outlier detection. A spherically shaped decision boundary around a set of objects is constructed by a set of support vectors describing the sphere boundary. It has the possibility of transforming the data to new feature spaces without much extra computational cost. By using the transformed data, this SVDD can obtain more flexible and more accurate data Descriptions. The error of the first kind, the fraction of the training objects which will be rejected, can be estimated immediately from the Description without the use of an independent test set, which makes this Method data eAcient. The support vector domain Description is compared with other outlier detection Methods on real data. ” 1999 Elsevier Science B.V. All rights reserved.
X U Xiaoping - One of the best experts on this subject based on the ideXlab platform.
-
comparative study of some Description Method of natural scenery based on fractal
Computer Engineering and Design, 2008Co-Authors: X U XiaopingAbstract:Describing natural scenery is still a challenge topic in computer graphics.Having studied three Description Methods of natural scenery based on fractal i.e.recursive Method,L-system Method and IFS Method.Three kinds of Methods got a satisfied experiment results.Simulation results are connected with characters of concrete scenery,the more complex features,its increasingly more sophis-ticated structure,the more self-similar,the better simulation effects,and the higher fidelity.Among them,the IFS Method is the same with the scenery which have more detail structure,the L-system Method is the same with the scenery whose grow regulation are analy-sissitus,recursive Method is the same with the scenery which are strictly self-similar.
-
study of Description Method of natural scenery based on fractal
Computer Simulation, 2007Co-Authors: X U XiaopingAbstract:The Description of natural scenery has the extremely vital significance in the computer graphics field.The Description Methods of natural scenery was studied based on fractal,that is,recursive Method,L-system Method,IFS and IFS Description Method was put forward based on sine or cosine.This Method overcomes angularity and consistency of recursive Method,L-system Method and IFS,and the variety of fractal sculpting consequence can be added and the basis for the later research and the application was provided.
Melih Ozlen - One of the best experts on this subject based on the ideXlab platform.
-
a tree traversal algorithm for decision problems in knot theory and 3 manifold topology
Algorithmica, 2013Co-Authors: Benjamin A Burton, Melih OzlenAbstract:In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double Description Method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double Description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it enjoys a number of advantages over the double Description Method: incremental output, significantly lower time and space complexity, and a natural suitability for parallelisation. Experimental comparisons of running times are included.
-
a tree traversal algorithm for decision problems in knot theory and 3 manifold topology
Algorithmica, 2013Co-Authors: Benjamin A Burton, Melih OzlenAbstract:In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double Description Method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double Description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it enjoys a number of advantages over the double Description Method: incremental output, significantly lower time and space complexity, and a natural suitability for parallelisation. Experimental comparisons of running times are included.
-
a tree traversal algorithm for decision problems in knot theory and 3 manifold topology
Symposium on Computational Geometry, 2011Co-Authors: Benjamin A Burton, Melih OzlenAbstract:In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double Description Method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double Description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it enjoys a number of advantages over the double Description Method: incremental output, significantly lower time and space complexity, and a natural suitability for parallelisation.
David M J Tax - One of the best experts on this subject based on the ideXlab platform.
-
support vector domain Description
Pattern Recognition Letters, 1999Co-Authors: David M J Tax, Robert P W DuinAbstract:This paper shows the use of a data domain Description Method, inspired by the support vector machine by Vapnik, called the support vector domain Description (SVDD). This data Description can be used for novelty or outlier detection. A spherically shaped decision boundary around a set of objects is constructed by a set of support vectors describing the sphere boundary. It has the possibility of transforming the data to new feature spaces without much extra computational cost. By using the transformed data, this SVDD can obtain more flexible and more accurate data Descriptions. The error of the first kind, the fraction of the training objects which will be rejected, can be estimated immediately from the Description without the use of an independent test set, which makes this Method data eAcient. The support vector domain Description is compared with other outlier detection Methods on real data. ” 1999 Elsevier Science B.V. All rights reserved.
Benjamin A Burton - One of the best experts on this subject based on the ideXlab platform.
-
a tree traversal algorithm for decision problems in knot theory and 3 manifold topology
Algorithmica, 2013Co-Authors: Benjamin A Burton, Melih OzlenAbstract:In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double Description Method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double Description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it enjoys a number of advantages over the double Description Method: incremental output, significantly lower time and space complexity, and a natural suitability for parallelisation. Experimental comparisons of running times are included.
-
a tree traversal algorithm for decision problems in knot theory and 3 manifold topology
Algorithmica, 2013Co-Authors: Benjamin A Burton, Melih OzlenAbstract:In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double Description Method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double Description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it enjoys a number of advantages over the double Description Method: incremental output, significantly lower time and space complexity, and a natural suitability for parallelisation. Experimental comparisons of running times are included.
-
a tree traversal algorithm for decision problems in knot theory and 3 manifold topology
Symposium on Computational Geometry, 2011Co-Authors: Benjamin A Burton, Melih OzlenAbstract:In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double Description Method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double Description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it enjoys a number of advantages over the double Description Method: incremental output, significantly lower time and space complexity, and a natural suitability for parallelisation.
