Results 61 to 70 of about 328,340 (188)
Eigenvector Weighting Function in Face Recognition
Graph-based subspace learning is a class of dimensionality reduction technique in face recognition. The technique reveals the local manifold structure of face data that hidden in the image space via a linear projection.
Pang Ying Han +2 more
doaj +1 more source
Multiple model predictive control of robot manipulator
A multiple model predictive control method based on membership function was proposed according to nonlinear characteristics of robot manipulator. An appropriate scheduling variable was selected according to the characteristics of the robot manipulator ...
DU Jingjing +2 more
doaj +1 more source
Semi-Supervised Cross-Modal Retrieval Based on Discriminative Comapping
Most cross-modal retrieval methods based on subspace learning just focus on learning the projection matrices that map different modalities to a common subspace and pay less attention to the retrieval task specificity and class information. To address the
Li Liu, Xiao Dong, Tianshi Wang
doaj +1 more source
Structure-Based Subspace Method for Multi-Channel Blind System Identification
In this work, a novel subspace-based method for blind identification of multichannel finite impulse response (FIR) systems is presented. Here, we exploit directly the impeded Toeplitz channel structure in the signal linear model to build a quadratic form
Abed-Meraim, Karim +2 more
core +3 more sources
Posterior Shrinkage Towards Linear Subspaces
It is common to hold prior beliefs that are not characterized by points in the parameter space but instead are relational in nature and can be described by a linear subspace. While some previous work has been done to account for such prior beliefs, the focus has primarily been on point estimators within a regression framework.
openaire +3 more sources
Linear decision trees, subspace arrangements and Möbius functions [PDF]
Topological methods are described for estimating the size and depth of decision trees where a linear test is performed at each node. The methods are applied, among others, to the questions of deciding by a linear decision tree whether givennnreal numbers (1) somekkof them are equal, or (2) somekkof them are unequal.
Björner, Anders, Lovász, László
openaire +2 more sources
Sparse signal subspace decomposition based on adaptive over-complete dictionary
This paper proposes a subspace decomposition method based on an over-complete dictionary in sparse representation, called “sparse signal subspace decomposition” (or 3SD) method. This method makes use of a novel criterion based on the occurrence frequency
Hong Sun +2 more
doaj +1 more source
A Preconditioned Fast Collocation Method for a Linear Nonlocal Diffusion Model in Convex Domains
Recently, there are many papers dedicated to develop fast numerical methods for nonlocal diffusion and peridynamic models. However, these methods require the physical domain where we solve the governing equations is rectangular. To relax this restriction,
Xuhao Zhang, Aijie Cheng, Hong Wang
doaj +1 more source
Engineering Stable Discrete-Time Quantum Dynamics via a Canonical QR Decomposition
We analyze the asymptotic behavior of discrete-time, Markovian quantum systems with respect to a subspace of interest. Global asymptotic stability of subspaces is relevant to quantum information processing, in particular for initializing the system in ...
Bolognani, Saverio, Ticozzi, Francesco
core +2 more sources
Simultaneous Principal-Component Extraction with Application to Adaptive Blind Multiuser Detection
SIPEX-G is a fast-converging, robust, gradient-based PCA algorithm that has been recently proposed by the authors. Its superior performance in synthetic and real data compared with its benchmark counterparts makes it a viable alternative in applications
Erdogmus Deniz +3 more
doaj +1 more source

