摘要
In this paper we propose a novel edge based, fast and effective stereo matching method, which utilises various geometrical and local area constraints and structural information among edge segments to perform a constraint directed matching. By employing a heuristic labelling technique, the combinatorial search for isomorphic graphs is greatly reduced in the matching process. The implementation and experimental results are presented to show the efficacy of the proposed method.
In this paper we propose a novel edge based, fast and effective stereo matching method, which utilises various geometrical and local area constraints and structural information among edge segments to perform a constraint directed matching. By employing a heuristic labelling technique, the combinatorial search for isomorphic graphs is greatly reduced in the matching process. The implementation and experimental results are presented to show the efficacy of the proposed method.
