SEARCH · PubMed Health

Results for “algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

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

At least 271 records · Page 15Linked to original sources

PubMed2000

Comparison of 3-D maximum a posteriori and filtered backprojection algorithms for high-resolution animal imaging with microPET.

We have evaluated the performance of two three-dimensional (3-D) reconstruction algorithms with data acquired from microPET, a high resolution tomograph dedicated to small animal imaging. The first was a linear filtered-backprojection algorithm (FBP) with reprojection of the missing data, and the second was a statistical maximum a posteriori probability algorithm (MAP). The two algorithms were evaluated in terms of their resolution performance, both in phantoms and in vivo. Sixty independent realizations of a phantom simulating the brain of a baby monkey were acquired, each containing three million counts. Each of these realizations was reconstructed independently with both algorithms. The ensemble of the 60 reconstructed realizations was used to estimate the standard deviation as a measure of the noise for each reconstruction algorithm. More detail was recovered in the MAP reconstruction without an increase in noise relative to FBP. Studies in a simple cylindrical compartment phantom demonstrated improved recovery of known activity ratios with MAP. Finally, in vivo studies also demonstrated a clear improvement in spatial resolution using the MAP algorithm. The quantitative accuracy of the MAP reconstruction was also evaluated by comparison with autoradiography and direct well counting of tissue samples and was shown to be superior.

Algorithms↗

PubMed2000

Quasi-exact filtered backprojection algorithm for long-object problem in helical cone-beam tomography.

Exact reconstruction from axially truncated cone-beam projections acquired with a helical vertex path is a challenging problem for which solutions are currently under investigation by some researchers. This paper deals with a difficult class of this problem called the long-object problem. Its purpose is to reconstruct a central region of interest (ROI) of a long object when the helical path extends only a little bit above and below the ROI. By extending the authors' recent approach based on the triangular decomposition of the Grangeat formula, we derive quasi-exact reconstruction algorithms whose overall structure is of filtered backprojection (FBP) style. Unlike the previous similar approaches to the long-object problem, the proposed FBP algorithms do not require additional two circular scans at the ends of the helical path. Furthermore, the algorithms require a significantly smaller detector area and achieve improved image quality even for a large pitch compared with the approximate Feldkamp algorithms. One drawback of the proposed algorithms is the computational time, which is much longer than for the Feldkamp algorithms. We show some simulation results to demonstrate the performances of the proposed algorithms.

Algorithms↗

PubMed2001

An interior point iterative maximum-likelihood reconstruction algorithm incorporating upper and lower bounds with application to SPECT transmission imaging.

The algorithm we consider here is a block-iterative (or ordered subset) version of the interior point algorithm for transmission reconstruction. Our algorithm is an interior point method because each vector of the iterative sequence [x(k)], k = 0, 1, 2, ... satisfies the constraints a(j) < x(j)k < b(j), j = 1, ..., J. Because it is a block-iterative algorithm that reconstructs the transmission attenuation map and places constraints above and below the pixel values of the reconstructed image, we call it the BITAB method. Computer simulations using the three-dimensional mathematical cardiac and torso phantom, reveal that the BITAB algorithm in conjunction with reasonably selected prior upper and lower bounds has the potential to improve the accuracy of the reconstructed attenuation coefficients from truncated fan beam transmission projections. By suitably selecting the bounds, it is possible to restrict the over estimation of coefficients outside the fully sampled region, that results from reconstructing truncated fan beam projections with iterative transmission algorithms such as the maximum-likelihood gradient type algorithm.

Algorithms↗

PubMed2002

A novel algorithm for cardiac biosignal filtering based on filtered residue method.

In this paper, a new algorithm is presented for the filtering (de-noising) of cardiac bioelectrical signals. The primary target of this algorithm is the class of cardiac action potentials recorded using voltage-sensitive dyes, although the method is also applied to electrocardiographic signals. High periodicity is one of the main features of cardiac biosignals. The proposed algorithm exploits this feature in filtering signals with a minimum amount of distortion. The basic idea is to use signal averaging in time to find the stationary portion of the signal. The residue is found by subtracting the signal average from the corresponding points of the input. After passing through a low-pass filter, the filtered residue (FR) is added back to the signal average to reconstruct the output. The practical implementation of the filter residue algorithm is discussed. Stretching and shrinking operations are the basis for the conversion of quasi-periodic signals into periodic signals, which can then be subjected to the FR algorithm. Various examples are presented, and error estimation is performed to guide the selection of optimal parameters for the algorithm. The ability of the algorithm to reconstruct the variation among beats is demonstrated, and its limitations are discussed.

