Ingemar J. Cox, James H. Rehg, Sunita L. Hingorani and Matt L. Miller propose an algorithm for grouping edges and segmenting contours that is based on Reid's multiple hypothesis algorithm, originally developed in the context of multitarget tracking. David W. Jacobs presents a low-order polynomial algorithm that locates salient convex collections of lines in an image. Allan Jepson and Michael J. Black relax this single-motion assumption and apply mixture models and an extension of the EM algorithm to cluster the multiple motions present within a region. Finally, a fourth group of papers focuses on human vision. Irving Biederman discusses problems of visual shape recognition for which clustering mathematics might yield some potential benefits.
Special attention is given to molecular clusters and their classification.
Steven W. Zucker proposes that visual perception of dots underlies clustering operations when more domain specific information is not available, and studies visual computations in this perspective. Bela Julesz reviews work on illusory contour perception, from early work on cyclopean contours using random-dot stereograms to recent results that show that illusory contours depend on global parameters such as closure of stacked lines as well as local interactions. To a large extent, the language barrier, due to the multidisciplinary character of the workshop, was alleviated by the participants' goodwill and through many questions and answers. Any remaining difficulties were compensated for by new ideas and perspectives for theory and applications. Aubrey B. Poore 169 Part 3.