No / Purpose: To develop a perimetric test strategy, Structure Estimation of Minimum Uncertainty (SEMU), that uses structural information to drive stimulus choices. Methods: Structure Estimation of Minimum Uncertainty uses retinal nerve fiber layer (RNFL) thickness data as measured by optical coherence tomography to predict perimetric sensitivity. This prediction is used to set suprathreshold levels that then alter a prior probability distribution of the final test output. Using computer simulation, we studied SEMU’s performance under three different patient error response conditions: No Error, Typical False Positive errors, and Extremely Unreliable patients. In experiment 1, SEMU was compared with an existing suprathreshold cum thresholding combination test procedure, Estimation of Minimum Uncertainty (EMU), on single visual field locations. We used these results to finalize SEMU parameters. In experiment 2, SEMU was compared with full threshold (FT) on 163 glaucomatous visual fields. Results: On individual locations, SEMU has similar accuracy to EMU, but is, on average, one presentation faster than EMU. For the typical false-positive error condition, SEMU has significantly lower error compared with FT (SEMU average 0.33 dB lower; p < 0.001) and the 90% measured sensitivity range for SEMU is also smaller than that for FT. For unreliable patients, however, FT has lower mean and SD of error. Structure Estimation of Minimum Uncertainty makes significantly fewer presentations than FT (1.08 presentation on average fewer in a typical false-positive condition; p < 0.001). Assuming that a location in the field is marked abnormal if it falls below the 5th percentile of normal, SEMU has a false-positive rate of less than 10% for all error conditions compared with FT’s rate of 20% or more. Conclusions: On average, simulations show that using RNFL information to guide stimulus placement in a perimetric test procedure maintains accuracy, improves precision, and decreases test duration for patients with less than 15% false-positive rates.

Les silhouettes ambiguës, comme celle du lapin/canard (Jastrow, 1899), ont été étudiées selon plusieurs approches. Toutefois, les figures prises en exemples dans la large majorité des études sont généralement les mêmes. Cette redondance des images ambiguës utilisées pousse à croire qu'elles sont peut-être assez rares. Certaines observations anecdotiques suggèrent cependant qu’elles seraient au contraire relativement fréquentes. C'est ce que cherche à déterminer cette expérience. Nous avons utilisé des modèles tridimensionnels d'animaux projetés de façon aléatoire afin d'en extraire les silhouettes dont la complexité périmétrique a ensuite été modifiée par lissage. Treize sujets ont dû indiquer ce qu'ils percevaient dans l'image. Nous démontrons qu’une silhouette est classée en moyenne dans 1.9079 catégories de base. Nous avons également démontré qu’une diminution de la complexité périmétrique rend d’abord une silhouette plus ambiguë pour éventuellement atteindre un sommet (équivalent à environ six fois la complexité périmétrique d’un disque) à la suite duquel l’ambiguïté chute. / Ambiguous silhouettes such as the duck/rabbit (Jastrow, 1899) have been studied by several approaches. However, the figures taken as examples in the vast majority of studies are generally the same. This redundancy of the ambiguous images used in litterature implies they may be quite rare. On the other hand, anecdotal evidence suggests that they might be relatively frequent. This is what this experiment is trying to establish. We used three-dimensional models of animals from a random point of view to extract silhouettes whose perimetric complexity was subsequently modified by smoothing. Thirteen subjects were asked to indicate what they saw in the image. We show that silhouettes are classified on average with 1.9079 based categories. We also established that a decrease in the perimetric complexity initially makes a more ambiguous figure but that this effect eventually reaches a peak (at a perimetric complexity of approximately 6 times that of a disk) after which ambiguity drops.

Les silhouettes ambiguës, comme celle du lapin/canard (Jastrow, 1899), ont été étudiées selon plusieurs approches. Toutefois, les figures prises en exemples dans la large majorité des études sont généralement les mêmes. Cette redondance des images ambiguës utilisées pousse à croire qu'elles sont peut-être assez rares. Certaines observations anecdotiques suggèrent cependant qu’elles seraient au contraire relativement fréquentes. C'est ce que cherche à déterminer cette expérience. Nous avons utilisé des modèles tridimensionnels d'animaux projetés de façon aléatoire afin d'en extraire les silhouettes dont la complexité périmétrique a ensuite été modifiée par lissage. Treize sujets ont dû indiquer ce qu'ils percevaient dans l'image. Nous démontrons qu’une silhouette est classée en moyenne dans 1.9079 catégories de base. Nous avons également démontré qu’une diminution de la complexité périmétrique rend d’abord une silhouette plus ambiguë pour éventuellement atteindre un sommet (équivalent à environ six fois la complexité périmétrique d’un disque) à la suite duquel l’ambiguïté chute. / Ambiguous silhouettes such as the duck/rabbit (Jastrow, 1899) have been studied by several approaches. However, the figures taken as examples in the vast majority of studies are generally the same. This redundancy of the ambiguous images used in litterature implies they may be quite rare. On the other hand, anecdotal evidence suggests that they might be relatively frequent. This is what this experiment is trying to establish. We used three-dimensional models of animals from a random point of view to extract silhouettes whose perimetric complexity was subsequently modified by smoothing. Thirteen subjects were asked to indicate what they saw in the image. We show that silhouettes are classified on average with 1.9079 based categories. We also established that a decrease in the perimetric complexity initially makes a more ambiguous figure but that this effect eventually reaches a peak (at a perimetric complexity of approximately 6 times that of a disk) after which ambiguity drops.