Skip to main content

Colored Subspace Analysis

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4666))

Abstract

With the advent of high-throughput data recording methods in biology and medicine, the efficient identification of meaningful subspaces within these data sets becomes an increasingly important challenge. Classical dimension reduction techniques such as principal component analysis often do not take the large statistics of the data set into account, and thereby fail if the signal space is for example of low power but meaningful in terms of some other statistics. With ‘colored subspace analysis’, we propose a method for linear dimension reduction that evaluates the time structure of the multivariate observations. We differentiate the signal subspace from noise by searching for a subspace of non-trivially autocorrelated data; algorithmically we perform this search by joint low-rank approximation. In contrast to blind source separation approaches we however do not require the existence of sources, so the model is applicable to any wide-sense stationary time series without restrictions. Moreover, since the method is based on second-order time structure, it can be efficiently implemented even for large dimensions. We conclude with an application to dimension reduction of functional MRI recordings.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Oja, E.: Nonlinear pca criterion and maximum likelihood in independent component analysis. In: Proc. ICA 1999, Aussois, France, pp. 143–148 (1999)

    Google Scholar 

  2. Mika, S., Schölkopf, B., Smola, A.J., Müller, K., Scholz, M., Rätsch, G.: Kernel PCA and de-noising in feature spaces. In: Kearns, M.S., Solla, S.A., Cohn, D.A (eds.) Advances in Neural Information Processing Systems, vol. 11, MIT Press, Cambridge (1999)

    Google Scholar 

  3. Tenenbaum, J., de Silva, V., Langford, J.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000)

    Article  Google Scholar 

  4. Blanchard, G., Kawanabe, M., Sugiyama, M., Spokoiny, V., Müller, K.: In search of non-gaussian components of a high-dimensional distribution. Journal of Machine Learning Research 7, 247–282 (2006)

    Google Scholar 

  5. Theis, F., Kawanabe, M.: Uniqueness of non-gaussian subspace analysis. In: Rosca, J., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds.) ICA 2006. LNCS, vol. 3889, pp. 917–925. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Kawanabe, M., Theis, F.: Estimating non-gaussian subspaces by characteristic functions. In: Rosca, J., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds.) ICA 2006. LNCS, vol. 3889, pp. 157–164. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Abed-Meraim, K., Belouchrani, A.: Algorithms for joint block diagonalization. In: Proc. EUSIPCO 2004, Vienna, Austria, pp. 209–212 (2004)

    Google Scholar 

  8. Févotte, C., Theis, F.: Orthonormal approximate joint block-diagonalization. Technical report, GET/Télécom Paris (2007)

    Google Scholar 

  9. Tong, L., Liu, R.W., Soon, V., Huang, Y.F.: Indeterminacy and identifiability of blind identification. IEEETransactions on Circuits and Systems 38, 499–509 (1991)

    Article  MATH  Google Scholar 

  10. Wiskott, L., Sejnowski, T.: Slow feature analysis: Unsupervised learning of invariances. Neural Computation 14, 715–770 (2002)

    Article  MATH  Google Scholar 

  11. Belouchrani, A., Meraim, K.A., Cardoso, J.F., Moulines, E.: A blind source separation technique based on second order statistics. IEEE Transactions on Signal Processing 45(2), 434–444 (1997)

    Article  Google Scholar 

  12. Ziehe, A., Mueller, K.R.: TDSEP – an efficient algorithm for blind separation using time structure. In: Niklasson, L., Bodén, M., Ziemke, T. (eds.) Proc. of ICANN 1998, Skövde, Sweden, pp. 675–680. Springer, Berlin (1998)

    Google Scholar 

  13. Müller, K.R., Philips, P., Ziehe, A.: Jadetd: Combining higher-order statistics and temporal information for blind source separation (with noise). In: Proc. of ICA 1999, Aussois, France, pp. 87–92 (1999)

    Google Scholar 

  14. Theis, F., Inouye, Y.: On the use of joint diagonalization in blind signal processing. In: Proc. ISCAS 2006, Kos, Greece (2006)

    Google Scholar 

  15. Wismüller, A., Lange, O., Dersch, D., Leinsinger, G., Hahn, K., Pütz, B., Auer, D.: Cluster analysis of biomedical image time-series. International Journal on Computer Vision 46, 102–128 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mike E. Davies Christopher J. James Samer A. Abdallah Mark D Plumbley

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Theis, F.J., Kawanabe, M. (2007). Colored Subspace Analysis. In: Davies, M.E., James, C.J., Abdallah, S.A., Plumbley, M.D. (eds) Independent Component Analysis and Signal Separation. ICA 2007. Lecture Notes in Computer Science, vol 4666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74494-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74494-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74493-1

  • Online ISBN: 978-3-540-74494-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics