Skip navigation
Skip navigation

Fast Multi-labelling for Stereo Matching

Zhang, Yuhang; Hartley, Richard; Wang, Lei


We 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 propose

CollectionsANU Research Publications
Date published: 2010
Type: Conference paper
Source: Proceedings of the European Conference on Computer Vision (ECCV 2010)
DOI: 10.1007/978-3-642-15558-1_38


File Description SizeFormat Image
01_Zhang_Fast_Multi-labelling_for_2010.pdf431.08 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator