Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Algorithms”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12Linked to original sources

Simultaneous truth and performance level estimation (STAPLE): an algorithm for the validation of image segmentation.

Characterizing the performance of image segmentation approaches has been a persistent challenge. Performance analysis is important since segmentation algorithms often have limited accuracy and precision. Interactive drawing of the desired segmentation by human raters has often been the only acceptable approach, and yet suffers from intra-rater and inter-rater variability. Automated algorithms have been sought in order to remove the variability introduced by raters, but such algorithms must be assessed to ensure they are suitable for the task. The performance of raters (human or algorithmic) generating segmentations of medical images has been difficult to quantify because of the difficulty of obtaining or estimating a known true segmentation for clinical data. Although physical and digital phantoms can be constructed for which ground truth is known or readily estimated, such phantoms do not fully reflect clinical images due to the difficulty of constructing phantoms which reproduce the full range of imaging characteristics and normal and pathological anatomical variability observed in clinical data. Comparison to a collection of segmentations by raters is an attractive alternative since it can be carried out directly on the relevant clinical imaging data. However, the most appropriate measure or set of measures with which to compare such segmentations has not been clarified and several measures are used in practice. We present here an expectation-maximization algorithm for simultaneous truth and performance level estimation (STAPLE). The algorithm considers a collection of segmentations and computes a probabilistic estimate of the true segmentation and a measure of the performance level represented by each segmentation. The source of each segmentation in the collection may be an appropriately trained human rater or raters, or may be an automated segmentation algorithm. The probabilistic estimate of the true segmentation is formed by estimating an optimal combination of the segmentations, weighting each segmentation depending upon the estimated performance level, and incorporating a prior model for the spatial distribution of structures being segmented as well as spatial homogeneity constraints. STAPLE is straightforward to apply to clinical imaging data, it readily enables assessment of the performance of an automated image segmentation algorithm, and enables direct comparison of human rater and algorithm performance.

Algorithms↗

Accuracy and limitations of published algorithms using the twelve-lead electrocardiogram to localize overt atrioventricular accessory pathways.

INTRODUCTION: The purpose of this study was to evaluate the accuracy and limitations of published algorithms using the 12-lead ECG to localize AV accessory pathways (APs). METHODS AND RESULTS: The 11 relevant algorithms found in the literature (MEDLINE database and major scientific sessions) were tested on a series of 266 consecutive patients who successfully underwent radiofrequency catheter ablation of a single overt AV AP. The positive predictive values (PPV) of the algorithms in applicable patients were significantly lower for algorithms with > 6 accessory location sites (40.6% +/- 10.9% vs 61.2% +/- 8.0%; P < 0.03) and show a tendency for algorithms not relying on delta wave polarity but on QRS polarity only (36.6% +/- 11.2% vs 52.3% +/- 13.1%; P = 0.09). The PPV in applicable patients is related to the AP location (P < 0.001) and ranked from the highest to the lowest as follows: left lateral (mean PPV = 86.3%), posteroseptal (mean PPV = 65.2%), right anteroseptal (mean PPV = 45.2%), and right posterolateral (mean PPV = 23.4%). CONCLUSION: Our study suggests that the accuracy of algorithms relying on the 12-lead ECG depends on AP locations as defined in the algorithms and on the number of AP sites. The accuracy tends to be lower when delta wave polarity is not included in the algorithm's architecture. This should be considered when using these algorithms or when building new ones.

Adolescent↗

Testing and optimization of a semiautomatic prostate boundary segmentation algorithm using virtual operators.

Image analysis tasks such as size measurement and landmark-based registration require the user to select control points in an image. The output of such algorithms depends on the choice of control points. Since the choice of points varies from one user to the next, the requirement for user input introduces variability into the output of the algorithm. In order to test and/or optimize such algorithms, it is necessary to assess the multiplicity of outputs generated by the algorithm in response to a large set of inputs; however, the input of data requires substantial time and effort from multiple users. In this paper we describe a method to automate the testing and optimization of algorithms using "virtual operators," which consist of a set of spatial distributions describing how actual users select control points in an image. In order to construct the virtual operator, multiple users must repeatedly select control points in the image on which testing is to be performed. Once virtual operators are generated, control points for initializing the algorithm can be generated from them using a random number generator. Although an initial investment of time is required from the users in order to construct the virtual operator, testing and optimization of the algorithm can be done without further user interaction. We illustrate the construction and use of virtual operators by testing and optimizing our prostate boundary segmentation algorithm. The algorithm requires the user to select four control points on the prostate as input.

