Blessing of randomness against the curse of dimensionality

Skip to Navigation

EarlyView Article

  • Published: Nov 9, 2017
  • Author: Sergey Kucheryavskiy

Modern hyperspectral images, especially acquired in remote sensing and from on‐field measurements, can easily contain from hundreds of thousands to several millions of pixels. This often leads to a quite long computational time when, eg, the images are decomposed by Principal Component Analysis (PCA) or similar algorithms. In this paper, we are going to show how randomization can tackle this problem. The main idea is described in detail by Halko et al in 2011 and can be used for speeding up most of the low‐rank matrix decomposition methods. The paper explains this approach using visual interpretation of its main steps and shows how the use of randomness influences the speed and accuracy of PCA decomposition of hyperspectral images.

Social Links

Share This Links

Bookmark and Share


Suppliers Selection
Societies Selection

Banner Ad

Click here to see
all job opportunities

Most Viewed

Copyright Information

Interested in spectroscopy? Visit our sister site

Copyright © 2018 John Wiley & Sons, Inc. All Rights Reserved