 |
    |
Wehrli 2.0: An Algorithm for “Tidying up Art”
Nikolai Ufer1, 2, Mohamed Souiai1, and Daniel Cremers1
1Department of Computer Science, Technical University of Munich, Boltzmannstr. 3, D-85748, Garching, Germany
N.Ufer@campus.lmu.de
Mohamed.Souiai@in.tum.de
Cremers@in.tum.de
2Department of Mathematics, University of Munich, Theresienstr. 39, D-8033, Munich, Germany
Abstract. We propose an algorithm for automatizing the task of “Tidying up Art” introduced by the comedian Wehrli [1]. Driven by a strong sense of order and tidyness, Wehrli systematically dissects famous artworks into their constituents and rearranges them according to certain ordering principles. The proposed algorithmic solution to this problem builds up on a number of recent advances in image segmentation and grouping. It has two important advantages: Firstly, the computerized tidying up of art is substantially faster than manual labor requiring only a few seconds on state-of-the-art GPUs compared to many hours of manual labor. Secondly, the computed part decomposition and reordering is fully reproducible. In particular, the arrangement of parts is determined based on mathematically transparent criteria rather than the invariably subjective and irreproducible human sense of order.
Keywords: Tidying up Art, Image Segmentation, Label Cost Prior, Convex Relaxation, Convex Optimization, Fast Global K-Means
LNCS 7583, p. 532 ff.
lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2012