SEARCH · PubMed Health

Results for “Algorithm”

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 397 records · Page 22Linked to original sources

PubMed2001

Algorithms for deriving crystallographic space-group information. II. Treatment of special positions.

Algorithms for the treatment of special positions in three-dimensional crystallographic space groups are presented. These include an algorithm for the determination of the site-symmetry group given the coordinates of a point, an algorithm for the determination of the exact location of the nearest special position, an algorithm for the assignment of a Wyckoff letter given the site-symmetry group, and an alternative algorithm for the assignment of a Wyckoff letter given the coordinates of a point directly. All algorithms are implemented in ISO C++ and are integrated into the Computational Crystallography Toolbox. The source code is freely available.

Algorithms↗

PubMed1995

Two new algorithms for tracking arterial parameters in nonstationary noise conditions.

Two new algorithms with reduced sensitivity to the changing environment are applied to tracking arterial circulation parameters. They are variants of the Least-Squares (LS) algorithm with Variable Forgetting factor (LSVF), and of the Constant Forgetting factor-Covariance Modification (CFCM) LS algorithm, devised to overcome their main practical deficiencies related to noise level sensitivity and the high number of design variables, respectively. To this end, adaptive mechanisms are incorporated to estimate observation noise variance in LSVF and the rate of change for the different parameters in CFCM. Specific computer simulation experiments are presented to compare their effectiveness with the original counterparts and to provide guidelines for their optimal tuning at different noise levels. Moreover, algorithm performance degradation, consequent on changes in the noise level compared to that assumed during the tuning phase, is analyzed. In particular, it is shown that, when the noise level changes with respect to the tuning value, the new LSVF algorithm is much more robust than the original one, whose performance degrades rapidly. The new CFCM algorithm is characterized by a reduced number of design variables with respect to its original counterpart. Nevertheless, it can be preferred only when low noise signals are used for estimation.

Algorithms↗

PubMed1996

A novel family of compression algorithms for ECG and other semiperiodical, one-dimensional, biomedical signals.

In this paper, a novel family of compression algorithms is presented, which is designed to exploit the redundancy of one-dimensional (1-D) semiperiodical biomedical signals resulting from the cyclic nature of the underlying physical process. The basic idea is that a pool of past-seen cycles is maintained and cycles to be encoded can be stored as transformed versions of those residing in the pool. Conceptually, this approach is an extension of dictionary-based coding schemes used for text compression to signal patterns residing in an n-dimensional space. A cycle transformation method is introduced in order to render the pattern matching process practical and to enable cycle substitution. Based on the principles of the algorithmic family and this transformation method, an electrocardiogram (ECG)-oriented algorithm is implemented and thoroughly tested. The performance of this implementation is examined theoretically and deductions about the optimal algorithm settings are made. The ECG compression algorithm is superior to the average beat subtraction algorithm as proposed by Hamilton and Tompkins in cases where high compression ratios are required.

Algorithms↗

PubMed1999

Monotonic algorithms for transmission tomography.

We present a framework for designing fast and monotonic algorithms for transmission tomography penalized-likelihood image reconstruction. The new algorithms are based on paraboloidal surrogate functions for the log likelihood. Due to the form of the log-likelihood function it is possible to find low curvature surrogate functions that guarantee monotonicity. Unlike previous methods, the proposed surrogate functions lead to monotonic algorithms even for the nonconvex log likelihood that arises due to background events, such as scatter and random coincidences. The gradient and the curvature of the likelihood terms are evaluated only once per iteration. Since the problem is simplified at each iteration, the CPU time is less than that of current algorithms which directly minimize the objective, yet the convergence rate is comparable. The simplicity, monotonicity, and speed of the new algorithms are quite attractive. The convergence rates of the algorithms are demonstrated using real and simulated PET transmission scans.

Algorithms↗

PubMed2000

Reconstruction algorithm for polychromatic CT imaging: application to beam hardening correction.

This paper presents a new reconstruction algorithm for both single- and dual-energy computed tomography (CT) imaging. By incorporating the polychromatic characteristics of the X-ray beam into the reconstruction process, the algorithm is capable of eliminating beam hardening artifacts. The single energy version of the algorithm assumes that each voxel in the scan field can be expressed as a mixture of two known substances, for example, a mixture of trabecular bone and marrow, or a mixture of fat and flesh. These assumptions are easily satisfied in a quantitative computed tomography (QCT) setting. We have compared our algorithm to three commonly used single-energy correction techniques. Experimental results show that our algorithm is much more robust and accurate. We have also shown that QCT measurements obtained using our algorithm are five times more accurate than that from current QCT systems (using calibration). The dual-energy mode does not require any prior knowledge of the object in the scan field, and can be used to estimate the attenuation coefficient function of unknown materials. We have tested the dual-energy setup to obtain an accurate estimate for the attenuation coefficient function of K2 HPO4 solution.

