The computation of multiple matching doubly ambiguous stereograms with transparent planes.

نویسنده

  • D Weinshall
چکیده

Psychophysical experiments have been previously described Weinshall, D. (1989) Nature 341, 737-739; (1991) Vision Research 31, 1731-1748 that involved the perception of many transparent layers, corresponding to multiple matching, in doubly ambiguous random-dot stereograms. Additional experiments are described in the first part of this paper. In one experiment, subjects were required to report the density of dots on each transparent layer. In another experiment, the minimal density of dots on each layer, which is required for the subjects to perceive it as a distinct transparent layer, was measured. The difficulties encountered by stereo matching algorithms, when applied to doubly ambiguous stereograms, are described in the second part of this paper. Algorithms that can be modified to perform consistently with human perception, and the constraints imposed on their parameters by human perception, are discussed.

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

ثبت نام

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

منابع مشابه

Seeing "ghost" planes in stereo vision.

I have studied particular ambiguous random dot stereograms where multiple matches (that are equally possible) are available at each point. The human visual system resolves these ambiguities in two qualitatively different ways. In some cases a few transparent surfaces are perceived corresponding to all the ambiguous matches. In other cases a single dominant opaque surface is perceived. The condi...

متن کامل

The Computation of Stereo Disparity for Transparent and for Opaque Surfaces

The classical computational model for stereo vision incorporates a uniqueness inhibition constraint to enforce a one-to-one feature match, thereby sacrificing the ability to handle transparency. Critics of the model disregard the uniqueness constraint and argue that the smoothness constraint can provide the excitation support required for transparency computation. However, this modification fai...

متن کامل

Connectionist Models Summer School

Binocular depth perception, or stereopsis, depends on matching corresponding points in two images taken from two vantage points. In random-dot stereograms the features to be matched are individual pixels. We have used the recurrent backpropagation learning algorithm of Pineda (1987) to construct network models with lateral and feedback connections that can solve the correspondence problem for r...

متن کامل

Multiple matching of features in simple stereograms

Simple stereograms are used to show that the binocular matching of closely spaced vertical lines can be changed by horizontally connecting some of the vertical lines. The matching that is seen can be gradually changed by incremental modifications to simple visual quantities like the luminance contrast of a local region, or the density of the connecting horizontal lines. For some values of these...

متن کامل

Solving Stereo Transparency with an Extended Coarse-to-Fine Disparity Energy Model

Modeling stereo transparency with physiologically plausible mechanisms is challenging because in such frameworks, large receptive fields mix up overlapping disparities, whereas small receptive fields can reliably compute only small disparities. It seems necessary to combine information across scales. A coarse-to-fine disparity energy model, with both position- and phase-shift receptive fields, ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Spatial vision

دوره 7 2  شماره 

صفحات  -

تاریخ انتشار 1993