 |
Université de Provence - Aix-Marseille I Hyper Articles en Ligne |
 |
|
Université de Provence - Aix-Marseille I Hyper Articles en Ligne |
|
| HAL : hal-00459142, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
| International Conference on Image Processing 2009, Egypt (2009) |
|
|
|
|
| Fast subspace-based tensor data filtering |
|
|
| Julien Marot 1Caroline Fossati 1 |
|
|
| (11/11/2009) |
|
|
|
| Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For this, the processed tensor is flattened along each mode successively, and singular value decomposition of the flattened matrix is classically performed. Data projection on the dominant singular vectors results in noise reduction. The numerical cost of SVD is elevated. Now, tensor processing methods include an ALS (Alternating Least Squares) loop, which implies that a large number of SVDs are performed. Fixed point algorithm estimates an a priori fixed number of singular vectors from a matrix. In this paper, we generalize fixed point algorithm as a higher-order fixed point algorithm to the estimation of only the required dominant singular vectors in a tensor processing framework. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Institut FRESNEL (IF) |
|
|
|
CNRS : UMR6133 – Université de Provence - Aix-Marseille I – Université Paul Cézanne - Aix-Marseille III – Ecole Centrale de Marseille |
|
|
|
|
|
|
|
|
|
| Domaine | : | Sciences de l'ingénieur/Traitement du signal et de l'image Informatique/Traitement du signal et de l'image |
| hal-00459142, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00459142 | |
| oai:hal.archives-ouvertes.fr:hal-00459142 | |
| Contributeur : Salah Bourennane | |
| Soumis le : Mardi 23 Février 2010, 12:43:31 | |
| Dernière modification le : Vendredi 26 Février 2010, 10:46:55 | |