Algorithms↗

PubMed1997

Segmentation algorithms for detecting microcalcifications in mammograms.

The presence of microcalcification clusters in mammograms contributes evidence for the diagnosis of early stages of breast cancer. In many cases, microcalcifications are subtle and their detection can benefit from an automated system serving as a diagnostic aid. The potential contribution of such a system may become more significant as the number of mammograms screened increases to levels that challenge the capacity of radiology clinics. Many techniques for detecting microcalcifications start with a segmentation algorithm that indicates all candidate structures for the subsequent phases. Most algorithms used to segment microcalcifications have aspects that might raise operational difficulties, such as thresholds or windows that must be selected, or parametric models of the data. We present a new segmentation algorithm and compare it to two other algorithms: the multi-tolerance region growing algorithm that operates without the aspects mentioned above, and the active contour model that has not been applied previously to segment microcalcifications. The new algorithm operates without threshold or window selection, or parametric data models, and it is more than an order of magnitude faster than the other two.

Algorithms↗

PubMed1997

Dynamic image data compression in spatial and temporal domains: theory and algorithm.

Advanced medical imaging requires storage of large quantities of digitized clinical data. These data must be stored in such a way that their retrieval does not impair the clinician's ability to make a diagnosis. In this paper, we propose the theory and algorithm for near (or diagnostically) lossless dynamic image data compression. Taking advantage of domain-specific knowledge related to medical imaging, the medical practice and the dynamic imaging modality, a compression ratio greater than 80:1 is achieved. The high compression ratios are achieved by the proposed compression algorithm through three stages: 1) addressing temporal redundancies in the data through application of image optimal sampling, 2) addressing spatial redundancies in the data through cluster analysis, and 3) efficient coding of image data using standard still-image compression techniques. To illustrate the practicality of the proposed compression algorithm, a simulated positron emission tomography (PET) study using the fluoro-deoxy-glucose (FDG) tracer is presented. Realistic dynamic image data are generated by "virtual scanning" of a simulated brain phantom as a real PET scanner. These data are processed using the conventional [8] and proposed algorithms as well as the techniques for storage and analysis. The resulting parametric images obtained from the conventional and proposed approaches are subsequently compared to evaluate the proposed compression algorithm. As a result of this study, storage space for dynamic image data is able to be reduced by more than 95%, without loss in diagnostic quality. Therefore, the proposed theory and algorithm are expected to be very useful in medical image database management and telecommunication.

Algorithms↗

PubMed1991

Counting algorithms for linkage: correction to Morton and Collins.

In a recent paper, Morton & Collins (1990) claimed: (1) that the Lander-Green algorithm for genetic linkage analysis is not the EM algorithm for finding the maximum likelihood map; and (2) that a proposed alternative algorithm does have these properties. Here, we show that these assertions are both incorrect: the Lander-Green algorithm is an EM algorithm, while the Morton-Collins algorithm is not. We note that Morton and Collins concur with these conclusions.

Algorithms↗

PubMed2000

The development and validation of an algorithm for real-time computerised fetal heart rate monitoring in labour.

OBJECTIVE: To develop and validate a computerised algorithm for the interpretation of the characteristics of fetal heart rate monitoring in labour. DESIGN: Prospective observational study. SETTING: Labour ward in a tertiary hospital. SAMPLE: Intrapartum cardiotocograms from 24 pregnancies. METHODS: A computerised algorithm was developed to assess the fetal heart baseline rate, variability, the number of accelerations and the number of decelerations. Twenty five minute segments of cardiotocograms were interpreted by the algorithm and also by seven expert reviewers independently. The reviewers were unaware of the outcome of labour. The reliability of the characteristics of cardiotocography and the validity of the computerised algorithm were assessed using the intraclass correlation coefficient and weighted kappa statistic for continuous and ordinal variables respectively. RESULTS: The inter rater reliability of the baseline fetal heart rate and the number and type of decelerations was good (intraclass correlation coefficient 0.93, 0.93 and 0.79, respectively). The reliability of baseline variability (kappa = 0.27) and accelerations (intraclass correlation coefficient = 0.27) was poor. The computerised algorithm had good agreement with the reviewers for the baseline fetal heart rate (intraclass correlation coefficient 0.91 to 0.98) and the number of decelerations (intraclass correlation coefficient 0.82 to 0.91), but was less valid as regards the number of late decelerations (intraclass correlation coefficient 0.68 to 0.85) and the number of accelerations (intraclass correlation coefficient 0.06 to 0.80), and was invalid as regards baseline variability (kappa 0.00 to 0.34). CONCLUSIONS: The high level of validity of the computerised algorithm for the estimation of the baseline fetal heart rate and the number of decelerations justifies its further technical development.

