| ECE 904 Computer Vision Seminar |
|
In this course we review recent research publications related to visual detection, recognition, and tracking of people (or other objects), visual motion analysis, visual reconstruction, stereo vision, acoustic localization, robotic sensing, and other related topics. Each week we meet to discuss one paper from the recent literature. Students should read the paper beforehand and prepare questions and comments in order to participate fully in the discussion. In addition, students are encouraged to volunteer to lead the discussion at least once during the semester. All students are welcome to attend, whether or not they are signed up for the course. (For details on how to get credit, see the bottom of this page.)
Here are some miscellaneous computer vision resources.
| Schedule |
|
Week |
Date |
Paper |
Discussion leader |
|
1 |
8/25 |
Hiroshi Ishikawa, Exact Optimization for Markov Random Fields with Convex Priors, PAMI 2003 | Stan Birchfield |
|
2 |
9/1 |
S. Roy, Stereo Without Epipolar Lines: A Maximum-Flow Formulation, IJCV 1999 | |
|
3 |
9/8 |
Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 648–655, 1998. | Salil Banerjee |
|
4 |
9/15 |
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In Proceedings of the International Conference on Computer Vision, pages 377–384, 1999. | Ninad Pradhan |
|
5 |
9/22 |
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1222–1239, 2001. | Xiaoxia Huang |
|
6 |
9/29 |
[out of town] | |
|
7 |
10/6 |
V. Kolmogorov and R. Zabih. Multi-camera scene reconstruction via graph cuts. In Proceedings of the European Conference on Computer Vision, 2002. | Bryan Willimon |
|
8 |
10/13 |
[break] | |
|
9 |
10/20 |
V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2):147–159, 2004. | Sumod Mohan |
|
10 |
10/27 |
Zia Khan, Tucker Balch, and Frank Dellaert, MCMC-Based Particle Filtering for Tracking a Variable Number of Interacting Targets, PAMI 2005 | Akshay Apte |
|
11 |
11/3 |
Z. Tu and S. Zhu, Image Segmentation by Data-Driven Markov Chain Monte Carlo, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5):657-673, 2002. | Zhichao Chen |
|
12 |
11/10 |
R. Zabih and V. Kolmogorov. Spatially coherent clustering with graph cuts. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2004. | Vidya Murali |
|
13 |
11/17 |
Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision, PAMI 2004 | Stan Birchfield |
|
14 |
11/24 |
P. Kohli and P. H. S. Torr. Dynamic Graph Cuts for Efficient Inference in Markov Random Fields, PAMI, 29(12): 2079-2088, December 2007. | Xiaoxia Huang |
| 15 | 12/1 | Y. Y. Boykov and M.-P. Jolly Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images, ICCV 2001 |
Papers covered in previous semesters
| Potential future papers |
| Administrivia |
Instructor: Stan Birchfield, 207-A Riggs Hall, 656-5912, email: stb at clemson
Meetings: 3:30-4:30 T, 307 Riggs Hall
To receive the 1-hour credit, students must