Action Potentials↗

PubMed1994

A new pacing algorithm for overdrive suppression of atrial fibrillation. Chorus Multicentre Study Group.

Constant rapid pacing may suppress arrhythmias, but it is usually poorly tolerated in the long term. We report a pilot study of a new pacing algorithm for overdrive suppression of atrial premature complexes (APCs) and atrial fibrillation (AF), which prevents postextrasystolic pauses and varies the pacing rate in response to the frequency of APCs. The algorithm was tested in a multiple crossover study for 24 hours in dual chamber pacemakers implanted in 70 patients. Comparison was made on ambulatory recordings between the number of atrial arrhythmias commencing with the algorithm active and inactive. In all cases, the algorithm functioned as designed. No patient was aware of its operation, and no malignant arrhythmias were induced. The 36 recordings that showed atrial arrhythmia were included for analysis. The effects of the algorithm were: APCs (estimated from pacemaker statistics) reduced in 18 patients, increased in 8 (P = 0.02); atrial salvos reduced in 12, increased in 4 (P = 0.041); and AF reduced in 11, increased in 8 (P = NS). In all patients with frequent AF (> 5 episodes in total), fewer episodes occurred when the algorithm was active. We conclude that the algorithm is safe and well tolerated, reduces atrial ectopic activity, and may reduce the frequency of sustained atrial fibrillation.

Adult↗

PubMed1996

Limitations of tachycardia confirmation and rate classification algorithms in a third-generation implantable cardioverter defibrillator.

Newer ICDs provide antitachycardia (ATP) and bradycardia pacing and cardioversion and defibrillation shocks based on sensed interval criteria. The objectives of this investigation were to determine the algorithm related errors in tachycardia confirmation and rate classification that occurred in patients with a third-generation, noncommitted, tiered ICD therapy. Forty-three consecutive patients with the Guardian ATP 4210 ICD, which uses an X out of Y sensed interval counting algorithm for tachycardia detection, confirmation, and classification were studied. Surface ECGs, intracardiac electrograms, stored data logs, and sense histories were reviewed to diagnose errors due to these algorithms that resulted in delivery of inappropriate therapy or inhibition of appropriate therapy. Sixty-eight classification or confirmation algorithm errors from 7,610 tachycardia detections (< 1%) were diagnosed in 23 (53%) of 43 patients. Three types of errors not related to device or sensing lead malfunction or programming mistakes were seen. In 26 episodes, the confirmation algorithm failed to detect late tachycardia reversion of nonsustained tachyarrhythmias, on the last or next to last sensed interval, and did not inhibit ATP (n = 17) or shocks (n = 9). In 28 episodes, inaccurate classification of tachycardia rate resulted in inappropriate ATP (n = 23) or shock (n = 5) therapy. In 14 episodes, the posttherapy reconformation algorithm produced inhibition of VVI pacing and prolonged asystole following shock therapy. These errors in tachycardia confirmation and rate classification were due to the inherent limitations of the X out of Y counting algorithm.

Adult↗

PubMed1998

First experience with an automatic sensing algorithm in single-lead VDD stimulation.

UNLABELLED: An "Autosensing" algorithm available in SSI(R) and DDR(R) pacemakers automatically adapts the device's sensitivity to changing intracardiac signals. The atrial sensing function of this algorithm was tested for the first time with a VDD pacing system in which large variations of the atrial signal may occur because the atrial electrodes float in the atrial blood pool. METHODS: 15 patients with a VDD pacing system were studied (Unity 292-07, lead 425; Sulzer Intermedics). The atrial sensing threshold was measured, and the atrial sensitivity was programmed with a 2:1 safety margin. The autosensing algorithm and sensitivity profile were temporarily activated, and an ambulatory ECG with continuous marker annotation was recorded. All patients underwent a 30-minute daily life activities protocol. A beat-to-beat analysis of the ambulatory ECG was correlated with the changes in atrial sensitivity. RESULTS: The algorithm changed the baseline sensitivity from 0.57 +/- 0.23 mV during the test to 0.39 +/- 0.20 mV after the final rest period (P < 0.05). During the test 12.6 +/- 10.2 adaptations of the sensitivity occurred (range 0-33). In eight patients atrial undersensing occurred in 4.4% +/- 7.5% of the cycles (4-458 unsensed P waves). In these patients, the algorithm continuously adjusted the sensitivity towards more sensitive values, operating 19.1 +/- 18.3 changes compared with 5.4 +/- 7.3 changes in patients without undersensing (P = 0.009). Oversensing did not occur. CONCLUSION: The autosensing algorithm effectively optimized atrial sensitivity in VDD pacing. In patients with atrial undersensing the algorithm continuously remained near the most sensitive settings, thus reacting as intended. A faster sensitivity adjustment of the system would be desirable.