Adolescent↗

PubMed1988

Heart rate correlation, response time and effect of previous exercise using an advanced pacing rate algorithm for temperature-based rate modulation.

A temperature-based algorithm to produce pacing rate that resembles chronotropic response to activity was developed. Measurement criteria for the algorithm included workload dependent rate increases with activity and response time within 60 seconds of exercise onset. To evaluate the algorithm, right ventricular blood temperature was recorded during rest and treadmill exercise in 25 patients with implanted Kelvin 500 pacemakers (Cook Pacemaker). Patients included 16 males and nine females, ages 44-81 (mean 72). Indications for pacing were sinus node disease, atrioventricular block and atrial fibrillation with slow ventricular response. Temperature changes reflected physical activity as well as emotional stress. The algorithm was based on the rate of change (dT/dt), the relative change (delta T) and the baseline history (T) of temperature. At exercise onset, a rapid, brief drop in temperature (dT/dt) typically occurred due to peripheral vasodilation, causing prompt increase in pacing rate. As exercise continued, the increase in metabolic rate caused dT/dt as well as delta T to increase, further increasing pacing rate. After exercise, temperature returned to resting level which correspondingly decreased the pacing rate. Sensitivity of the algorithm to temperature variations, and the upper and lower pacing rate limits were programmable to adapt to individual patient needs. The rates produced by the algorithm mimicked intrinsic rate response for various activity levels and produced a mean response time of 16 seconds from exercise onset. Previous exercise had no significant effect on response time. Correlation between normal chronotropic response and simulated pacing rate from five exercise tests was 0.92. These results show good specificity and refute the statement that blood temperature yields a slow response.

Adult↗

PubMed1990

Endless-loop tachycardias: description and first clinical results of a new fully automatic protection algorithm.

Endless-loop tachycardia (ELT) is one of the most common pacemaker mediated tachycardia. An innovative ELT protection algorithm has proven to be clinically effective. A new improved version that will eliminate the need to program any parameter is now under clinical evaluation. Nine patients entered the study: six men and three women, aged 52 +/- 22 years. This automatic algorithm needs only 10 cycles to detect and confirm an ELT. Three hundred thirty-three ELTs lasting more than 9 cycles have been induced and analyzed. The total results are the following: mean duration: 6.7 sec +/- 3.1; mean ELT rate: 137 +/- 21.9 bpm, mean programmed upper rate limit (URL): 142.5 +/- 26.5 bpm (Only 70% of ELTs presented rates equal to programmed URL). (1) ELTs reduced by postventricular atrial refractory period (PVARP) extension on one cycle: 291 ELTs (87%). ELT rate: 128.5 +/- 18.2 bpm. (2) Retrograde block: algorithm operation may induce a retrograde block due to a short atrioventricular delay (AVD) applied during the confirmation phase to discriminate an ELT from a stable sinus rhythm. Thirty-two ELTs (10%) have been reduced and detected on a retrograde block occurrence. (3) Algorithm failure due to an unstable ventriculoatrial conduction time (VACT) even at fixed rate or to a retrograde Wenckebach behavior on AVD reduction during the confirmation phase. A total of 10 algorithms failed to detect or confirm an ELT have been recorded (3%). Mean duration: 8.2 +/- 4.2 sec, mean ELT rate: 148.9 +/- 14.3 bpm. This new fully automatic algorithm has reduced 97% of ELTs, including high rate episodes (100-175 bpm).(ABSTRACT TRUNCATED AT 250 WORDS)

Algorithms↗

PubMed1993

Simultaneously collected monopolar and discrete bipolar electrograms: comparison of activation time detection algorithms.

