TORONTO: A trial-oriented multidimensional psychometric testing algorithm.

IF 2 4区 心理学 Q2 OPHTHALMOLOGY Journal of Vision Pub Date : 2024-07-02 DOI:10.1167/jov.24.7.2
Runjie Bill Shi, Moshe Eizenman, Leo Yan Li-Han, Willy Wong
{"title":"TORONTO: A trial-oriented multidimensional psychometric testing algorithm.","authors":"Runjie Bill Shi, Moshe Eizenman, Leo Yan Li-Han, Willy Wong","doi":"10.1167/jov.24.7.2","DOIUrl":null,"url":null,"abstract":"<p><p>Bayesian adaptive methods for sensory threshold determination were conceived originally to track a single threshold. When applied to the testing of vision, they do not exploit the spatial patterns that underlie thresholds at different locations in the visual field. Exploiting these patterns has been recognized as key to further improving visual field test efficiency. We present a new approach (TORONTO) that outperforms other existing methods in terms of speed and accuracy. TORONTO generalizes the QUEST/ZEST algorithm to estimate simultaneously multiple thresholds. After each trial, without waiting for a fully determined threshold, the trial-oriented approach updates not only the location currently tested but also all other locations based on patterns in a reference data set. Since the availability of reference data can be limited, techniques are developed to overcome this limitation. TORONTO was evaluated using computer-simulated visual field tests: In the reliable condition (false positive [FP] = false negative [FN] = 3%), the median termination and root mean square error (RMSE) of TORONTO was 153 trials and 2.0 dB, twice as fast with equal accuracy as ZEST. In the FP = FN = 15% condition, TORONTO terminated in 151 trials and was 2.2 times faster than ZEST with better RMSE (2.6 vs. 3.7 dB). In the FP = FN = 30% condition, TORONTO achieved 4.2 dB RMSE in 148 trials, while all other techniques had > 6.5 dB RMSE and terminated much slower. In conclusion, TORONTO is a fast and accurate algorithm for determining multiple thresholds under a wide range of reliability and subject conditions.</p>","PeriodicalId":49955,"journal":{"name":"Journal of Vision","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11221609/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Vision","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.1167/jov.24.7.2","RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPHTHALMOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

Bayesian adaptive methods for sensory threshold determination were conceived originally to track a single threshold. When applied to the testing of vision, they do not exploit the spatial patterns that underlie thresholds at different locations in the visual field. Exploiting these patterns has been recognized as key to further improving visual field test efficiency. We present a new approach (TORONTO) that outperforms other existing methods in terms of speed and accuracy. TORONTO generalizes the QUEST/ZEST algorithm to estimate simultaneously multiple thresholds. After each trial, without waiting for a fully determined threshold, the trial-oriented approach updates not only the location currently tested but also all other locations based on patterns in a reference data set. Since the availability of reference data can be limited, techniques are developed to overcome this limitation. TORONTO was evaluated using computer-simulated visual field tests: In the reliable condition (false positive [FP] = false negative [FN] = 3%), the median termination and root mean square error (RMSE) of TORONTO was 153 trials and 2.0 dB, twice as fast with equal accuracy as ZEST. In the FP = FN = 15% condition, TORONTO terminated in 151 trials and was 2.2 times faster than ZEST with better RMSE (2.6 vs. 3.7 dB). In the FP = FN = 30% condition, TORONTO achieved 4.2 dB RMSE in 148 trials, while all other techniques had > 6.5 dB RMSE and terminated much slower. In conclusion, TORONTO is a fast and accurate algorithm for determining multiple thresholds under a wide range of reliability and subject conditions.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多伦多:以试验为导向的多维心理测试算法。
用于确定感觉阈值的贝叶斯自适应方法最初是为跟踪单一阈值而设计的。当应用于视觉测试时,它们没有利用视野中不同位置阈值的空间模式。利用这些模式已被认为是进一步提高视野测试效率的关键。我们提出的新方法(TORONTO)在速度和准确性方面都优于其他现有方法。TORONTO 推广了 QUEST/ZEST 算法,可同时估计多个阈值。每次试验后,无需等待完全确定的阈值,这种以试验为导向的方法不仅会更新当前测试的位置,还会根据参考数据集中的模式更新所有其他位置。由于参考数据的可用性可能有限,因此开发了一些技术来克服这一限制。通过计算机模拟视野测试对 TORONTO 进行了评估:在可靠的条件下(假阳性 [FP] = 假阴性 [FN] = 3%),TORONTO 的中位终止和均方根误差 (RMSE) 分别为 153 次和 2.0 dB,在精度相同的情况下是 ZEST 的两倍。在 FP = FN = 15%的条件下,TORONTO 在 151 次试验中终止,速度是 ZEST 的 2.2 倍,均方根误差(2.6 分贝对 3.7 分贝)更小。在 FP = FN = 30% 条件下,TORONTO 在 148 次试验中取得了 4.2 dB RMSE,而所有其他技术的 RMSE 都大于 6.5 dB,终止速度也慢得多。总之,TORONTO 是一种快速准确的算法,可在各种可靠性和受试者条件下确定多个阈值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Vision
Journal of Vision 医学-眼科学
CiteScore
2.90
自引率
5.60%
发文量
218
审稿时长
3-6 weeks
期刊介绍: Exploring all aspects of biological visual function, including spatial vision, perception, low vision, color vision and more, spanning the fields of neuroscience, psychology and psychophysics.
期刊最新文献
Individual differences reveal similarities in serial dependence effects across perceptual tasks, but not to oculomotor tasks. Investigating the relationship between subjective perception and unconscious feature integration. Binocular integration of chromatic and luminance signals. Deep convolutional neural networks are sensitive to face configuration. How the window of visibility varies around polar angle.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1