CALL FOR PAPERS IEEE Transactions on Pattern Analysis and Machine Intelligence SPECIAL ISSUE on GRAPH ALGORITHMS IN COMPUTER VISION (Submission Deadline: December 1, 1999) Guest editors: Sven Dickinson, Rutgers University, sven@cs.rutgers.edu Marcello Pelillo, University of Venice, pelillo@dsi.unive.it Ramin Zabih, Cornell University, rdz@cs.cornell.edu Graphs have long been an important tool in computer vision, especially because of their representational power and flexibility. There is now a renewed interest towards explicitly formulating computer vision problems as graph problems. This is particularly advantageous because it allows vision problems to be cast in a pure, abstract setting with solid theoretical underpinnings, and also permits access to the full arsenal of graph algorithms developed in computer science and operations research. Graph problems which have proven to be relevant to computer vision include maximum flow, minimum spanning tree, maximum clique, shortest path, maximal common subtree/subgraph, etc. In addition, a number of fundamental techniques that were designed in the graph algorithms community have recently been applied to computer vision problems. Examples include spectral methods and fractional rounding. Papers are solicited that address theoretical as well as practical issues related to the Special Issue's theme. Topics of interest include (but are not limited to): - energy minimization - grouping and visual organization - indexing of image databases - object recognition - segmentation and restoration - shape matching and recognition - stereo and motion Authors are invited to submit eight (8) copies of their manuscript to: Professor Sven Dickinson, Department of Computer Science Rutgers, the State University of New Jersey 110 Frelinghuysen Road, Piscataway, NJ 08854-8019 Tel: 732-445-3546 Manuscripts must be received by December 1, 1999 and must follow the IEEE T-PAMI submission guidelines.