Event time:
Tuesday, September 18, 2012 - 12:00pm to 1:00pm
Location:
LOM 214
Speaker:
Arthur Szlam
Speaker affiliation:
The City College of New York
Event description:
We describe a method for fast approximation of sparse coding and nearest subspace search. The input space is subdivided by a binary decision tree, and we store a lookup table with the active set assignments for each leaf in the tree. We use the fast coding to get a real time version of the sparse coding sift pyramid object recognition system.