nips nips2009 nips2009-137 nips2009-137-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Benjamin Culpepper, Bruno A. Olshausen
Abstract: We describe an unsupervised manifold learning algorithm that represents a surface through a compact description of operators that traverse it. The operators are based on matrix exponentials, which are the solution to a system of first-order linear differential equations. The matrix exponents are represented by a basis that is adapted to the statistics of the data so that the infinitesimal generator for a trajectory along the underlying manifold can be produced by linearly composing a few elements. The method is applied to recover topological structure from low dimensional synthetic data, and to model local structure in how natural images change over time and scale. 1
[1] VanGool, L., Moons, T., Pauwels, E. & Oosterlinck, A. (1995) Vision and Lie’s approach to invariance. Image and Vision Computing, 13(4): 259-277.
[2] Miao, X. & Rao, R.P.N. (2007) Learning the Lie groups of visual invariance. Neural Computation, 19(10): 2665-2693.
[3] Rao, R.P.N & Ruderman D.L. (1999) Learning Lie Groups for Invariant Visual Perception. Advances in Neural Information Processing Systems, 11:810-816. Cambridge, MA: MIT Press.
[4] Grimes, D.B., & Rao, R.P.N. (2002). A Bilinear Model for Sparse Coding. Advances in Neural Information Processing Systems, 15. Cambridge, MA: MIT Press.
[5] Olshausen, B.A., Cadieu, C., Culpepper, B.J. & Warland, D. (2007) Bilinear Models of Natural Images. SPIE Proceedings vol. 6492: Human Vision Electronic Imaging XII (B.E. Rogowitz, T.N. Pappas, S.J. Daly, Eds.), Jan 28 - Feb 1, 2007, San Jose, California.
[6] Tenenbaum, J. B. & Freeman, W. T. (2000) Separating style and content with bilinear models. Neural Computation, 12(6):1247-1283.
[7] Roweis, S. & Saul, L. (2000) Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500): 2323-2326.
[8] Weinberger, K. Q. & Saul, L. K. (2004) Unsupervised learning of image manifolds by semidefinite programming. Computer Vision and Pattern Recognition.
[9] Tenenbaum, J. B., de Silva, V. & Langford, J. C. (2000) A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 22 December 2000: 2319-2323.
[10] Belkin, M., & Niyogi, P. (2002). Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems, 14. Cambridge, MA: MIT Press.
[11] Wang, C. M., Sohl-Dickstein, J., & Olshausen, B. A. (2009) Unsupervised Learning of Lie Group Operators from Natural Movies. Redwood Center for Theoretical Neuroscience, Technical Report; RCTR 01-09.
[12] Dollar, P., Rabaud, V., & Belongie, S (2007) Non-isometric Manifold Learning: Analysis and an Algorithm. Int. Conf. on Machine Learning , 241-248.
[13] Olshausen, B.A. & Field, D.J. (1997) Sparse Coding with an Overcomplete Basis Set: A Strategy Employed by V1? Vision Research, 37: 3311-3325.
[14] Ortiz, M., Radovitzky, R.A. & Repetto, E.A (2001) The computation of the exponential and logarithmic mappings and their first and second linearizations. International Journal For Numerical Methods In Engineering. 52: 1431-1441.
[15] Berens, P. & Velasco, M. J. (2009) The circular statistics toolbox for Matlab. MPI Technical Report, 184.
[16] Anandan, P. (1989) A computational framework and an algorithm for the measurement of visual motion. Int. J. Comput. Vision, 2(3): 283-310.
[17] Glazer, F. (1987) Hierarchical Motion Detection. COINS TR 87-02. 9 Ph.D. thesis, Univ. of Massachusetts, Amherst, MA;