2 resultados para Universität Stuttgart
em Queensland University of Technology - ePrints Archive
Resumo:
A fundamental problem faced by stereo matching algorithms is the matching or correspondence problem. A wide range of algorithms have been proposed for the correspondence problem. For all matching algorithms, it would be useful to be able to compute a measure of the probability of correctness, or reliability of a match. This paper focuses in particular on one class for matching algorithms, which are based on the rank transform. The interest in these algorithms for stereo matching stems from their invariance to radiometric distortion, and their amenability to fast hardware implementation. This work differs from previous work in that it derives, from first principles, an expression for the probability of a correct match. This method was based on an enumeration of all possible symbols for matching. The theoretical results for disparity error prediction, obtained using this method, were found to agree well with experimental results. However, disadvantages of the technique developed in this chapter are that it is not easily applicable to real images, and also that it is too computationally expensive for practical window sizes. Nevertheless, the exercise provides an interesting and novel analysis of match reliability.
Resumo:
A travel article about southern German festivals. IT WAS Golden October, when a last wave of Italian warmth made it across the Alps into southern Germany. Outside, the final sunlight of the day found the tops of trees, and the town seemed cast entirely in autumn patterns. I followed the busy pedestrian traffic across the Neckar River into the old part of Tübingen.