Activities of Daily Living↗

PubMed1995

A convolution-adapted ratio-TAR algorithm for 3D photon beam treatment planning.

A convolution-adapted ratio of tissue-air ratios (CARTAR) method of dose calculation has been developed at the Mallinckrodt Institute of Radiology. This photon pencil-beam algorithm has been developed and implemented specifically for three-dimensional treatment planning. In a standard ratio of tissue-air ratios (RTAR) algorithm, doses to points in irregular field geometries are not adequately modeled. This is inconsistent with the advent of conformal therapy, the goal of which is to conform the dose distribution to the target volume while sparing neighboring sensitive normal critical structures. This motivated us to develop an algorithm that can model the beam penumbra near irregular field edges, while retaining much of the speed for the original RTAR algorithm. The dose calculation algorithm uses two-dimensional (2D) convolutions, computed by 2D fast Fourier transform, of pencil-beam kernels with a beam transmission array to calculate 2D off-axis profiles at a series of depths. These profiles are used to replace the product of the transmission function and measured square-field boundary factors used in the standard RTAR calculation. The 2D pencil-beam kernels were derived from measured data for each modality using commonly available dosimetry equipment. The CARTAR algorithm is capable of modeling the penumbra near block edges as well as the loss of primary and scattered beam in partially blocked regions. This paper describes the dose calculation algorithm, implementation, and verification.

Algorithms↗

PubMed2002

Comparison of two algorithms for determining beam weights and wedge filters.

This article compares two algorithms for determining beam weights and wedge filters for conformal treatment planning. One algorithm, which is based on dose-gradient analysis, provides analytic formulas for determining beam weights, wedge angles, and collimator angles (i.e., wedge orientations) so that the dose distribution is homogeneous in the target volume. The second algorithm is based on the concept of the super-omni wedge (i.e., the arrangement of two pairs of orthogonal nominal wedged beams), numerically optimize beam weights, wedge angles, and collimator angles so that the dose requirements to targets and organs at risk are satisfied to the best. Three clinical cases were tested. For the first case, both algorithms resulted in comparable homogeneous dose distributions in the target volume. For the second case, the second algorithm resulted in much lower doses to the eyes plus a better homogeneous dose distribution in the target volume. For the third case, only the second algorithm was applicable, and the treatment plan it developed met the prescribed requirements. The results show that the first algorithm is better in terms of feasibility, whereas the second is better in terms of applicability and the quality of treatment plans.

Algorithms↗

PubMed1990

Algorithms for separating the speech of interfering talkers: evaluations with voiced sentences, and normal-hearing and hearing-impaired listeners.

Two signal-processing algorithms, derived from those described by Stubbs and Summerfield [R.J. Stubbs and Q. Summerfield, J. Acoust. Soc. Am. 84, 1236-1249 (1988)], were used to separate the voiced speech of two talkers speaking simultaneously, at similar intensities, in a single channel. Both algorithms use fundamental frequency (FO) as the basis for segregation. One attenuates the interfering voice by filtering the cepstrum of the signal. The other is a hybrid algorithm that combines cepstral filtering with the technique of harmonic selection [T.W. Parsons, J. Acoust. Soc. Am. 60, 911-918 (1976)]. The algorithms were evaluated and compared in perceptual experiments involving listeners with normal hearing and listeners with cochlear hearing impairments. In experiment 1 the processing was used to separate voiced sentences spoken on a monotone. Both algorithms gave significant increases in intelligibility to both groups of listeners. The improvements were equivalent to an increase of 3-4 dB in the effective signal-to-noise ratio (SNR). In experiment 2 the processing was used to separate voiced sentences spoken with time-varying intonation. For normal-hearing listeners, cepstral filtering gave a significant increase in intelligibility, while the hybrid algorithm gave an increase that was on the margins of significance (p = 0.06). The improvements were equivalent to an increase of 2-3 dB in the effective SNR. For impaired listeners, no intelligibility improvements were demonstrated with intoned sentences. The decrease in performance for intoned material is attributed to limitations of the algorithms when FO is nonstationary.

Algorithms↗

PubMed2002

CCCP algorithms to minimize the Bethe and Kikuchi free energies: convergent alternatives to belief propagation.

