This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication

Year(s) from:  to 
Keywords (separated by spaces):

Four Colour Theorem for Fast Early Vision

Radu Timofte and Luc Van Gool
Asian Conference on Computer Vision (ACCV 2010)
New Zealand, November 2010


Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formulation yields an NP-hard energy minimization problem, good heuristics have been developed based on graph cuts and belief propagation. Nevertheless both approaches still require tens of seconds to solve stereo problems on recent PCs. Such running times are impractical for optical flow and many image segmentation and restoration problems. We show how to reduce the computational complexity of belief propagation by applying the Four Color Theorem to limit the maximum number of labels in the underlying image segmentation to at most four. We show that this provides substantial speed improvements for large inputs to a variety of vision problems, while maintaining competitive result quality.

Link to publisher's page
Download in pdf format
  author = {Radu Timofte and Luc Van Gool},
  title = {Four Colour Theorem for Fast Early Vision},
  booktitle = {Asian Conference on Computer Vision (ACCV 2010)},
  year = {2010},
  month = {November},
  keywords = {}