The computation of multiple matching doubly ambiguous stereograms with transparent planes.
The computation of multiple matching doubly ambiguous stereograms with transparent planes.
复制标题
具有透明平面的多个匹配双重模糊立体图的计算。
作者：
D. Weinshall
心理物理实验之前已经被描述为Weinshire，D.(1989)Nature 341,737-739；(1991)视觉研究31,1731-1748，涉及在双重模糊的随机点立体图中感知对应于多个匹配的许多透明层。本文的第一部分描述了其他实验。在一个实验中，受试者被要求报告每个透明层上的点的密度。在另一项实验中，测量了每一层上的最小网点密度，这是受试者将其视为明显的透明层所必需的。本文的第二部分描述了立体匹配算法在应用于双重模糊立体图时所遇到的困难。讨论了可以修改以与人类感知保持一致的算法，以及人类感知对其参数施加的约束。
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.