Sequential subspace finding: a new algorithm for learning low-dimensional linear subspaces

Abstract : In this paper we propose a new algorithm for learning lowdimensional linear subspaces. Our proposed algorithm performs by sequentially finding some low-dimensional subspaces on which a set of training data lies. Each subspace is found in such a way that the number of signals lying on (or near to) it is maximized. Once we found a subset of the training data that is sufficiently close to a subspace, then we omit these signals from the set of training signals and repeat the procedure for the remaining signals until all training signals are assigned to a subspace. This data reduction procedure results in a significant improvement to the runtime of our algorithm. We then propose a robust version of the algorithm to address the situation in which training signals are contaminated by additive white Gaussian noise. Our simulations on synthetic data and image denoising problem show the applicability and the promising performance of our algorithm.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Christian Jutten <>
Submitted on : Friday, September 27, 2013 - 4:02:58 PM
Last modification on : Tuesday, July 9, 2019 - 1:21:27 AM
Long-term archiving on : Friday, April 7, 2017 - 4:10:51 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00867075, version 1


Mostafa Sadeghi, Mohsen Joneidi, Massoud Babaie-Zadeh, Christian Jutten. Sequential subspace finding: a new algorithm for learning low-dimensional linear subspaces. 21th European Signal Processing Conference (EUSIPCO-2013), Sep 2013, Marrakech, Morocco. pp.EUSIPCO 2013 1569746207. ⟨hal-00867075⟩



Record views


Files downloads