Stereo Matching of Curves

نویسندگان

  • Andrew T. Brint
  • Michael Brady
چکیده

This paper describes a stereo algorithm which matches connected chains of edgels (curves) between images. It is based on representing the curves as elastic strings and measuring the amount of deformation the strings have to undergo to transform between corresponding curves, and incorporates the ideas of the disparity gradient and the fact that matching sections of curve have to be of a similar shape. This explicit use of shape information means that a precisely known epipolar geometry is no longer crucial. Pairs of potentially corresponding curves which lead to a large deformation energy, are eliminated and the greatly reduced number of potentially matching pairs are passed on to a tree search stage. A typical result of running the algorithm on a stereo triple is presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Revisiting Intrinsic Curves for Efficient Dense Stereo Matching

Dense stereo matching is one of the fundamental and active areas of photogrammetry. The increasing image resolution of digital cameras as well as the growing interest in unconventional imaging, e.g. unmanned aerial imagery, has exposed stereo image pairs to serious occlusion, noise and matching ambiguity. This has also resulted in an increase in the range of disparity values that should be cons...

متن کامل

Stereo Matching as a Nearest-Neighbor Problem

We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the paths that a set of local image descriptors trace as an image scanline is traversed from left to right. Intrinsic curves are ideally invariant with respect to disparity. Stereo correspondence then becomes a trivial lookup...

متن کامل

New Pseudo-CT Generation Approach from Magnetic Resonance Imaging using a Local Texture Descriptor

Background: One of the challenges of PET/MRI combined systems is to derive an attenuation map to correct the PET image. For that, the pseudo-CT image could be used to correct the attenuation. Until now, most existing scientific researches construct this pseudo-CT image using the registration techniques. However, these techniques suffer from the local minima of the non-rigid deformation energy f...

متن کامل

Curve-based Stereo Matching for 3D Modeling of Plants

Realistic image-based 3D reconstruction of narrow plants, such as wheat and barley, is challenging because of plant’s lack of a well defined surface, complex self-occlusions, and high degree of self-similarities. In this paper we present a new approach for image-based modeling of plants using a pair of cameras in a stereo setup. Our key idea is that while color and texture features are unlikely...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989