DIMACS Workshop on Graph Theoretic Methods in Computer Vision

May 20 - 21, 1999
CoRE Building Auditorium, Rutgers University, Piscataway, NJ

Principal Organizers:

• Sven Dickinson, Rutgers University, sven@cs.rutgers.edu
• Martin Farach-Colton, Rutgers University, farach@cs.rutgers.edu
• Lenore Cowen, Johns Hopkins University, cowen@brutus.mts.jhu.edu

Workshop Program:

 8:00 -  8:45   Registration/breakfast

 8:45 -  9:00   Welcome remarks (Sven, Martin, Lenore)

 9:00 -  9:50   Dan Huttenlocher, Cornell University
                Recognizing Flexible Objects

 9:50 - 10:40   Kaleem Siddiqi, McGill University
                Matching Hierarchical Structures Using Association Graphs

10:40 - 11:00   Coffee break

11:00 - 11:50   Satish Rao, NECI and University of California, Berkeley
                TBA

11:50 - 12:40   Kim Boyer, The Ohio State University
                Graph-Theoretical Methods in Computer Vision: Issues in Inexact Matching and the Use of Spectra

12:40 -  2:00   Lunch

 2:00 -  2:50   Ali Shokoufandeh, Rutgers University
                A Spectral Encoding of Object Part Structure and its Application to Indexing and Matching

 2:50 -  3:40   Hiroshi Ishikawa (Davi Geiger), NYU
                Embedded graph algorithms for computer vision

 3:40 -  4:00   Coffee break

 4:00 -  4:50   Yali Amit, University of Chicago
                Star Type Graphical Models for Efficient Object Detection

 4:50 -  5:00   Panel setup 

 5:00 -  6:00   Panel 1 (title TBA)

 6:00           Reception

 8:00 -  9:00   Registration/breakfast

 9:00 -  9:50   Philip Klein, Brown University
                Comparing shapes using edit-distance on shock graphs

 9:50 - 10:40   Pedro Felzenszwalb, Cornell University
                Efficiently computing a good segmentation

10:40 - 11:00   Coffee break

11:00 - 11:50   Olga Veksler (Ramin Zabih), Cornell University
                Fast Energy Minimization for Computer Vision via Graph Cuts

11:50 - 12:40   Edwin Hancock, University of York
                Embedding Relational Constraints in the  EM Algorithm

12:40 -  2:00   Lunch

 2:00 -  2:50   Carly Klivans, Cornell University and MIT
                Automatic Landmark Acquisition as a Graph Decomposition Problem

 2:50 -  3:40   Anand Rangarajan, Yale University
                Weighted graphs and associated distance measures for non-rigid matching

 3:40 -  4:00   Coffee break

 4:00 -  4:50   Jianbo Shi, University of California - Berkeley
                Normalized Cut in Image Segmentation: regions, contours and cue combination.

 4:50 -  5:00   Panel setup

 5:00 -  6:00   Panel 2 (title TBA)

 6:00           Closing remarks (Sven, Martin, Lenore)

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage