Results 121 to 130 of about 1,611 (136)
Some of the next articles are maybe not open access.
Target detection and identification using canonical correlation analysis and subspace partitioning
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008We present a data-driven approach for target detection and identification based on a linear mixture model. Our aim is to determine the existence of certain targets in a mixture without specific information on the targets or the background, and to identify the targets from a given library.
Wei Wang 0018, Tülay Adali, Darren Emge
openaire +1 more source
Canonical angles, subspace partitioning, and hyrbrid wavelet packets
SPIE Proceedings, 2000In previous work, hybrid wavelet packets were introduced as a generalization of wavelet packets in which the choice of quadrature mirror filter (QMF) is selected adaptively within the wavelet packet analysis. This was motivated by the observation that for certain classes of signals, the choice of appropriate QMF is not only signal dependent, but may be
openaire +1 more source
Random subspace method based on Canonical Correlation Analysis
2010 3rd International Congress on Image and Signal Processing, 2010Random subspace method (RSM) is a successful ensemble construction technique for classification and its success mainly lies in that it could generate quite diverse component classifiers. However, the recognition accuracy of the component classifier is often insufficient due to its random selection of inputs.
openaire +1 more source
Recursive Canonical Variate Subspace Algorithm
SICE Annual Conference Program and Abstracts, 2004Delgado, Catarina J. M. +1 more
openaire +1 more source
A Decomposition Theorem for the Translation-Invariant Subspace of a Canonical Differential Operator
1972Let H be a unitary space of even dimension 2 m, and let y be a linear operator in H for which y* = − y, y2 = − I. The orthogonal projectors P± = 1/2. (I ± i y) define two subspaces H+ and H− in H. We shall assume that H+. = dim H− = m. We denote by H0 a certain subspace in H of dimension m, whose elements satisfy the relation (y f, g) = 0, f, g ∈ H0.
openaire +1 more source
Multi-view Fractional Deep Canonical Correlation Analysis for Subspace Clustering
2021Chao Sun +5 more
openaire +1 more source