Designation of the time of local activation is fundamental to electrophysiological mapping. In normal myocardium, the minimum slope in extracellular monopolar (MP) electrograms has been linked through simultaneous intracellular and extracellular recordings to phase 0 of the action potential. However, no similar correlation has been demonstrated for a parameter from bipolar (BP) electrograms, now commonly used during electrophysiological studies and intraoperative mapping. The purpose of this work is to compare the activation time, determined according to several common algorithms applied to BP electrograms, with the time of the minimum slope in MP electrograms. Simultaneous normal epicardial MP and BP electrograms were acquired from subjects undergoing surgery for Wolf-Parkinson-White Syndrome and from dogs. The activation time in BP electrograms was defined by four algorithms: (1) peak (P); (2) greatest absolute slope (S); (3) zero crossing of the segment containing the greatest slope (FZC); and (4) morphological (M). Each was compared to the time of the minimum slope in the simultaneously recorded MP response. The incidence of outliers was tabulated. The distribution of activation times computed using each BP algorithm was statistically different from the distribution of activation times derived from MP electrograms. M performed best (absolute difference: 2.6 +/- 2.9 msec; cor coef: 0.9925 in man). The M, P, FZC, and S algorithms produced 3.2%, 3.5%, 4.7% and 4.7% outliers, respectively. The overall performance of a morphologically based algorithm is superior to simplistic BP algorithms based only on slope or peak.(ABSTRACT TRUNCATED AT 250 WORDS)

Algorithms↗

PubMed1997

A simple electrocardiographic algorithm for detecting ventricular tachycardia.

The purpose of this study was to determine whether a simple ECG algorithm could be developed for predicting susceptibility to ventricular tachyarrhythmias (VT) as defined by sustained spontaneous or inducible VT. Two different QT dispersion algorithms were determined by the difference between the longest and shortest QT interval measured in three orthogonal leads (I, aVF, V1; QTD3), and at least 11 of 12 leads (QTD12) from the 12-lead ECG. These QT dispersion algorithms were investigated (with and without the QRS duration from the 12-lead ECG) and compared to the signal-averaged ECG (SAECG) in order to determine their sensitivity and specificity for detecting VT. Only patients who underwent SAECG and were referred for programmed electrical stimulation were included in this study. A positive SAECG was defined by filtered QRS duration > 114 ms, and/or low amplitude signal duration > 38 ms, and/or root mean square voltage in the last 40 ms of < 20 microV. Sixty patients were enrolled in this study with a mean age of 63 +/- 2 years. Fifty-five percent of the patients had coronary artery disease. A simple ECG algorithm consisting of the sum of QTD3 plus the QRS duration had a sensitivity and specificity of 90% and 63%, respectively, wheras the SAECG had a sensitivity and specificity of 60% and 63%, respectively (P = 0.022). We conclude that a simple ECG algorithm is more sensitive than the SAECG for predicting VT. This algorithm combines two easily measured variables obtained from the 12-lead ECG, and can easily be performed without expensive computer equipment.

Adolescent↗

PubMed1998

An algorithm for automatic measurement of stimulation thresholds: clinical performance and preliminary results.

We have developed an algorithmic method for automatic determination of stimulation thresholds in both cardiac chambers in patients with intact atrioventricular (AV) conduction. The algorithm utilizes ventricular sensing, may be used with any type of pacing leads, and may be downloaded via telemetry links into already implanted dual-chamber Thera pacemakers. Thresholds are determined with 0.5 V amplitude and 0.06 ms pulse-width resolution in unipolar, bipolar, or both lead configurations, with a programmable sampling interval from 2 minutes to 48 hours. Measured values are stored in the pacemaker memory for later retrieval and do not influence permanent output settings. The algorithm was intended to gather information on continuous behavior of stimulation thresholds, which is important in the formation of strategies for programming pacemaker outputs. Clinical performance of the algorithm was evaluated in eight patients who received bipolar tined steroid-eluting leads and were observed for a mean of 5.1 months. Patient safety was not compromised by the algorithm, except for the possibility of pacing during the physiologic refractory period. Methods for discrimination of incorrect data points were developed and incorrect values were discarded. Fine resolution threshold measurements collected during this study indicated that: (1) there were great differences in magnitude of threshold peaking in different patients; (2) the initial intensive threshold peaking was usually followed by another less intensive but longer-lasting wave of threshold peaking; (3) the pattern of tissue reaction in the atrium appeared different from that in the ventricle; and (4) threshold peaking in the bipolar lead configuration was greater than in the unipolar configuration. The algorithm proved to be useful in studying ambulatory thresholds.

Adult↗

PubMed1999

A new defibrillator discrimination algorithm utilizing electrogram morphology analysis.