Algorithms↗

A generic genetic algorithm for generating beam weights.

A genetic algorithm for generating beam weights is described. The algorithm improves an objective measure of the dose distribution while respecting dose volume constraints placed on critical structures. The algorithm was used to select beam weights for treatment of abdominal tumors. Weights were selected for up to 36 beams. Dose volume limits were placed on normal organs and a dose inhomogeneity limit was placed on tumor. Volumes were represented as sets of several hundred discrete points. The algorithm searched for the beam weights that would make the minimum tumor dose as high as the constraints would allow. The results were checked using dose volume histograms with standard sized grids. Nineteen trials were created using six patient cases by changing the required field margin or allowed beam position in each case. The sampling of points was sufficiently dense to yield solutions that strictly satisfied the constraints when the prescribed dose was renormalized by a factor of less than 6%. The genetic algorithm supplied solutions in 49 min on average, and in a maximum time of 87 min. The randomized search does not guarantee optimality, but high tumor doses were obtained. An example is shown for which the solution of the genetic algorithm gave a minimum tumor dose 7 Gy higher than the solution given by a simulated annealing algorithm under the same set of constraints. The genetic algorithm can be generalized to admit nonlinear functions of the beam intensities in the objective or in the constraints. These can include tumor control and normal tissue complication probabilities. The genetic algorithm is an attractive procedure for assigning beam weights in multifield plans. It improves the dose distribution while respecting specified rules for tissue tolerance.

Abdominal Neoplasms↗

A new frame-based registration algorithm.

This paper presents a new algorithm for frame registration. Our algorithm requires only that the frame be comprised of straight rods, as opposed to the N structures or an accurate frame model required by existing algorithms. The algorithm utilizes the full 3D information in the frame as well as a least squares weighting scheme to achieve highly accurate registration. We use simulated CT data to assess the accuracy of our algorithm. We compare the performance of the proposed algorithm to two commonly used algorithms. Simulation results show that the proposed algorithm is comparable to the best existing techniques with knowledge of the exact mathematical frame model. For CT data corrupted with an unknown in-plane rotation or translation, the proposed technique is also comparable to the best existing techniques. However, in situations where there is a discrepancy of more than 2 mm (0.7% of the frame dimension) between the frame and the mathematical model, the proposed technique is significantly better (p < or = 0.05) than the existing techniques. The proposed algorithm can be applied to any existing frame without modification. It provides better registration accuracy and is robust against model mis-match. It allows greater flexibility on the frame structure. Lastly, it reduces the frame construction cost as adherence to a concise model is not required.

Algorithms↗

Evaluation of feedback-reduction algorithms for hearing aids.

Three adaptive feedback-reduction algorithms were implemented in a laboratory-based digital hearing aid system and evaluated with dynamic feedback paths and hearing-impaired subjects. The evaluation included measurements of maximum stable gain and subjective quality ratings. The continuously adapting CNN algorithm (Closed-loop processing with No probe Noise) provided the best performance: 8.5 dB of added stable gain (ASG) relative to a reference algorithm averaged over all subjects, ears, and vent conditions. Two intermittently adapting algorithms, ONO (Open-loop with Noise when Oscillation detected) and ONQ (Open-loop with Noise when Quiet detected), provided an average of 5 dB of ASG. Subjects with more severe hearing losses received greater benefits: 13 dB average ASG for the CNN algorithm and 7-8 dB average ASG for the ONO and ONQ algorithms. These values are conservative estimates of ASG because the fitting procedure produced a frequency-gain characteristic that already included precautions against feedback. Speech quality ratings showed no substantial algorithm effect on pleasantness or intelligibility, although subjects informally expressed strong objections to the probe noise used by the ONO and ONQ algorithms. This objection was not reflected in the speech quality ratings because of limitations of the experimental procedure. The results clearly indicate that the CNN algorithm is the most promising choice for adaptive feedback reduction in hearing aids.

Aged↗

Evaluation of array-processing algorithms for a headband hearing aid.

Several array-processing algorithms were implemented and evaluated with experienced hearing-aid users. The array consisted of four directional microphones mounted broadside on a headband worn on the top of the listener's head. The algorithms included two adaptive array-processing algorithms, one fixed array-processing algorithm, and a reference condition consisting of binaural directional microphones. The algorithms were evaluated under conditions with both one and three independent noise sources. Performance metrics included quantitative speech reception thresholds and qualitative subject preference ratings for ease-of-listening measured using a paired-comparison procedure. On average, the fixed algorithm improved speech reception thresholds by 2 dB, while the adaptive algorithms provided 7-9-dB improvement over the reference condition. Subjects judging ease-of-listening generally preferred all array-processing algorithms over the reference condition. The results suggest that these adaptive algorithms should be evaluated further in more realistic acoustic environments.

