ECCV-2010 Tutorial: Feature Learning for Image Classification

Organizers

Kai Yu (NEC Laboratories America, kyu@sv.nec-labs.com),

Andrew Ng (Stanford University, ang@cs.stanford.edu)

Place & Time: Creta Maris Hotel, Crete, Greece, 9:00 – 13:00, September 5th, 2010

Course Material and Software

The quality of visual features is crucial for a wide range of computer vision topics, e.g., scene classification, object recognition, and object detection, which are very popular in recent computer vision venues. All these image classification tasks have traditionally relied on hand-crafted features to try to capture the essence of different visual patterns. Fundamentally, a long-term goal in AI research is to build intelligent systems that can automatically learn meaningful feature representations from a massive amount of image data. We believe a comprehensive coverage of the latest advances on image feature learning will be of broad interest to ECCV attendees.

The primary objective of this tutorial is to introduce a paradigm of feature learning from unlabeled images, with an emphasis on applications to supervised image classification. We provide a comprehensive coverage of recently developed algorithms for learning powerful sparse nonlinear features, and showcase their superior performance on a number of challenging image classification benchmarks, including Caltech101, PASCAL, and the recent large-scale problem ImageNet. Furthermore, we describe deep learning and a variety of deep learning algorithms, which learn rich feature hierarchies from unlabeled data and can capture complex invariance in visual patterns.

Syllabus

  • Overview: Image Classification Overview
  • Part I: State-of-the-art Image Classification Methods
    • Discriminative Classifiers using BoW Representation and Spatial Pyramid Matching
    • Alternative Methods: Generative Models and Part-based Models
  • Part II: Image Classification using Sparse Coding
    • Self-taught Learning
    • BoW Representation from a Coding Perspective
    • Feature Learning using Sparse Coding
    • Alternative Sparse Coding Methods: Sparse RBM, Sparse Autoencoder, etc.
  • Part III: Advanced Topics on Image Classification using Sparse Coding
    • Intuitions, Topic-model View, and Geometric View
    • Local Coordinate Coding: Theory and Applications
    • Recent Advances in Sparse Coding for Image Classification
  • Part IV: Learning Feature Hierarchies and Deep Learning
    • Feature Hierarchies and the Importance of Depth
    • Deep Belief Networks (DBNs) and Convolution DBNs
    • Learning Invariance (ICA, SFA, etc.)
    • Other Deep Architectures
    • Application to Image Classification
  • Open questions and discussion

Course Material and Software

The slides:

Software available online:

  • Matlab toolbox for sparse coding using the feature-sign algorithm [link]
  • Matlab codes for image classification using sparse coding on SIFT features [link]
  • Matlab codes for a fast approximation to Local Coordinate Coding [link]

Relevant Tutorials

Biographies

Kai Yu is a Department Head at NEC Labs America, where he leads the research in image understanding, video surveillance, and data mining. He served as Session Chair at ICML 2009 and Area Chair at ICML 2010, and received the best paper runner-up award in PKDD-05. His team won the Winner Prizes in PASCAL VOC Challenge 2009 and the ImageNet Large-scale Visual Recognition Challenge 2010, and was among the top performers in TRECVID Video Event Detection Evaluations in 2008 and 2009. He received Ph.D in CS from University of Munich, Germany, in 2004.

Andrew Ng is an Associate Professor of Computer Science at Stanford University. His research interests include machine learning, robotics, and broad-competence AI. His group has won best paper/best student paper awards at ACL, CEAS, 3DRR and ICML. He is also a recipient of the Alfred P. Sloan Fellowship, and the IJCAI 2009 Computers and Thought award.

from: http://ufldl.stanford.edu/eccv10-tutorial/

