Results 31 to 40 of about 274,981 (281)
Multiple pattern classification by sparse subspace decomposition
, 2009 A robust classification method is developed on the basis of sparse subspace decomposition. This method tries to decompose a mixture of subspaces of unlabeled data (queries) into class subspaces as few as possible.
Sakai, Tomoya
core +1 more source
Adaptive Subspace Method for Phase Noise Estimation in CO-OFDM Systems
IEEE Access, 2018 In this paper, a blind phase noise estimation method for a coherent optical orthogonal frequency-division multiplexing (CO-OFDM) system is considered. Based on the subspace approach, a simple and robust method is proposed to adaptively estimate and track
Muyiwa B. Balogun +2 more
doaj +1 more source
A nested Krylov subspace method to compute the sign function of large complex matrices [PDF]
, 2011 We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the overlap Dirac operator at both zero and nonzero baryon density.
Bloch +22 more
core +1 more source
Speech Denoising in White Noise Based on Signal Subspace Low-rank Plus Sparse Decomposition
MATEC Web of Conferences, 2017 In this paper, a new subspace speech enhancement method using low-rank and sparse decomposition is presented. In the proposed method, we firstly structure the corrupted data as a Toeplitz matrix and estimate its effective rank for the underlying human ...
yuan Shuai, Sun Cheng-li
doaj +1 more source
Nihon Kikai Gakkai ronbunshu, 2015 The flatness of the metal thin plate shape is required in the production lines. Though, the convenient method for measuring small buckles of the thin plate has not been established. The tension distribution corresponding to the strain distribution occurs
Hirotoshi ARIHARA +2 more
doaj +1 more source
Cone-restricted subspace methods [PDF]
2008 19th International Conference on Pattern Recognition, 2008 In pattern recognition, feature vectors are occasionally subject to non-negative constraints. This characteristic can be expressed by a cone in feature vector space. In this paper, we propose cone-restricted subspace methods. The proposed methods admit the scaling and additivity of vectors as well as ordinary subspace methods; in addition, vectors can ...
Takumi Kobayashi, Nobuyuki Otsu
openaire +1 more source
Tongxin xuebao, 2021 Considering the impact of high dimensional data redundancy and noise interference on multiview subspace clustering, a robust multiview subspace clustering method based on multi-kernel low redundancy representation learning was proposed.Firstly, by ...
Ao LI +5 more
doaj +2 more sources
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
, 2016 State-of-the-art subspace clustering methods are based on expressing each data point as a linear combination of other data points while regularizing the matrix of coefficients with $\ell_1$, $\ell_2$ or nuclear norms.
Li, Chun-Guang +3 more
core +1 more source
, 2020 This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed.
Golestani, S. Jamaloddin +1 more
core +1 more source
Imaging of Biphoton States: Fundamentals and Applications
Advanced Functional Materials, EarlyView.Quantum states of two photons exhibit a rich polarization and spatial structure, which provides a fundamental resource of strongly correlated and entangled states. This review analyzes the physics of these intriguing properties and explores the various techniques and technologies available to measure them, including the state of the art of their ...
Alessio D'Errico, Ebrahim Karimi
wiley +1 more source