Aged↗

Impedance computed tomography using an adaptive smoothing coefficient algorithm.

In impedance computed tomography, a fixed coefficient regularization algorithm has been frequently used to improve the ill-conditioning problem of the Newton-Raphson algorithm. However, a lot of experimental data and a long period of computation time are needed to determine a good smoothing coefficient because a good smoothing coefficient has to be manually chosen from a number of coefficients and is a constant for each iteration calculation. Thus, sometimes the fixed coefficient regularization algorithm distorts the information or fails to obtain any effect. In this paper, a new adaptive smoothing coefficient algorithm is proposed. This algorithm automatically calculates the smoothing coefficient from the eigenvalue of the ill-conditioned matrix. Therefore, the effective images can be obtained within a short computation time. Also the smoothing coefficient is automatically adjusted by the information related to the real resistivity distribution and the data collection method. In our impedance system, we have reconstructed the resistivity distributions of two phantoms using this algorithm. As a result, this algorithm only needs one-fifth the computation time compared to the fixed coefficient regularization algorithm. When compared to the fixed coefficient regularization algorithm, it shows that the image is obtained more rapidly and applicable in real-time monitoring of the blood vessel.

Algorithms↗

An empirical analysis of cost outcomes of the Texas Medication Algorithm Project.

OBJECTIVE: Disease management systems that incorporate medication algorithms have been proposed as cost-effective means to offer optimal treatment for patients with severe and chronic mental illnesses. The Texas Medication Algorithm Project was designed to compare health care costs and clinical outcomes between patients who received algorithm-guided medication management or usual care in 19 public mental health clinics. METHODS: This longitudinal cohort study for patients with major depression (N=350), bipolar disorder (N=267), and schizophrenia (N=309) applied a multi-part declining-effects cost model. Outcomes were assessed by the Inventory of Depressive Symptomatology and the Brief Psychiatric Rating Scale. RESULTS: Compared with patients in usual care, patients in algorithm-based care incurred higher medication costs and had more frequent physician visits, although these differences often became smaller with time. For major depression, algorithm-based care achieved better outcomes sustainable with time but at higher agency and non-agency costs (mixed cost-effective). For bipolar disorder, patients in algorithm-based management achieved better outcomes at lower agency costs (cost-effective). For schizophrenia, patients in algorithm-based care achieved better outcomes that diminished with time, with no detectable difference in health care costs (cost-effective). CONCLUSIONS: Cost outcomes of algorithm-based care and usual care varied by disorder and over time. For bipolar disorder and schizophrenia, algorithm-based care improved outcomes without higher costs for health care services. For major depression, substantively better and sustained outcomes were obtained but at greater costs.

Algorithms↗

An integrative review of outcomes in patients with acute primary upper extremity deep venous thrombosis following no treatment or treatment with anticoagulation, thrombolysis, or surgical algorithms.

Primary upper extremity deep venous thrombosis (UEDVT) is a rare condition that typically affects young patients and can cause considerable long-term morbidity. Proposed treatments have included rest, heat, elevation of the affected limb, anticoagulation, thrombolysis, surgical decompression, percutaneous transluminal angioplasty (PTA), and stenting. However, the optimal management of primary UEDVT remains controversial. This study was an integrative review of the English-language literature since 1965 on primary UEDVT, with comparison of long-term symptoms, rethrombosis, and pulmonary embolism in 4 treatment algorithms: rest, heat, and elevation alone; anticoagulation alone; surgical decompression without thrombolysis; and algorithms including thrombolysis. Forty-one studies describing 559 patients met the criteria for inclusion. Statistically significant differences were found among the 4 treatment algorithms in the incidence of residual symptoms (p < 0.000), the incidence of pulmonary embolism (p < 0.000), and the incidence of rethrombosis (p < 0.027). Residual symptoms and the severity of residual symptoms were greatest in the rest, heat, and elevation algorithm (74%), followed by the surgical (60%), anticoagulation (44%), and thrombolysis (22%) algorithms. Pulmonary embolism was also greatest in the rest, heat, and elevation algorithm (12%), followed by the anticoagulation (7%), thrombolysis (1%), and surgical algorithms (0%), while rethrombosis was greatest in the thrombolytic algorithm (7%) followed by the surgical (3%), anticoagulation (2%), and rest, heat, and elevation (0%) algorithms. These results support the current clinical practice of a staged, multidisciplinary approach to treatment of primary UEDVT that includes thrombolytic therapy and possible surgical decompression. Further studies are needed to evaluate the natural history of patients treated with thrombolysis alone, to assess the optimal timing of surgical decompression, and to determine the best use of PTA and stenting in the multidisciplinary approach.

