Longin Jan Latecki, Keynote Speaker at Conference on Discrete Geometry for Computer Imagery

Longin Jan Latecki will be the Keynote Speaker at 21st International Conference on Discrete Geometry for Computer Imagery, Paris, France, 25-29 March 2019. The aim of the conference is to bring together researchers, students and practitioners of discrete geometry, including discrete topology, geometric models, and mathematical morphology, to present and discuss new advances in these fields, be they purely theoretical developments or novel applications.

Professor Latecki's talk is titled "Computing maximum weight cliques with local search on large graphs with application to common object discovery" . The focus of his presentation is the on maximum weight clique (MWC) problem, which is the problem of finding a clique with the greatest total weight on a undirected weighted graph. Due to the NP-hardness of the MWC problem, our goal is to find a good clique within a reasonable time limit in the local search framework. This problem exists in many real-world AI applications like common object discovery, image segmentation, and clustering aggregation.