Inappropriate therapies delivered by implantable cardioverter defibrillators (ICDs) for supraventricular arrhythmias remain a common problem, particularly in the event of rapidly conducted atrial fibrillation or marked sinus tachycardia. The ability to differentiate between ventricular tachycardia and supraventricular arrhythmias is the major goal of discrimination algorithms. Therefore, we developed a new algorithm, SimDis, utilizing morphological features of the shocking electrograms. This algorithm was developed from electrogram data obtained from 36 patients undergoing ICD implantation. An independent test set was evaluated in 25 patients. Recordings were made in sinus rhythm, sinus tachycardia, and following the induction of ventricular tachycardia and atrial fibrillation. The arrhythmia complex is defined as wide if the duration is at least 30% greater than the template in sinus rhythm. For narrow complexes, four maximum and minimum values were measured to form a 4-element feature vector, which was compared with a representative feature vector during normal sinus rhythm. For each rhythm, any wide complex was classified as ventricular tachycardia. For narrow complexes, the second step of the algorithm compared the electrogram with the template, computing similarity and dissimilarity values. These values were then mapped to determine if they fell within a previously established discrimination boundary. On the independent test set, the SimDis algorithm correctly classified 100% of ventricular tachycardias (27/27), 98% of sinus tachycardias (54/55), and 100% of episodes of atrial fibrillation (37/37). We conclude that the SimDis algorithm yields high sensitivity (100%) and specificity (99%) for arrhythmia discrimination, using the computational capabilities of an ICD system.

Algorithms↗

PubMed1998

Development and validation of an ECG algorithm for identifying accessory pathway ablation site in Wolff-Parkinson-White syndrome.

INTRODUCTION: Delta wave morphology correlates with the site of ventricular insertion of accessory AV pathways. Because lesions due to radiofrequency (RF) current are small and well defined, it may allow precise localization of accessory pathways. The purpose of this study was to use RF catheter ablation to develop an ECG algorithm to predict accessory pathway location. METHODS AND RESULTS: An algorithm was developed by correlating a resting 12-lead ECG with the successful RF ablation site in 135 consecutive patients with a single, anterogradely conducting accessory pathway (Retrospective phase). This algorithm was subsequently tested prospectively in 121 consecutive patients (Prospective phase). The ECG findings included the initial 20 msec of the delta wave in leads I, II, aVF, and V1 [classified as positive (+), negative (-), or isoelectric (+/-)] and the ratio of R and S wave amplitudes in leads III and V1 (classified as R > or = S or R < S). When tested prospectively, the ECG algorithm accurately localized the accessory pathway to 1 of 10 sites around the tricuspid and mitral annuli or at subepicardial locations within the venous system of the heart. Overall sensitivity was 90% and specificity was 99%. The algorithm was particularly useful in correctly localizing anteroseptal (sensitivity 75%, specificity 99%), and mid-septal (sensitivity 100%, specificity 98%) accessory pathways as well as pathways requiring ablation from within ventricular venous branches or anomalies of the coronary sinus (sensitivity 100%, specificity 100%). CONCLUSION: A simple ECG algorithm identifies accessory pathway ablation site in Wolff-Parkinson-White syndrome. A truly negative delta wave in lead II predicts ablation within the coronary venous system.

Adolescent↗

PubMed1994

An algorithm to describe the oxygen equilibrium curve for the thoroughbred racehorse.

An algorithm to describe the oxygen equilibrium curve (OEC) of the Thoroughbred horse was derived from raw oxygen equilibrium curve data obtained under standard conditions of temperature, pH and PCO2 (Smale and Butler, 1994). This algorithm was derived by a curve-fitting procedure based on the algorithm for human blood produced by Kelman (1966). The temperature, fixed acid and net CO2 coefficients were then incorporated in the algorithm to enable the accurate calculation of % saturation from any combination of PO2, temperature, pH and PCO2. The algorithm was checked using blood gas data obtained from in vivo treadmill exercise tests as well as a standardised breathing test whereby horses inhaled several different gas mixtures. This algorithm proved more accurate for the Thoroughbred horse than that derived by Kelman.

Algorithms↗

PubMed2001

A self-coherence enhancement algorithm and its application to enhancing three-dimensional source estimation from EEGs.

In this paper a new algorithm is proposed to enhance the spatial resolution of solutions of the underdetermined EEG inverse problem. Termed the self-coherence enhancement algorithm (SCEA), the present algorithm provides a self-coherence solution, which is a function of the high order self-coherence estimate of an unbiased smooth estimate of the underdetermined EEG inverse solution. The order of the high order self-coherence function is determined by the blurring level of the actual source distribution as represented by a normalized blurring index. The proposed SCEA algorithm may be used to enhance the spatial resolution of an inverse solution obtained by any inverse reconstruction algorithm. Computer simulation studies have been conducted to evaluate the performance of the SCEA and to compare its performance to that of the LORETA and the FOCUSS algorithms.

Algorithms↗