This article introduces a class of discrete iterative algorithms that are provably convergent alternatives to belief propagation (BP) and generalized belief propagation (GBP). Our work builds on recent results by Yedidia, Freeman, and Weiss (2000), who showed that the fixed points of BP and GBP algorithms correspond to extrema of the Bethe and Kikuchi free energies, respectively. We obtain two algorithms by applying CCCP to the Bethe and Kikuchi free energies, respectively (CCCP is a procedure, introduced here, for obtaining discrete iterative algorithms by decomposing a cost function into a concave and a convex part). We implement our CCCP algorithms on two- and three-dimensional spin glasses and compare their results to BP and GBP. Our simulations show that the CCCP algorithms are stable and converge very quickly (the speed of CCCP is similar to that of BP and GBP). Unlike CCCP, BP will often not converge for these problems (GBP usually, but not always, converges). The results found by CCCP applied to the Bethe or Kikuchi free energies are equivalent, or slightly better than, those found by BP or GBP, respectively (when BP and GBP converge). Note that for these, and other problems, BP and GBP give very accurate results (see Yedidia et al., 2000), and failure to converge is their major error mode. Finally, we point out that our algorithms have a large range of inference and learning applications.

Algorithms↗

PubMed1997

Algorithms used in adverse drug event reports: a comparative study.

OBJECTIVE: To determine if and how the Kramer and Karch algorithms differ in assigning a probability that a published case was actually an adverse drug event (ADE), and to determine if these algorithms could be used to assess published ADEs. DESIGN: Open, single-rater comparison of Karch and Kramer algorithms in 200 published ADE reports. MAIN RESULTS: The algorithms were not significantly different regarding the proportion of cases deemed definite (p = 0.5204) or probable (p = 0.2972) ADEs. The Kramer instrument was more likely to assign a possible risk of ADE (p = 0.0001), while the Karch instrument was more likely to assign a risk of unlikely (p = 0.0001). The algorithms agreed in 41% of the cases and could be used to assess published ADEs. CONCLUSIONS: The Karch and Kramer algorithms may disagree in how they assign a probability of risk to a potential ADE. This may be due to how algorithms are applied, as well as to structural differences.

Adverse Drug Reaction Reporting Systems↗

PubMed1993

A 4, 2, and 1 stepping algorithm for quick and accurate estimation of cutaneous sensation threshold.

In quantitative sensory testing, certain methods may lead to incorrect estimates of vibratory (VDT), cool (CDT), or warm (WDT) detection thresholds. We have shown that the specific forced-choice algorithm of testing employed in our Computer-Assisted Sensory Examination (CASE IV) system, when compared with other tests of nerve dysfunction, provides accurate and reproducible estimates of these thresholds. Because this forced-choice algorithm is time consuming and performance might be made worse by drowsiness or boredom, we explored other algorithms that might provide estimates of threshold similar to those obtained with the forced-choice algorithm, but more quickly. In a trial of 25 healthy subjects and 25 patients with neuropathy, the 4, 2, and 1 stepping algorithm with null stimuli, based in part on comparative data from computer simulation and insights from patient decision making, provides an accurate estimate of threshold. On average, the time needed for forced-choice testing was 12.8 +/- 2.9 minutes (mean +/- SD). For 4, 2, and 1 stepping testing, it was 2.7 +/- 2.5 minutes--a large saving of time. Since null stimuli were employed in the 4, 2, and 1 stepping algorithm, it was possible to monitor for spurious responses and repeat the test if they occurred at an excessive rate. The algorithm appears to be sufficiently robust to be recommended for clinical use and for some controlled clinical and epidemiologic trials.

Algorithms↗

PubMed1997

Regularized progressive expansion algorithm for recovery of scattering media from time-resolved data.

Reconstructions of the absorption cross sections of dense scattering media from time-resolved data are presented. A progressive expansion (PE) algorithm, similar to a layer-stripping, is developed to circumvent the underdeterminedness of the inverse problem. An overlapping scheme, which used detector readings from several consecutive time intervals, is introduced to reduce the propagation of reconstruction errors that occur at shallower depths. To reduce the sensitivity of the PE algorithm to noise a regularized progressive expansion (RPE) algorithm is proposed, which incorporates regularization techniques into the PE algorithm. The PE and the RPE algorithms are applied to the problem of image reconstruction from time-resolved data. The test media were isotropically scattering slabs containing one or two compact absorbers at different depths below the surface. The data were corrupted by additive white Gaussian noise with various strengths. The reconstruction results show that the PE and the RPE algorithms, when they are combined by proper overlapping, can effectively overcome the underdeterminedness of the inverse problem. The RPE algorithm yields reconstructions that are more accurate and more stable under the same noise level.