图像分类之特征学习ECCV-2010 Tutorial: Feature Learning for Image Classification的更多相关文章

  1. paper 124:【转载】无监督特征学习——Unsupervised feature learning and deep learning

    来源:http://blog.csdn.net/abcjennifer/article/details/7804962 无监督学习近年来很热,先后应用于computer vision, audio c ...

  2. 转:无监督特征学习——Unsupervised feature learning and deep learning

    http://blog.csdn.net/abcjennifer/article/details/7804962 无监督学习近年来很热,先后应用于computer vision, audio clas ...

  3. 译:Local Spectral Graph Convolution for Point Set Feature Learning-用于点集特征学习的局部谱图卷积

    标题:Local Spectral Graph Convolution for Point Set Feature Learning 作者:Chu Wang, Babak Samari, Kaleem ...

  4. [转] 无监督特征学习——Unsupervised feature learning and deep learning

    from:http://blog.csdn.net/abcjennifer/article/details/7804962 无监督学习近年来很热,先后应用于computer vision, audio ...

  5. 利用K-means聚类分类,进行特征学习

    这只是老师安排的一个实验,准备过程中遇到各种问题,现在贴出来供大家参考,是Andrew Ng参与的研究, 论文依据如下,第二篇是一篇相关的论文, Learning Feature Representa ...

  6. Deep Learning 学习随记(四)自学习和非监督特征学习

    接着看讲义,接下来这章应该是Self-Taught Learning and Unsupervised Feature Learning. 含义: 从字面上不难理解其意思.这里的self-taught ...

  7. Deep Learning论文笔记之(一)K-means特征学习

    Deep Learning论文笔记之(一)K-means特征学习 zouxy09@qq.com http://blog.csdn.net/zouxy09          自己平时看了一些论文,但老感 ...

  8. UFLDL深度学习笔记 (三)无监督特征学习

    UFLDL深度学习笔记 (三)无监督特征学习 1. 主题思路 "UFLDL 无监督特征学习"本节全称为自我学习与无监督特征学习,和前一节softmax回归很类似,所以本篇笔记会比较 ...

  9. 论文笔记:Deep feature learning with relative distance comparison for person re-identification

    这篇论文是要解决 person re-identification 的问题.所谓 person re-identification,指的是在不同的场景下识别同一个人(如下图所示).这里的难点是,由于不 ...

随机推荐

  1. Asp.net开启分布式事务管理

    1.确保服务器分布式管理服务 Distributed Transcation Coordinator 有开启 2.使用分布式事务代码的项目中添加System.Transactions程序集的引用 3. ...

  2. Using sql azure for Elmah

    The MSDN docs contain the list of T-SQL that is either partially supported or not supported.  For ex ...

  3. 【BZOJ】【3991】【SDOI2015】寻宝游戏

    dfs序 我哭啊……这题在考试的时候(我不是山东的,CH大法吼)没想出来……只写了50分的暴力QAQ 而且苦逼的写的比正解还长……我骗点分容易吗QAQ 骗分做法: 1.$n,m\leq 1000$: ...

  4. Segment Tree 扫描线 分类: ACM TYPE 2014-08-29 13:08 89人阅读 评论(0) 收藏

    #include<iostream> #include<cstdio> #include<algorithm> #define Max 1005 using nam ...

  5. RMQ(st)

    int dp[1111][12]; int a[1111]; int n; void RMQ_init() {     for(int i=1;i<=n;i++)     {         d ...

  6. javascript实现数据结构与算法系列:功能完整的线性链表

    由于链表在空间的合理利用上和插入,删除时不需要移动等的有点,因此在很多场合下,它是线性表的首选存储结构.然而,它也存在着实现某些基本操作,如求线性表长度时不如顺序存储结构的缺点:另一方面,由于在链表中 ...

  7. mysql去除重复查询的SQL语句基本思路

    SELECT R.* FROM trans_flow R, (SELECT order_no, MAX(status_time) AS status_time FROM trans_flow GROU ...

  8. vi/vim使用指北 ---- Beyond the Basic

    更多的组合命令 [number]-[command]-[test object] number:   数字 comand:  c,d,y  (修改,删除,复制) test object: 移动光标的命 ...

  9. LA 2031

    Mr. White, a fat man, now is crazy about a game named ``Dance, Dance, Revolution". But his danc ...

  10. GCD初步认识

    //(1)用异步函数往并发队列中添加任务, //总结:同时开启三个子线程 - (void)test1 { //1.获得全局的并发队列 dispatch_queue_t queue = dispatch ...