Search results for "basis"
showing 10 items of 760 documents
H2O, H2, HF, F2 and F2O nuclear magnetic shielding constants and indirect nuclear spin–spin coupling constants (SSCCs) in the BHandH/pcJ‐n and BHandH…
2009
Good performance of segmented contracted basis sets XZP, where X = D, T, Q and 5, for obtaining H2O, H2, HF, F2 and F2O nuclear isotropic shielding constants in the BHandH Kohn–Sham basis set limit was shown. The results of two‐ and three‐parameter complete basis set limit extrapolation schemes were compared with experimental results, earlier literature data and benchmark ab initio results. Similar convergence patterns of shieldings obtained from calculations using general purpose XZP basis sets and from polarization‐consistent basis sets pcS‐n and pcJ‐n, where n = 0, 1, 2, 3 and 4, designed to accurately predict magnetic properties were observed. On the contrary, the SSCCs were more sensit…
Polynomial Spline-Wavelets
2015
This chapter presents wavelets in the spaces of polynomial splines. The wavelets’ design is based on the Zak transform, which provides an integral representation of spline-wavelets. The exponential wavelets which participate in the integral representation are counterparts of the exponential splines that were introduced in Chap. 4. Fast algorithms for the wavelet transforms of splines are presented. Generators of spline-wavelet spaces are described, such as the B-wavelets and their duals and the Battle-Lemarie wavelets whose shifts form orthonormal bases of the spline-wavelet spaces.
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS
2010
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…
Unsupervised learning of category-specific symmetric 3D keypoints from point sets
2020
Lecture Notes in Computer Science, 12370
Spectral clustering with the probabilistic cluster kernel
2015
Abstract This letter introduces a probabilistic cluster kernel for data clustering. The proposed kernel is computed with the composition of dot products between the posterior probabilities obtained via GMM clustering. The kernel is directly learned from the data, is parameter-free, and captures the data manifold structure at different scales. The projections in the kernel space induced by this kernel are useful for general feature extraction purposes and are here exploited in spectral clustering with the canonical k-means. The kernel structure, informative content and optimality are studied. Analysis and performance are illustrated in several real datasets.
Fuzzy sigmoid kernel for support vector classifiers
2004
This Letter proposes the use of the fuzzy sigmoid function presented in (IEEE Trans. Neural Networks 14(6) (2003) 1576) as non-positive semi-definite kernel in the support vector machines framework. The fuzzy sigmoid kernel allows lower computational cost, and higher rate of positive eigenvalues of the kernel matrix, which alleviates current limitations of the sigmoid kernel.
Feature extraction from remote sensing data using Kernel Orthonormalized PLS
2007
This paper presents the study of a sparse kernel-based method for non-linear feature extraction in the context of remote sensing classification and regression problems. The so-called kernel orthonormalized PLS algorithm with reduced complexity (rKOPLS) has two core parts: (i) a kernel version of OPLS (called KOPLS), and (ii) a sparse (reduced) approximation for large scale data sets, which ultimately leads to rKOPLS. The method demonstrates good capabilities in terms of expressive power of the extracted features and scalability.
Three-dimensional object detection under arbitrary lighting conditions
2006
A novel method of 3D object recognition independent of lighting conditions is presented. The recognition model is based on a vector space representation using an orthonormal basis generated by the Lambertian reflectance functions obtained with distant light sources. Changing the lighting conditions corresponds to multiplying the elementary images by a constant factor and because of that, all possible lighting views will be elements that belong to that vector space. The recognition method proposed is based on the calculation of the angle between the vector associated with a certain illuminated 3D object and that subspace. We define the angle in terms of linear correlations to get shift and i…
A novel method for network intrusion detection based on nonlinear SNE and SVM
2017
In the case of network intrusion detection data, pre-processing techniques have been extensively used to enhance the accuracy of the model. An ideal intrusion detection system (IDS) is one that has appreciable detection capability overall the group of attacks. An open research problem of this area is the lower detection rate for less frequent attacks, which result from the curse of dimensionality and imbalanced class distribution of the benchmark datasets. This work attempts to minimise the effects of imbalanced class distribution by applying random under-sampling of the majority classes and SMOTE-based oversampling of minority classes. In order to alleviate the issue arising from the curse…
Semisupervised kernel orthonormalized partial least squares
2012
This paper presents a semisupervised kernel orthonormalized partial least squares (SS-KOPLS) algorithm for non-linear feature extraction. The proposed method finds projections that minimize the least squares regression error in Hilbert spaces and incorporates the wealth of unlabeled information to deal with small size labeled datasets. The method relies on combining a standard RBF kernel using labeled information, and a generative kernel learned by clustering all available data. The positive definiteness of the kernels is proven, and the structure and information content of the derived kernels is studied. The effectiveness of the proposed method is successfully illustrated in standard UCI d…