{'fraction_non_alphanumeric': 0.01006036217303823, 'fraction_numerical': 0.0, 'mean_word_length': 5.633333333333334, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Bayesian subspace estimation using CS decomposition

Subspace estimation using relatively few samples is a frequently encountered problem in numerous applications, including hyperspectral imagery the target application of this paper. We address this problem in a Bayesian framework assuming that some rough prior knowledge about the subspace is available. Our approach is based on the CS decomposition of an orthogonal matrix whose columns span the subspace of interest. This parametrization only involves mild assumptions about the distribution of the angles between the actual subspace and the prior subspace, and is intuitively appealing. We derive the posterior distribution for the matrices involved in the CS decomposition and the angles between subspaces, and we propose a Gibbs sampling scheme to compute the minimum mean-square distance estimator of the subspace of interest. The estimator accuracy is evaluated through numerical simulations and tested against real hyperspectral data.