Acute Disease↗

Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm.

BACKGROUND: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biological sequences analysis. The SCS problem is well-known to be NP-complete. Many heuristic algorithms have been proposed. Some heuristics work well on a few long sequences (as in sequence comparison applications); others work well on many short sequences (as in oligo-array synthesis). Unfortunately, most do not work well on large SCS instances where there are many, long sequences. RESULTS: In this paper, we present a Deposition and Reduction (DR) algorithm for solving large SCS instances of biological sequences. There are two processes in our DR algorithm: deposition process, and reduction process. The deposition process is responsible for generating a small set of common supersequences; and the reduction process shortens these common supersequences by removing some characters while preserving the common supersequence property. Our evaluation on simulated data and real DNA and protein sequences show that our algorithm consistently produces the best results compared to many well-known heuristic algorithms, and especially on large instances. CONCLUSION: Our DR algorithm provides a partial answer to the open problem of designing efficient heuristic algorithm for SCS problem on many long sequences. Our algorithm has a bounded approximation ratio. The algorithm is efficient, both in running time and space complexity and our evaluation shows that it is practical even for SCS problems on many long sequences.

Algorithms↗

Accuracy of popular automatic QT interval algorithms assessed by a 'gold standard' and comparison with a Novel method: computer simulation study.

BACKGROUND: Accurate measurement of the QT interval is very important from a clinical and pharmaceutical drug safety screening perspective. Expert manual measurement is both imprecise and imperfectly reproducible, yet it is used as the reference standard to assess the accuracy of current automatic computer algorithms, which thus produce reproducible but incorrect measurements of the QT interval. There is a scientific imperative to evaluate the most commonly used algorithms with an accurate and objective 'gold standard' and investigate novel automatic algorithms if the commonly used algorithms are found to be deficient. METHODS: This study uses a validated computer simulation of 8 different noise contaminated ECG waveforms (with known QT intervals of 461 and 495 ms), generated from a cell array using Luo-Rudy membrane kinetics and the Crank-Nicholson method, as a reference standard to assess the accuracy of commonly used QT measurement algorithms. Each ECG contaminated with 39 mixtures of noise at 3 levels of intensity was first filtered then subjected to three threshold methods (T1, T2, T3), two T wave slope methods (S1, S2) and a Novel method. The reproducibility and accuracy of each algorithm was compared for each ECG. RESULTS: The coefficient of variation for methods T1, T2, T3, S1, S2 and Novel were 0.36, 0.23, 1.9, 0.93, 0.92 and 0.62 respectively. For ECGs of real QT interval 461 ms the methods T1, T2, T3, S1, S2 and Novel calculated the mean QT intervals(standard deviations) to be 379.4(1.29), 368.5(0.8), 401.3(8.4), 358.9(4.8), 381.5(4.6) and 464(4.9) ms respectively. For ECGs of real QT interval 495 ms the methods T1, T2, T3, S1, S2 and Novel calculated the mean QT intervals(standard deviations) to be 396.9(1.7), 387.2(0.97), 424.9(8.7), 386.7(2.2), 396.8(2.8) and 493(0.97) ms respectively. These results showed significant differences between means at >95% confidence level. Shifting ECG baselines caused large errors of QT interval with T1 and T2 but no error with Novel. CONCLUSION: The algorithms T2, T1 and Novel gave low coefficients of variation for QT measurement. The Novel technique gave the most accurate measurement of QT interval, T3 (a differential threshold method) was the next most accurate by a large margin. The objective and accurate 'gold standard' presented in this paper may be useful to assess new QT measurement algorithms. The Novel algorithm may prove to be more accurate and reliable method to measure the QT interval.

Algorithms↗

ICD-10 coding algorithms for defining comorbidities of acute myocardial infarction.

