首页> 外文期刊>IEEE Transactions on Signal Processing >Rank Estimation and Redundancy Reduction of High-Dimensional Noisy Signals With Preservation of Rare Vectors
【24h】

Rank Estimation and Redundancy Reduction of High-Dimensional Noisy Signals With Preservation of Rare Vectors

机译:保留稀有向量的高维噪声信号的秩估计和冗余减少

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

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. For example, when applying redundancy reduction techniques to hyperspectral images, it is essential to preserve anomaly pixels for target detection purposes. Since rare-vectors contribute weakly to the -norm of the signal as compared to the noise, -based criteria are unsatisfactory for obtaining a good representation of these vectors. The proposed approach combines and norms for both signal-subspace and rank determination and considers two aspects: One aspect deals with signal-subspace estimation aiming to minimize the maximum of data-residual -norms, denoted as , for a given rank conjecture. The other determines whether the rank conjecture is valid for the obtained signal-subspace by applying Extreme Value Theory results to model the distribution of the noise -norm. These two operations are performed alternately using a suboptimal greedy algorithm, which makes the proposed approach practically plausible. The algorithm was applied on both synthetically simulated data and on a real hyperspectral image producing better results than common -based methods.
机译:在本文中,我们解决了可能会包含异常(稀有)矢量的高维噪声信号的冗余减少问题。例如,将冗余减少技术应用于高光谱图像时,必须保留异常像素以用于目标检测。由于与噪声相比,稀有向量对信号的范数的贡献微弱,因此基于-的标准对于获得这些向量的良好表示并不令人满意。所提出的方法结合并规范了信号子空间和秩确定两者,并考虑了两个方面:一个方面涉及信号子空间估计,旨在最小化给定秩猜想的最大数据残差范数(表示为)。另一个通过应用极值理论结果对噪声范数的分布进行建模,确定秩猜想对于所获得的信号子空间是否有效。这两个操作是使用次优贪婪算法交替执行的,这使得所提出的方法切实可行。将该算法应用于合成模拟数据和真实高光谱图像上,均比基于常规方法的结果更好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号