A new generation of algorithms for computerized threshold perimetry, SITA
(1997) In Acta Ophthalmologica Scandinavica 75(4). p.75-368- Abstract
PURPOSE: The purpose of this work was to develop a new family of test algorithms for computerized static threshold perimetry which significantly reduces test time without any reduction of data quality.
METHODS: A comprehensive visual field model constructed from available knowledge of normal and glaucomatous visual fields is continuously updated during testing. The model produces threshold estimates and also estimates of the certainty to which the threshold is known at each point. Testing is interrupted at each test location at predetermined levels of threshold certainty. New time-saving methods are employed for estimation of false answers, and test pacing is optimized. After completion of the test, all threshold estimates are... (More)
PURPOSE: The purpose of this work was to develop a new family of test algorithms for computerized static threshold perimetry which significantly reduces test time without any reduction of data quality.
METHODS: A comprehensive visual field model constructed from available knowledge of normal and glaucomatous visual fields is continuously updated during testing. The model produces threshold estimates and also estimates of the certainty to which the threshold is known at each point. Testing is interrupted at each test location at predetermined levels of threshold certainty. New time-saving methods are employed for estimation of false answers, and test pacing is optimized. After completion of the test, all threshold estimates are re-computed, taking into account the complete body of patient responses. Computer simulations were used to optimize the different parameters of the new algorithms, to evaluate the relative importance of those parameters, and to evaluate the performance of the algorithm as a whole in comparison with a standard algorithm.
RESULTS: Simulated test results obtained with this algorithm were slightly more accurate than those of the Humphrey Full Threshold test algorithm. The number of simulated stimuli presented was reduced by an average of 29% in normal fields and 26% in glaucomatous fields. Actual clinical test time should be further reduced, since the influence of the improved timing algorithm was not included in the simulations.
CONCLUSIONS: We applied new methods which take available knowledge of visual field physiology and pathophysiology into account, and employ modern computer-intensive mathematical methods for real time estimates of threshold values and threshold error estimates. In this way it was possible to design a family of testing algorithms which significantly reduced perimetric test time without any loss of quality in results.
(Less)
- author
- Bengtsson, Boel LU ; Olsson, Jonny ; Heijl, A LU and Rootzén, H LU
- organization
- publishing date
- 1997-08
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Algorithms, Computer Simulation, Diagnosis, Computer-Assisted, Glaucoma, Humans, Models, Biological, Reference Values, Sensory Thresholds, Visual Field Tests, Visual Fields
- in
- Acta Ophthalmologica Scandinavica
- volume
- 75
- issue
- 4
- pages
- 8 pages
- publisher
- Wiley
- external identifiers
-
- scopus:0030817329
- pmid:9374242
- ISSN
- 1395-3907
- DOI
- 10.1111/j.1600-0420.1997.tb00392.x
- language
- English
- LU publication?
- yes
- id
- 2c3ac22c-fdac-45f3-9f3f-563f663db60a
- date added to LUP
- 2016-04-21 10:04:08
- date last changed
- 2024-04-18 23:27:08
@article{2c3ac22c-fdac-45f3-9f3f-563f663db60a,
abstract = {{<p>PURPOSE: The purpose of this work was to develop a new family of test algorithms for computerized static threshold perimetry which significantly reduces test time without any reduction of data quality.</p><p>METHODS: A comprehensive visual field model constructed from available knowledge of normal and glaucomatous visual fields is continuously updated during testing. The model produces threshold estimates and also estimates of the certainty to which the threshold is known at each point. Testing is interrupted at each test location at predetermined levels of threshold certainty. New time-saving methods are employed for estimation of false answers, and test pacing is optimized. After completion of the test, all threshold estimates are re-computed, taking into account the complete body of patient responses. Computer simulations were used to optimize the different parameters of the new algorithms, to evaluate the relative importance of those parameters, and to evaluate the performance of the algorithm as a whole in comparison with a standard algorithm.</p><p>RESULTS: Simulated test results obtained with this algorithm were slightly more accurate than those of the Humphrey Full Threshold test algorithm. The number of simulated stimuli presented was reduced by an average of 29% in normal fields and 26% in glaucomatous fields. Actual clinical test time should be further reduced, since the influence of the improved timing algorithm was not included in the simulations.</p><p>CONCLUSIONS: We applied new methods which take available knowledge of visual field physiology and pathophysiology into account, and employ modern computer-intensive mathematical methods for real time estimates of threshold values and threshold error estimates. In this way it was possible to design a family of testing algorithms which significantly reduced perimetric test time without any loss of quality in results.</p>}},
author = {{Bengtsson, Boel and Olsson, Jonny and Heijl, A and Rootzén, H}},
issn = {{1395-3907}},
keywords = {{Algorithms; Computer Simulation; Diagnosis, Computer-Assisted; Glaucoma; Humans; Models, Biological; Reference Values; Sensory Thresholds; Visual Field Tests; Visual Fields}},
language = {{eng}},
number = {{4}},
pages = {{75--368}},
publisher = {{Wiley}},
series = {{Acta Ophthalmologica Scandinavica}},
title = {{A new generation of algorithms for computerized threshold perimetry, SITA}},
url = {{http://dx.doi.org/10.1111/j.1600-0420.1997.tb00392.x}},
doi = {{10.1111/j.1600-0420.1997.tb00392.x}},
volume = {{75}},
year = {{1997}},
}