BACKGROUND: With the introduction of ICD-10 throughout Canada, it is important to ensure that Acute Myocardial Infarction (AMI) comorbidities employed in risk adjustment methods remain valid and robust. Therefore, we developed ICD-10 coding algorithms for nine AMI comorbidities, examined the validity of the ICD-10 and ICD-9 coding algorithms in detection of these comorbidities, and assessed their performance in predicting mortality. The nine comorbidities that we examined were shock, diabetes with complications, congestive heart failure, cancer, cerebrovascular disease, pulmonary edema, acute renal failure, chronic renal failure, and cardiac dysrhythmias. METHODS: Coders generated a comprehensive list of ICD-10 codes corresponding to each AMI comorbidity. Physicians independently reviewed and determined the clinical relevance of each item on the list. To ensure that the newly developed ICD-10 coding algorithms were valid in recording comorbidities, medical charts were reviewed. After assessing ICD-10 algorithms' validity, both ICD-10 and ICD-9 algorithms were applied to a Canadian provincial hospital discharge database to predict in-hospital, 30-day, and 1-year mortality. RESULTS: Compared to chart review data as a 'criterion standard', ICD-9 and ICD-10 data had similar sensitivities (ranging from 7.1-100%), and specificities (above 93.6%) for each of the nine AMI comorbidities studied. The frequencies for the comorbidities were similar between ICD-9 and ICD-10 coding algorithms for 49,861 AMI patients in a Canadian province during 1994-2004. The C-statistics for predicting 30-day and 1 year mortality were the same for ICD-9 (0.82) and for ICD-10 data (0.81). CONCLUSION: The ICD-10 coding algorithms developed in this study to define AMI comorbidities performed similarly as past ICD-9 coding algorithms in detecting conditions and risk-adjustment in our sample. However, the ICD-10 coding algorithms should be further validated in external databases.

Adult↗

Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms.

Two-dimensional (2-D) phase unwrapping, that is, deducing unambiguous phase values from a 2-D array of values known only modulo 2pi, is a key step in interpreting data acquired with synthetic aperture radar interferometry. Noting the recent network formulation of the phase unwrapping problem, we apply here some well-established ideas of network theory to formalize the problem, analyze its complexity, and derive algorithms for its solution. It has been suggested that the objective of phase unwrapping should be to minimize the total number of places where unwrapped and wrapped phase gradients differ. Here we use network constructions to show that this so-called minimum L0-norm problem is NP-hard, or one that complexity theory suggests is impossible for efficient algorithms to solve exactly. Therefore we must instead find approximate solutions; we present two new algorithms for doing so. The first uses the network ideas of shortest paths and spanning trees to improve on the Goldstein et al. residue-cut algorithm [Radio Sci. 23, 713 (1988)]. Our improved algorithm is very fast, provides complete coverage, and allows user-defined weights. With our second algorithm, we extend the ideas of linear network flow problems to the nonlinear L0 case. This algorithm yields excellent approximations to the minimum L0 norm. Using interferometric data, we demonstrate that our algorithms are highly competitive with other existing algorithms in speed and accuracy, outperforming them in the cases presented here.

Algorithms↗

Use of the preconditioned conjugate gradient algorithm as a generic solver for mixed-model equations in animal breeding applications.

Utility of the preconditioned conjugate gradient algorithm with a diagonal preconditioner for solving mixed-model equations in animal breeding applications was evaluated with 16 test problems. The problems included single- and multiple-trait analyses, with data on beef, dairy, and swine ranging from small examples to national data sets. Multiple-trait models considered low and high genetic correlations. Convergence was based on relative differences between left- and right-hand sides. The ordering of equations was fixed effects followed by random effects, with no special ordering within random effects. The preconditioned conjugate gradient program implemented with double precision converged for all models. However, when implemented in single precision, the preconditioned conjugate gradient algorithm did not converge for seven large models. The preconditioned conjugate gradient and successive overrelaxation algorithms were subsequently compared for 13 of the test problems. The preconditioned conjugate gradient algorithm was easy to implement with the iteration on data for general models. However, successive overrelaxation requires specific programming for each set of models. On average, the preconditioned conjugate gradient algorithm converged in three times fewer rounds of iteration than successive overrelaxation. With straightforward implementations, programs using the preconditioned conjugate gradient algorithm may be two or more times faster than those using successive overrelaxation. However, programs using the preconditioned conjugate gradient algorithm would use more memory than would comparable implementations using successive overrelaxation. Extensive optimization of either algorithm can influence rankings. The preconditioned conjugate gradient implemented with iteration on data, a diagonal preconditioner, and in double precision may be the algorithm of choice for solving mixed-model equations when sufficient memory is available and ease of implementation is essential.

