To see why, suppose we have a disparity-defined stimulus
d A and a motion-defined stimulus
v A , both with a perceived depth of 10 cm, and also a disparity-defined stimulus
d B and a motion-defined stimulus
v B with a perceived depth of 11 cm.
d A and
v A have the same perceived depth, so according to IC they have the same value of
ρ i , which we can call
ρ A . Similarly,
d B and
v B both have
ρ i =
ρ B . Thus, the difference in the value of
ρ i between
d A and
d B is
ρ B −
ρ A , and the difference in
ρ i between
v A and
v B is also
ρ B −
ρ A . The variance of
ρ i is always one, so if depth JNDs are determined by the signal and the noise properties of
ρ i (as assumed by Domini et al.,
2006), then the number of JNDs that separate
d A and
d B is the same as the number that separate
v A and
v B . For instance, if we define one JND as a separation of
k standard deviations in the decision variable
ρ i , then
d A and
d B are separated by (
ρ B −
ρ A ) /
k JNDs, and so are
v A and
v B . Thus, IC predicts that any two depth-matched pairs of stimuli are separated by the same number of depth JNDs. (Note that even without our demonstration that PCP calculates an optimal weighted sum, Domini et al.'s Equation 7, which shows that
ρ i is proportional to true depth and has unit variance, implies this same conclusion.)