Detection of a signal in linear subspace with bounded mismatch [PDF]
, 2006 We consider the problem of detecting a signal of interest in a background of noise with unknown covariance matrix, taking into account a possible mismatch between the actual steering vector and the presumed one.
Besson, Olivier
core +1 more source
A real negative selection algorithm with evolutionary preference for anomaly detection
Open Physics, 2017 Traditional real negative selection algorithms (RNSAs) adopt the estimated coverage (c0) as the algorithm termination threshold, and generate detectors randomly.
Yang Tao, Chen Wen, Li Tao
doaj +1 more source
The research of improved MUSIC algorithm based on far field sound source localization
Dianzi Jishu Yingyong, 2018 Systemic research has been done on the thesis of far field sound source localization combined characteristics of the speech signal in this paper. An improved MUSIC algorithm is proposed based on the traditional MUSIC algorithm in far-field of microphone ...
Deng Yanrong +5 more
doaj +1 more source
A Subspace Approach to Sparse Sampling Based Data Gathering in Wireless Sensor Networks
Sensors, 2020 Data gathering is an essential concern in Wireless Sensor Networks (WSNs). This paper proposes an efficient data gathering method in clustered WSNs based on sparse sampling to reduce energy consumption and prolong the network lifetime. For data gathering
Jingfei He +3 more
doaj +1 more source
Slow feature subspace: A video representation based on slow feature analysis for action recognition
Machine Learning with Applications, 2023 This paper proposes a new video representation for subspace-based action recognition. Traditional subspace-based methods represent a video as a subspace by applying principal component analysis (PCA) to its frames. However, this subspace might lead to an
Suzana Rita Alves Beleza +3 more
doaj +1 more source
Journal of Algebra, 2000 For a finite-dimensional algebra \(A\) over an infinite field \(K\), the subspace semigroup \({\mathcal S}(A)\) consists of all subspaces of \(A\) with operation \(V*W=\text{lin}_KVW\), the linear span of \(VW\) over \(K\). The authors describe the structure of \({\mathcal S}(A)\), showing in particular that, similar to any linear algebraic semigroup, \
OkniĊski, Jan, Putcha, Mohan S.
openaire +2 more sources
Minimum mean square distance estimation of a subspace [PDF]
, 2011 We consider the problem of subspace estimation in a Bayesian setting. Since we are operating in the Grassmann manifold, the usual approach which consists of minimizing the mean square error (MSE) between the true subspace U and its estimate U may not be ...
Jean-Yves Tourneret +5 more
core +1 more source
Adaptive detection of a signal known only to lie on a line in a known subspace, when primary and secondary data are partially homogeneous [PDF]
, 2006 This paper deals with the problem of detecting a signal, known only to lie on a line in a subspace, in the presence of unknown noise, using multiple snapshots in the primary data.
Kraut, Shawn +5 more
core +1 more source
High Density Subspace Clustering Algorithm for High Dimensional Data
Journal of Harbin University of Science and Technology, 2020 Highdimensional data have the characteristics of sparsity and vulnerability to dimension disaster, which makes it is difficult to ensure the precision and efficiency of high dimensional data clustering Therefore the method of subspace clustering is ...
WAN Jing +3 more
doaj +1 more source
Fusing Local and Global Information for One-Step Multi-View Subspace Clustering
Applied Sciences, 2022 Multi-view subspace clustering has drawn significant attention in the pattern recognition and machine learning research community. However, most of the existing multi-view subspace clustering methods are still limited in two aspects.
Yiqiang Duan +3 more
doaj +1 more source