Algorithms↗

Evaluation of alternative algorithms used to simulate pasture intake in grazing dairy cows.

Four algorithms used to simulate pasture intake in grazing dairy cows in a dairy decision support system were proposed and evaluated with data from the literature. The algorithms proposed were: 1) an algorithm combining the approach used in a published model to determine dry matter intake based on neutral detergent fiber intake as a percentage of the BW, energy requirements, pasture availability and a standard supplementation (PIest), 2) the previous algorithm modified to consider the type and amount of supplementation (PIsup), 3) an algorithm which considers the effect of selection of pasture (PIsel), and 4) the combination of algorithms 2 and 3 (PIsupsel). Pasture intake data of 27 grazing experiments from the literature were used to evaluate those algorithms. Two methods of evaluation were used: 1) simple linear regression between reported and simulated values, and 2) analysis of variance for the difference between reported and simulated values considering pasture availability and type of supplementation. The R2 of the linear regression and average proportional bias between reported values and simulated values were 0.24 and 19% for PIest, 0.42, and 23% for PIsup, 0.45 and 2% for PIsel and 0.41 and 10% for PIsupsel. Those results showed that PIsel had the lower variability and the values closer to pasture intake. The algorithm PIsup had low variability but tended to underpredict pasture intake. The algorithm PIest values were closer to reported values for low pasture availability. The modeling results show the influence of pasture selection in grazing systems.

Algorithms↗

Ultrasonographic texture analysis of parenchymatous organs by the four-neighborhood-pixels algorithm: clinical experiment.

OBJECTIVE: The parenchyma of organs such as liver, thyroid, and mammary gland during climacterium have common ultrasonographic textural features, which together form what we call small-dot-structure texture. To study this texture we designed the 4-neighborhood-pixels algorithm, an ultrasonographic texture analysis algorithm. The objective of this study was to confirm whether the 4-neighborhood-pixels algorithm can reflect the features of small-dot-structure texture. METHODS: A changed small-dot-structure texture and 3 other textures were compared with the normal small-dot-structure texture in 4 groups, and a histogram algorithm was used for contrast with the 4-neighborhood-pixels algorithm. RESULTS: The 4-neighborhood-pixels algorithm could reflect all the textural differences, but the histogram algorithm could reflect only some of them. CONCLUSIONS: The 4-neighborhood-pixels algorithm is a good algorithm for analyzing ultrasonographic small-dot-structure texture. Not only can it reflect changes in the small-dot-structure texture, but it can also differentiate between small-dot-structure and non-small-dot-structure textures.

Adipose Tissue↗

The SITA perimetric threshold algorithms in glaucoma.

PURPOSE: To determine the within-visit between-algorithm and the within-algorithm between-visit differences in sensitivity for the SITA Standard, SITA Fast, FASTPAC, and Full Threshold algorithms in stable primary open angle glaucoma. METHODS: One designated eye from each of 29 patients (age 67.3 +/- 10.2 years; mean +/- SD) experienced in automated perimetry was examined with the four algorithms on each of three visits, using the Humphrey Field Analyzer 750 and Program 30-2. RESULTS: The group mean Mean Sensitivity was 1.0 dB greater for SITA Standard than Full Threshold (P < 0.001), 0.7 dB greater for SITA Standard than FASTPAC (P < 0.001), 1.6 dB greater for SITA Fast than FASTPAC (P < 0.001), and 0.9 dB greater for SITA Fast than SITA Standard (P < 0.001). The higher pointwise sensitivity for SITA Fast compared to Full Threshold, FASTPAC, and SITA Standard increased with increase in defect depth. The examination duration for SITA Standard was 53% of that for Full Threshold and 50% shorter for SITA Fast compared to FASTPAC (P < 0.001), regardless of age (P = 0.932). The examination duration increased with increase in severity of field loss (P < 0.001), and this increase was proportionately greater for both SITA algorithms (P < 0.001), particularly SITA Fast. The Total and Pattern Deviation probability analyses of both SITA algorithms yielded a statistically greater defect than Full Threshold or FASTPAC (P < 0.001). The within-algorithm between-visit differences were similar between SITA Standard and Full Threshold and between SITA Fast and FASTPAC. CONCLUSIONS: Both SITA algorithms produce a marginally higher differential light sensitivity compared to existing algorithms but with a statistically deeper defect and a marked reduction in examination duration.

Adult↗