1 / 19

Efficient Local Coordinate Coding for Nonlinear Learning

Explore improved local coordinate coding for efficient nonlinear learning, reducing anchor points & computation complexity while enhancing prediction accuracy. Experiment with linear ridge regression & handwritten digit recognition for practical applications.

outlaw
Download Presentation

Efficient Local Coordinate Coding for Nonlinear Learning

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Nonlinear Learning Using Local Coordinate CodingK. Yu, T. Zhang and Y. Gong, NIPS 2009 Improved Local Coordinate Coding Using Local Tangents K. Yu and T. Zhang, ICML 2010Locality-Constrained Linear Coding for Image ClassificationJ. Wang, J. Yang, K. Yu, F. Lv, T. Huang and Y. Gong, CVPR2010 Presented by: Mingyuan Zhou Duke University, ECE September 17, 2010

  2. Nonlinear Learning Using Local Coordinate Coding Local Coordinate Coding: Theory

  3. Nonlinear Learning Using Local Coordinate Coding Local Coordinate Coding: Practice • Sparse coding: • LLC:

  4. Nonlinear Learning Using Local Coordinate Coding Experiments: linear ridge regression based on the sparse codes or LCC

  5. Nonlinear Learning Using Local Coordinate Coding Experiments: linear ridge regression

  6. Nonlinear Learning Using Local Coordinate Coding Experiments: Handwritten Digit Recognition

  7. Nonlinear Learning Using Local Coordinate Coding Experiments: Handwritten Digit Recognition

  8. Nonlinear Learning Using Local Coordinate Coding Conclusion

  9. Improved Local Coordinate Coding Using Local Tangents Motivation • For smooth but highly nonlinear function, local linear approximation may not necessarily be optimal, which means that many anchor points are needed to achieve accurate approximation. • The improved LCC has better approximation of high dimensional nonlinear functions when the underlying data manifold is locally relatively flat. • It significantly reduces the number of anchor points, leading to reduced computational complexity and improved prediction.

  10. Improved Local Coordinate Coding Using Local Tangents VQ, LCC and Improved LCC VQ

  11. Improved Local Coordinate Coding Using Local Tangents VQ, LCC and Improved LCC Support: Coding: (Extended LCC) (LCC with local Tangents)

  12. Improved Local Coordinate Coding Using Local Tangents Algorithm

  13. Improved Local Coordinate Coding Using Local Tangents Experiments The feature dimension is increased from |C| to |C|(1+m) for LCC with local Tangents.

  14. Locality-Constrained Linear Coding for Image Classification Introduction • VQ + SPM + Nonlinear SVM • SC + SPM + Linear SVM • LLC + SPM + Linear SVM

  15. Locality-Constrained Linear Coding for Image Classification Objective functions • VQ • SC • LLC

  16. Locality-Constrained Linear Coding for Image Classification Properties of LLC • Better reconstruction • Local smooth sparsity • Analytical solution • Approximate solution with KNN constraint

  17. Locality-Constrained Linear Coding for Image Classification Codebook Optimization

  18. Locality-Constrained Linear Coding for Image Classification Experiments

  19. Locality-Constrained Linear Coding for Image Classification Experiments

More Related