The Sparse Manifold Transform
summary
Proposes a Sparse Manifold Transform: compute L1 sparse codes of local image patches (e.g. 16×16), learn an embedding of the learned dictionary (hundreds to thousands of atoms) using temporal persistence, then linearly project coefficients to a lower‑dimensional manifold and reconstruct. Implements sparse inference with an LCA/Hopfield‑like circuit (LCA Hopfield) and stacks stages to progressively flatten object manifolds. On video patches the embedding yields smoother, lower‑dimensional trajectories and successful patch reconstructions, so sparse coding + manifold flattening both compresses and preserves recoverable detail.
AI-written summary · about
chapters (10)
- 0:00Introduction and motivation
- 4:09Sparse coding principles
- 9:04Historical context
- 13:33Mathematical modeling
- 21:25Manifolds in visual data
- 24:59Manifold flattening techniques
- 29:11Locally linear landmarks
- 33:48Sparse manifold transform
- 37:01Results and implications
- 40:16Q&A and discussion
related talks
25mSimple, Efficient and Neural Algorithms for Sparse Coding
38mManifold Learning and Dimensionality Reduction for Data Visualization
28mRandomized Constrained Matrix Decompositions
58mTensor Decomposition, Sparse Representations and Applications
48mInput-sparsity Time Algorithms for Embeddings and Regression Problems
51mTwo Concise Representations for High-Dimensional Visual Data
26mLearning Sparse Data with Near-optimal Speed and Efficiency from a Variety of Measurement Processes
29mCompressive Sensing
