CSE 252C: Selected Topics in Vision & Learning

Fall 2004


Students taking the course for four units should follow these project guidelines.  Here is the feedback form for presentations. Click here to join the class email-list.

Please read, reflect upon, and follow these presentation guidelines, kindly provided by Prof. Elkan.  Immediately after your presentation, please email to sjb+cse252c@cs a copy of your slides.  For ease of viewing, please make this copy be two slides per page in Adobe PDF.

The schedule of papers and presentations is below.  Participants who have not chosen a paper yet should look at the list of suggested papers and contact the instructor.

If you want to change your presentation date, please arrange a swap with another student and notify the instructor at least two weeks in advance.






paper title




Sept. 23 organizational meeting    



Sept. 28 no meeting (TR100)    



Sept. 30 no meeting (TR100)    



Oct. 5 Vincent Rabaud Levenberg-Marquardt [1][2] Roweis, Ranganathan



Oct. 7 Sameer Agarwal An Introduction to the Conjugate Gradient Method Without the Agonizing Pain Shewchuk



Oct. 12 Andrew Rabinovich An Iterative Improvement Procedure for Hierarchical Clustering Kauchak and Dasgupta



Oct. 14 Robin Hewitt Semidefinite Programming Vandenberghe and Boyd



Oct. 19 Louka Dlagnekov Detecting and Reading Text in Natural Scenes Chen and Yuille



Oct. 21 Gary Tedeschi Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images Boykov and Jolly



Oct. 26

Hamed Masnadi-Shirazi, Robin Hewitt

Robust Real Time Object Detection, Graphical Models for Graph Matching

Viola & Jones; Caetano, Caelli & Barone

here, here

pdf, pdf

Oct. 28 Sanjeev Kumar Krylov Subspace Methods for the Eigenvalue Problem Sorensen



Nov. 2 Hamed Masnadi-Shirazi Detecting Pedestrians Using Patterns of Motion and Appearance Viola, Jones and Snow



Nov. 4 Louka Dlagnekov, Rasit Topaloglu Super-resolution Enhancement of Text Image Sequences, Probability Density Estimation Capel & Zisserman, Bishop

here, here

pdf, ps

Nov. 9

Manmohan Chandraker

Bundle Adjustment: A Modern Synthesis

Triggs et al.



Nov. 11

no meeting (Veterans Day)





Nov. 16

Stephen Krotosky, Steve Scher Pictorial Structures for Object Recognition, On Perpendicular Texture: Why do we see more flowers in the distance? Felzenszwalb and Huttenlocher, Leung and Malik

here, here

pdf, pdf

Nov. 18

Ivan Laptev (KTH, Stockholm) Local Spatio-Temporal Image Features for Motion Interpretation Laptev et al.


Nov. 23 Rasit Topaloglu Introduction to Monte Carlo methods MacKay



Nov. 25

no meeting (Thanksgiving)





Nov. 30 Manmohan Chandraker, Piotr Dollar

Direct Methods for Sparse Least Squares Problems, Learning to Detect Objects in Images via a Sparse, Part-Based Representation

Björck, Agarwal et al.

here, here

pdf, pdf

Dec. 2 Project Presentations brief presentations
(reports and presentations)

Relevant deadlines for students doing projects: CVPR 2005 (Oct. 28/Nov. 1), ICCV 2005 (Mar. 1).


CSE 252C is a graduate seminar devoted to recent research on pattern recognition and computer vision.

Students may enroll for one, two, or four units:

The class section id for CSE 252C is #513967.

The course is open to anyone who has already taken at least one graduate course in computer vision, artificial intelligence, or a closely related area. Appropriate courses at UCSD include CSE 250A, CSE 250B, CSE 252AB, CSE 254, CSE 253, CogSci 202, ECE 270A, and CSE 275A.

We will meet on Tuesdays and Thursdays from 2:00pm-3:20pm in WLH 2205. The first meeting will be on Thursday September 23, and the final meeting will be on Thursday December 2, 2004.

Possible topics include:

Students are encouraged to investigate both fundamental algorithmic issues as well as application areas such as biometrics, content based image retrieval, texture synthesis, motion capture, and image based rendering.

The instructor is Serge Belongie, Assistant Professor, AP&M room 4832. Office Hours: Tu 4-5pm, W 4-5pm.

Feel free to send email to sjb+cse252c@cs with any questions.



Neural Networks for Pattern Recognition, Bishop.
Computer Vision: A Modern Approach, Forsyth and Ponce
Introductory Techniques for 3-D Computer Vision Trucco and Verri
An Invitation to 3D Vision: From Images to Geometric Models, Y. Ma, S. Soatto, J. Kosecka, S. Sastry
Multiple View Geometry in Computer Vision by Hartley & Zisserman
The Geometry of Multiple Images by Faugeras, Luong, and Papadopoulo
Vision Science: Photons to Phenomenology by Stephen E. Palmer





Each class meeting of 80 minutes will be divided into two parts.  First, a student will give a talk lasting about 60 minutes presenting a recent technical paper in detail.  In questions during the talk, and in the final 20 minutes, all seminar participants will discuss the paper and the issues raised by it.

Some papers will be theoretical, and some will be applied.  Two related applications papers may be discussed together.  Theoretical papers will typically be presented and discussed alone, to ensure that mathematical and algorithmic questions are discussed in sufficient depth.

In the first week, we will make a schedule of papers and presentations for the whole quarter.  With 10 participants, each student will make two separate presentations.  The procedure for one presentation is as follows:

Presentations will be evaluated, in a friendly way but with high standards.  Each  presentation should be prepared using LaTeX or Powerpoint.  You should copy equations, diagrams, charts, and tables as necessary from the paper for the presentation.

For each presentation, we will have a web-based discussion area.  Each seminar participant is expected to contribute at least one message to the discussion, before the presentation.  A message may ask an interesting question, point out a strength or weakness of the paper, or answer a question asked by someone else.  Messages should be thoughtful!

Each student will also do one term project following specific guidelines.  The project should be at the frontier of current research, and preferably closely inspired by one of the papers discussed in the class.  Project reports will be evaluated using these grading criteria.  There is a schedule for handing in a detailed project proposal, a draft project report, and then the final report.

The seminar will have no final exam.  Final grades will be based 50% on presentations and participation in class and in the web-based discussions.  The other 50% will be the project report.

Most recently updated on August 31, 2004 by Serge Belongie.