Algorithms↗

PubMed1999

Minimal-scan filtered backpropagation algorithms for diffraction tomography.

The filtered backpropagation (FBPP) algorithm, originally developed by Devaney [Ultrason. Imaging 4, 336 (1982)], has been widely used for reconstructing images in diffraction tomography. It is generally known that the FBPP algorithm requires scattered data from a full angular range of 2 pi for exact reconstruction of a generally complex-valued object function. However, we reveal that one needs scattered data only over the angular range 0 < or = phi < or = 3 pi/2 for exact reconstruction of a generally complex-valued object function. Using this insight, we develop and analyze a family of minimal-scan filtered backpropagation (MS-FBPP) algorithms, which, unlike the FBPP algorithm, use scattered data acquired from view angles over the range 0 < or = phi < or = 3 pi/2. We show analytically that these MS-FBPP algorithms are mathematically identical to the FBPP algorithm. We also perform computer simulation studies for validation, demonstration, and comparison of these MS-FBPP algorithms. The numerical results in these simulation studies corroborate our theoretical assertions.

Algorithms↗

PubMed1986

Formal connections between lightness algorithms.

The computational problem underlying color vision is to recover the invariant surface-spectral-reflectance properties of an object. Lightness algorithms, which recover an approximation to surface reflectance in independent wavelength channels, have been proposed as one method to compute color. This paper clarifies and formalizes the lightness problem by proposing a new formulation of the intensity equation on which lightness algorithms are based and by identifying and discussing two basic subproblems of lightness and color computation: spatial decomposition and spectral normalization of the intensity signal. Several lightness algorithms are reviewed, and a new extension (the multiple-scales algorithm) of one of them is proposed. The main computational result is that each of the lightness algorithms may be derived from a single mathematical formula, under different conditions, which, in turn, imply limitations for the implementation of lightness algorithms by man or machine. In particular, the algorithms share certain limitations on their implementation that follow from the physical constraints imposed on the statement of the problem and the boundary conditions applied in its solution.

Algorithms↗

PubMed2003

Evaluation of two algorithms for counting forward saccades in a reading task.

We compared two algorithms, which are used to assess the number of forward saccades in a reading task from records of eye movements. In one algorithm saccades are detected analysing the velocity of eye movements. The third derivate of eye position in time (jerk) is used in the second algorithm for the detection of saccades. Both algorithms were applied on the same set of data, recorded using 24 subjects reading a German text, which was presented on two different displays. Our subjects read the text at a mean reading speed of 258.5 word/min. Both algorithms were found to produce a similar rate of artefacts in the number of detected saccades (2.5%), provided the threshold for detection (velocity or jerk) is set at an appropriate level and the same level of threshold is applied to all data. In both algorithms, the rate of artefacts increases with increasing distance of the threshold from its optimum. Inter-individual variation of the rate of artefacts increases more pronounced in the algorithm based on jerks. Eye blinks were identified as a major source of artefacts. A remedy is proposed, by means of which the rate of artefacts can be reduced.

Adult↗

PubMed1998

Treatment algorithm use to optimize management of symptomatic patients with a history of mania.

BACKGROUND: While monotherapy has significant limitations in bipolar disorder, few published data addressing alternatives exist. Treatment algorithms have been proposed, but none have undergone empirical evaluation. This study provides a systematic prospective, open evaluation of the effectiveness and tolerability of a treatment algorithm for patients with histories of mania. METHOD: Twenty-eight symptomatic outpatients from a public mental health facility who were diagnosed as having either bipolar I or schizoaffective illness, bipolar type, entered the study. Minimum blood levels of lithium and divalproex sodium were defined. Medications were pushed to predetermined levels (as tolerated) before proceeding to the next algorithm step. Clinical symptoms were assessed monthly using the Brief Psychiatric Rating Scale (BPRS, 27 item) and Clinical Global Impressions scale. RESULTS: Pretreatment and posttreatment clinical symptoms were compared. Over 50% of patients attained 30% improvement from baseline BPRS after 4 months. Thirty-six percent of patients (N = 10) became mood stable, 46% (N = 13) remained mood unstable, and 18% (N = 5) dropped out before completing the algorithm. Although patients who finished the algorithm were taking more medication, either dosage and/or drugs, somatic complaints did not increase. CONCLUSION: The potential benefit of a defined treatment algorithm was demonstrated for these complex and persistently ill patients. Despite long treatment histories, patients improved with more frequent visits and addition of medication(s). A randomized controlled trial comparing a similar treatment algorithm with treatment-as-usual is warranted.

Adult↗