Anomaly Preserving $\ell _{\scriptscriptstyle 2,\infty }$ -Optimal Dimensionality Reduction Over a Grassmann Manifold

2010 
In this paper, we address the problem of redundancy reduction of high-dimensional noisy signals that may contain anomaly (rare) vectors, which we wish to preserve. Since anomaly data vectors contribute weakly to the l 2 -norm of the signal as compared to the noise, l 2 -based criteria are unsatisfactory for obtaining a good representation of these vectors. As a remedy, a new approach, named Min-Max-SVD (MX-SVD) was recently proposed for signal-subspace estimation by attempting to minimize the maximum of data-residual l 2 -norms, denoted as l 2,l and designed to represent well both abundant and anomaly measurements. However, the MX-SVD algorithm is greedy and only approximately minimizes the proposed l 2,l -norm of the residuals. In this paper we develop an optimal algorithm for the minization of the l 2,l -norm of data misrepresentation residuals, which we call Maximum Orthogonal complements Optimal Subspace Estimation (MOOSE). The optimization is performed via a natural conjugate gradient learning approach carried out on the set of n dimensional subspaces in IR m , m ≫ n , which is a Grassmann manifold. The results of applying MOOSE, MX-SVD, and l 2 - based approaches are demonstrated both on simulated and real hyperspectral data.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    22
    References
    8
    Citations
    NaN
    KQI
    []