Zhang, YuhangHartley, RichardWang, Lei2015-12-07September9783642155543http://hdl.handle.net/1885/21765We describe a new fast algorithm for multi-labelling problems. In general, a multi-labelling problem is NP-hard. Widely used algorithms like α-expansion can reach a suboptimal result in a time linear in the number of the labels. In this paper, we propose201010.1007/978-3-642-15558-1_382015-12-07