Skip to content

Swedish Interactive Thresholding Algorithm

An adaptive static-perimetry algorithm family that continuously updates a visual-field model from patient responses and stops testing each location when a specified threshold-certainty criterion is met.

Version
v1 · 2026-08-30 · History
Domain-specific #
2908
Origin domain
ophthalmic diagnostics
Subdomain
automated perimetry
Aliases
SITA

Core Idea

The Swedish Interactive Thresholding Algorithm, or SITA, is a family of computerized static-perimetry strategies for estimating visual sensitivity at many locations in a patient's visual field. Rather than applying an independent fixed staircase at every location, SITA maintains a comprehensive model informed by normal and glaucomatous fields, updates that model as responses arrive, estimates both threshold and uncertainty at each location, and ends testing at a location when a predetermined certainty level has been reached. The original developers explicitly presented this coupled model-update and certainty-stopping architecture as a way to reduce test time without reducing result quality.

Scope of Application

The primary scope is standard automated perimetry used to detect or monitor visual-field loss, especially in glaucoma and glaucoma suspicion. The same role package applies across many patients, field locations, severity levels, and recurring examinations. The 1997 construction paper compared simulations for normal and glaucomatous fields and described a family rather than one fixed patient trace.

Clinical evaluations established that the algorithmic choices recur as test strategies. In normal subjects, SITA testing took about half the time of Humphrey Full Threshold testing while threshold agreement and variability remained acceptable.

Clarity

Imagine a field location for which the initial model predicts near-normal sensitivity. A bright stimulus is seen, so the algorithm can raise its estimate; a dimmer stimulus is missed, narrowing the plausible interval. Responses at neighboring locations and the field model help determine what evidence is worth gathering next. When the estimated error reaches the variant's stopping criterion, that location no longer consumes presentations.

Manages Complexity

Conventional exhaustive thresholding multiplies a lengthy psychophysical search by dozens of locations. Patient fatigue can itself degrade attention and reliability, so test economy is part of measurement quality rather than mere convenience. SITA compresses the joint problem: exploit shared field structure, allocate presentations according to remaining uncertainty, estimate response reliability from ordinary test behavior, and stop gathering low-value evidence.

Abstract Reasoning

At each location \(j\), let \(\hat{t}_j\) denote the current threshold estimate and \(u_j\) its uncertainty. A response \(r\) to a stimulus of level \(s\) changes the evidence for plausible values of \(t_j\), and the field model couples that update to contextual information. Testing continues while \(u_j\) exceeds the strategy's allowed uncertainty and stops when its certainty rule is satisfied.

Knowledge Transfer

SITA illustrates a domain-bound instance of adaptive sequential measurement: combine prior structure with incoming observations, focus resources where uncertainty remains, and terminate when the required precision has been achieved. This skeleton transfers to other psychophysical and diagnostic tests only if the receiving setting has comparable sequential responses, estimable uncertainty, a defensible prior model, and explicit stopping criteria.

Relationships to Other Abstractions

Local relationship map for Swedish Interactive Thresholding AlgorithmParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Swedish Interactive …DOMAINPrime abstraction: Algorithm — is a kind ofAlgorithmPRIME

Current abstraction Swedish Interactive Thresholding Algorithm Domain-specific

Parents (1) — more general patterns this builds on

  • Swedish Interactive Thresholding Algorithm is a kind of Algorithm Prime

    SITA is a strict specialization of Algorithm: it is a defined procedure mapping a perimetric test configuration and sequential patient responses to local threshold estimates and reliability information.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Swedish Interactive Thresholding Algorithm sits in a sparse region of the domain-specific corpus (95th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08