PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Measuring 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 865 records · Page 48Linked to original sources

Discriminative motifs.

This paper takes a new view of motif discovery, addressing a common problem in existing motif finders. A motif is treated as a feature of the input promoter regions that leads to a good classifier between these promoters and a set of background promoters. This perspective allows us to adapt existing methods of feature selection, a well-studied topic in machine learning, to motif discovery. We develop a general algorithmic framework that can be specialized to work with a wide variety of motif models, including consensus models with degenerate symbols or mismatches, and composite motifs. A key feature of our algorithm is that it measures overrepresentation while maintaining information about the distribution of motif instances in individual promoters. The assessment of a motif's discriminative power is normalized against chance behaviour by a probabilistic analysis. We apply our framework to two popular motif models and are able to detect several known binding sites in sets of co-regulated genes in yeast.

Algorithms↗

Detection of movement artifact in recorded pulse oximeter saturation.

UNLABELLED: Movement artifact (MA) must be detected when analysing recordings of pulse oximeter saturation (SpO2). Visual analysis of individual pulse waveforms is the safest, but also the most tedious, method for this purpose. We wanted to test the reliability of a computer algorithm (Edentec Motion Annotation System), based on a comparison between pulse and heart rate, for MA detection. Ten 12-h recordings of SpO2, pulse waveforms and heart rate from ten preterm infants were analysed for the presence of MA on the pulse waveform signal. These data were used to determine the sensitivity and specificity of the computer algorithm, and of the oximeter itself, in detecting MA. Recordings were divided into segments of 2.5 s duration to compare the movement identification methods. Of the segments 31% +/- 6% (mean +/- SD) contained MA. The computer algorithm identified 95% +/- 3% of these segments, the pulse oximeter only 18% +/- 11%. Specificity was 85% +/- 4% and 99% +/- 0%, respectively. SpO2 was < or =80% in 3% +/- 1% of segments. 88% +/- 7% of the pulse waveform signal showed MA during this time, leaving a significant potential for erroneous identification of hypoxaemia. Recordings of SpO2 do not allow a reliable identification of MA. CONCLUSION: Without additional information about movement artifact, a significant proportion of recording time of pulse oximeter signal may be regarded as demonstrating hypoxaemia which, in fact, simply reflects poor measurement conditions. The computer algorithm used in this study identified periods of movement artifact reliably.

Algorithms↗

EXCAVATOR: a computer program for efficiently mining gene expression data.

Massive amounts of gene expression data are generated using microarrays for functional studies of genes and gene expression data clustering is a useful tool for studying the functional relationship among genes in a biological process. We have developed a computer package EXCAVATOR for clustering gene expression profiles based on our new framework for representing gene expression data as a minimum spanning tree. EXCAVATOR uses a number of rigorous and efficient clustering algorithms. This program has a number of unique features, including capabilities for: (i) data- constrained clustering; (ii) identification of genes with similar expression profiles to pre-specified seed genes; (iii) cluster identification from a noisy background; (iv) computational comparison between different clustering results of the same data set. EXCAVATOR can be run from a Unix/Linux/DOS shell, from a Java interface or from a Web server. The clustering results can be visualized as colored figures and 2-dimensional plots. Moreover, EXCAVATOR provides a wide range of options for data formats, distance measures, objective functions, clustering algorithms, methods to choose number of clusters, etc. The effectiveness of EXCAVATOR has been demonstrated on several experimental data sets. Its performance compares favorably against the popular K-means clustering method in terms of clustering quality and computing time.

Algorithms↗

Linking cortical structure and delirium in the elderly: insights from cohort study and shared genetic risk analysis.

BACKGROUND: This study aimed to assess the association between regional cortical changes measured via baseline magnetic resonance imaging (MRI) and the incidence of delirium. METHODS: Observational associations were assessed using a prospective cohort from the UK Biobank and an independent clinical cohort. The population-based study included participants aged 60 years or older who had undergone structural brain MRI since 2014. Regional cortical volume, mean thickness, and surface area were extracted based on the Desikan-Killiany cortical atlas. Delirium was defined using ICD-10 diagnostic codes. Additionally, preoperative brain MRI images from participants in another cohort were collected and automatically segmented using deep learning algorithms to obtain cortical measurements. Logistic analysis was performed to investigate the associations between cerebral cortical structure and delirium risk. Lastly, genome-wide association study data derived from the ENIGMA Consortium and FinnGen Biobank were utilized to conduct conditional/conjunctional false discovery rate (cond/conjFDR) analyses to identify shared genetic loci associated with cortical structures and delirium. RESULTS: This observational analysis included 31,890 participants from the UK Biobank and 152 participants from an independent cohort. In the UK Biobank cohort, decreased cortical thickness in the 17 regions was associated with a significantly increased risk of delirium. Similarly, a preoperative reduction in cortical volume in 7 regions was associated with an increased risk of delirium in the independent cohort. Besides, 100 single-nucleotide polymorphisms (SNPs) were identified as significantly associated with cortical structures when conditioned on delirium. Finally, colocalization analysis demonstrated that these pleiotropic risk loci modulated the expression of NT5C2, RGP1, CCDC25, TPM2, EEF1AKMT2, IQANK1 and LHPP in blood and brain tissues. CONCLUSION: Regional cortical atrophy is associated with an increased risk of delirium in the elderly. Brain MRI examinations may be beneficial for preoperative delirium risk assessment in elderly individuals undergoing elective surgery.

Humans↗

Origin, structure, and role of background EEG activity. Part 1. Analytic amplitude.

OBJECTIVE: To explain the neural mechanisms of spontaneous EEG by measuring the spatiotemporal patterns of synchrony among beta-gamma oscillations during perception. METHODS: EEGs were measured from 8 x 8 (5.6 x 5.6 mm2) arrays fixed on the surfaces of primary sensory areas in rabbits that were trained to discriminate visual, auditory or tactile conditioned stimuli (CSs) eliciting conditioned responses (CRs). EEG preprocessing was by (i) bandpass filtering to extract the beta-gamma range (deleting theta-alpha); (ii) low-pass spatial filtering (not high-pass Laplacians used for localization), (iii) spatial averaging (not time averaging used for evoked potentials), and (iv) close spacing of 64 electrodes for simultaneous recording in each area (not sampling single signals from several areas); (v) novel algorithms were devised to measure synchrony and spatial pattern stability by calculating variances among patterns in 64-space derived from the 8 x 8 arrays (not by fitting equivalent dipoles). These methodological differences are crucial for the proposed new perspective on EEG. RESULTS: Spatial patterns of beta-gamma EEG emerged following sudden jumps in cortical activity called 'state transitions'. Each transition began with an abrupt phase re-setting to a new value on every channel, followed sequentially by re-synchronization, spatial pattern stabilization, and a dramatic increase in pattern amplitude. State transitions recurred at varying intervals in the theta range. A novel parameter was devised to estimate the perceptual information in the beta-gamma EEG, which disclosed 2-4 patterns with high information content in the CS-CR interval on each trial; each began with a state transition and lasted approximately 0.1 s. CONCLUSIONS: The function of each primary sensory neocortex was discontinuous; discrete spatial patterns occurred in frames like those in cinema. The frames before and after the CS-CR interval had low content. SIGNIFICANCE: Derivation and interpretation of unit data in studies of perception might benefit from using multichannel EEG recordings to define distinctive epochs that are demarcated by state transitions of neocortical dynamics in the CS-CR intervals, particularly in consideration of the possibility that EEG may reveal recurring episodes of exchange and sharing of perceptual information among multiple sensory cortices. Simultaneously recorded, multichannel beta-gamma EEG might assist in the interpretation of images derived by fMRI, since high beta-gamma EEG amplitudes imply high rates of energy utilization. The spatial pattern intermittency provides a tag to distinguish gamma bursts from contaminating EMG activity in scalp recording in order to establish beta-gamma recording as a standard clinical tool. Finally, EEG cannot fail to have a major impact on brain theory.

Acoustic Stimulation↗

Solution structure and dynamics of a designed hydrophobic core variant of ubiquitin.

BACKGROUND: The recent merger of computation and protein design has resulted in a burst of success in the generation of novel proteins with native-like properties. A critical component of this coupling between theory and experiment is a detailed analysis of the structures and stabilities of designed proteins to assess and improve the accuracy of design algorithms. RESULTS: Here we report the solution structure of a hydrophobic core variant of ubiquitin, referred to as 1D7, which was designed with the core-repacking algorithm ROC. As a measure of conformational specificity, we also present amide exchange protection factors and backbone and sidechain dynamics. The results indicate that 1D7 is similar to wild-type (WT) ubiquitin in backbone structure and degree of conformational specificity. We also observe a good correlation between experimentally determined sidechain structures and those predicted by ROC. However, evaluation of the core sidechain conformations indicates that, in general, 1D7 has more sidechains in less statistically favorable conformations than WT. CONCLUSIONS: Our results provide an explanation for the lower stability of 1D7 compared to WT, and suggest modifications to design algorithms that may improve the accuracy with which structure and stability are predicted. The results also demonstrate that core packing can affect conformational flexibility in subtle ways that are likely to be important for the design of function and protein-ligand interactions.

Algorithms↗

A classification-based framework for predicting and analyzing gene regulatory response.

BACKGROUND: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called GeneClass. GeneClass is motivated by the hypothesis that in model organisms such as Saccharomyces cerevisiae, we can learn a decision rule for predicting whether a gene is up- or down-regulated in a particular microarray experiment based on the presence of binding site subsequences ("motifs") in the gene's regulatory region and the expression levels of regulators such as transcription factors in the experiment ("parents"). GeneClass formulates the learning task as a classification problem--predicting +1 and -1 labels corresponding to up- and down-regulation beyond the levels of biological and measurement noise in microarray measurements. Using the Adaboost algorithm, GeneClass learns a prediction function in the form of an alternating decision tree, a margin-based generalization of a decision tree. METHODS: In the current work, we introduce a new, robust version of the GeneClass algorithm that increases stability and computational efficiency, yielding a more scalable and reliable predictive model. The improved stability of the prediction tree enables us to introduce a detailed post-processing framework for biological interpretation, including individual and group target gene analysis to reveal condition-specific regulation programs and to suggest signaling pathways. Robust GeneClass uses a novel stabilized variant of boosting that allows a set of correlated features, rather than single features, to be included at nodes of the tree; in this way, biologically important features that are correlated with the single best feature are retained rather than decorrelated and lost in the next round of boosting. Other computational developments include fast matrix computation of the loss function for all features, allowing scalability to large datasets, and the use of abstaining weak rules, which results in a more shallow and interpretable tree. We also show how to incorporate genome-wide protein-DNA binding data from ChIP chip experiments into the GeneClass algorithm, and we use an improved noise model for gene expression data. RESULTS: Using the improved scalability of Robust GeneClass, we present larger scale experiments on a yeast environmental stress dataset, training and testing on all genes and using a comprehensive set of potential regulators. We demonstrate the improved stability of the features in the learned prediction tree, and we show the utility of the post-processing framework by analyzing two groups of genes in yeast--the protein chaperones and a set of putative targets of the Nrg1 and Nrg2 transcription factors--and suggesting novel hypotheses about their transcriptional and post-transcriptional regulation. Detailed results and Robust GeneClass source code is available for download from http://www.cs.columbia.edu/compbio/robust-geneclass.

Algorithms↗

Evaluation of the gamma dose distribution comparison method.

The gamma tool was developed to quantitatively compare dose distributions, either measured or calculated. Before computing gamma, the dose and distance scales of the two distributions, referred to as evaluated and reference, are renormalized by dose and distance criteria, respectively. The renormalization allows the dose distribution comparison to be conducted simultaneously along dose and distance axes. The gamma quantity, calculated independently for each reference point, is the minimum distance in the renormalized multidimensional space between the evaluated distribution and the reference point. The gamma quantity degenerates to the dose-difference and distance-to-agreement tests in shallow and very steep dose gradient regions, respectively. Since being introduced, the gamma quantity has been used by investigators to evaluate dose calculation algorithms, and compare dosimetry measurements. This manuscript examines the gamma distribution behavior in two dimensions and evaluates the gamma distribution in the presence of data noise. Noise in the evaluated distribution causes the gamma distribution to be underestimated relative to the no-noise, condition. Noise in the reference distribution adds noise in the gamma distribution in proportion to the normalized dose noise. In typical clinical use, the fraction of points that exceed 3% and 3 mm can be extensive, so we typically use 5% and 2-3 mm in clinical evaluations. For clinical cases, the calculation time is typically 5 minutes for a 1 x 1 mm2 interpolated resolution on an 800 MHz Pentium 4 for a 14.1 x 15.2 cm2 radiographic film.

Algorithms↗

Risk for early-onset schizophrenia assessed via gray-matter distributions.

Automated image analysis algorithms were used to measure regional gray matter volumes in children with early-onset schizophrenia. Logistic regression analysis of gray matter volumes within Brodman areas was used to test the ability to predict whether a subject was normal or schizophrenic. The ROC area-under-the-curve was 0.84 +/- 0.15 across the 10 cross validation groups indicating good discrimination between schizophrenic and normal subjects.

Adolescent↗

Utilization of evidence theory in the detection of salient regions in successive CT images.

This study presents an integrated approach to locating and presenting the medical practitioner with salient regions in a computed tomography (CT) scan when focusing on the area of the liver. A number of image processing tasks are performed in successive scans to extract areas with a different features than that of the greater part of the organ. In general, these areas do not always correspond to pathological patterns, but may be the result of noise in the scanned image or related to veins passing through the tissue. The result of the algorithm is the original image with a mask indicating these regions, so the attention of the medical practitioner is drawn to them for further examination. The algorithm also calculates a measure of confidence of the system, with respect to the extraction of the salient region, based on the fact that a region with a similar pattern is also located in successive scans. This essentially represents the hypothesis that the volume of both pathological patterns and blood vessels, but not noise patterns, is large enough to be captured in successive scans.

Algorithms↗

Design and evaluation of an automatic procedure for detection of large misregistration of medical images.

In many cases the combined assessment of three-dimensional anatomical and functional images [single photon emission computed tomography (SPECT), positron emission tomography (PET), magnetic resonance imaging (MRI), and computed tomography (CT)] is necessary to determine the precise nature and extent of lesions. It is important, prior to performing the addition, subtraction, or any other combination of the images, that they be adequately aligned and registered either by experienced radiologists via visual inspection, mental reorientation and overlap of slices, or by an automated registration algorithm. To be useful clinically, the latter case requires validation. The human capacity to evaluate registration results visually is limited and time consuming. This paper describes an algorithmic procedure to provide proxy measures for human assessment that discriminate between badly misregistered pairs of brain images and those likely to be clinically useful. The new algorithm consists of four major steps: segmentation of brain and skin/air boundaries, contour extraction, computation of the principal axes, and computation of the registration quality measures from the contour volumes. The test data were MR and CT brain images. The results of the present study indicate that the use of a measure based on the combination of brain and skin contours and a principal axis function is a good first step to reduce the number of badly registered images reaching the clinician.

Algorithms↗

Fast maximum intensity projections of large medical data sets by exploiting hierarchical memory architectures.

Maximum intensity projections (MIPs) are an important visualization technique for angiographic data sets. Efficient data inspection requires frame rates of at least five frames per second at preserved image quality. Despite the advances in computer technology, this task remains a challenge. On the one hand, the sizes of computed tomography and magnetic resonance images are increasing rapidly. On the other hand, rendering algorithms do not automatically benefit from the advances in processor technology, especially for large data sets. This is due to the faster evolving processing power and the slower evolving memory access speed, which is bridged by hierarchical cache memory architectures. In this paper, we investigate memory access optimization methods and use them for generating MIPs on general-purpose central processing units (CPUs) and graphics processing units (GPUs), respectively. These methods can work on any level of the memory hierarchy, and we show that properly combined methods can optimize memory access on multiple levels of the hierarchy at the same time. We present performance measurements to compare different algorithm variants and illustrate the influence of the respective techniques. On current hardware, the efficient handling of the memory hierarchy for CPUs improves the rendering performance by a factor of 3 to 4. On GPUs, we observed that the effect is even larger, especially for large data sets. The methods can easily be adjusted to different hardware specifics, although their impact can vary considerably. They can also be used for other rendering techniques than MIPs, and their use for more general image processing task could be investigated in the future.

Computer Storage Devices↗

Discriminant analysis algorithm based on a distance function and on a Bayesian decision.

We propose a new algorithm for the allocation of an individual to one of several possible groups or populations. The algorithm enables us to define a finite partition over the sample space, based on distance function. This partition is used, jointly with the application of a standard Bayesian decision rule, to allocate individuals to the populations. The algorithm also provides a measure of the allocation confidence for each individual, in a similar manner to that of logistic regression. The error rates for classification are also computed using the leave-one-out method. Results are compared with those obtained with other discriminant analysis techniques previously reported: Fisher's linear discriminant function, the quadratic discriminant function, logistic discrimination, and others.

Adolescent↗

A modified K-means algorithm for circular invariant clustering.

Several important pattern recognition applications are based on feature vector extraction and vector clustering. Directional patterns are commonly represented by rotation-variant vectors Fd formed from features uniformly extracted in M directions. It is often desirable that pattern recognition algorithms are invariant under pattern rotation. This paper introduces a distance measure and a K-means-based algorithm, namely, Circular K-means (CK-means) to cluster vectors containing directional information, such as Fd, in a circular-shift invariant manner. A circular shift of Fd corresponds to pattern rotation, thus, the algorithm is rotation invariant. An efficient Fourier domain representation of the proposed measure is presented to reduce computational complexity. A split and merge approach (SMCK-means), suited to the proposed CK-means technique, is proposed to reduce the possibility of converging at local minima and to estimate the correct number of clusters. Experiments performed for textural images illustrate the superior performance of the proposed algorithm for clustering directional vectors Fd, compared to the alternative approach that uses the original K-means and rotation-invariant feature vectors transformed from Fd.

Algorithms↗

First clinical tests using a liquid-filled electronic portal imaging device and a convolution model for the verification of the midplane dose.

BACKGROUND AND PURPOSE: Recently, algorithms have been developed to derive the patient dose from portal dose measurements using a liquid-filled electronic portal imaging device. These algorithms have already been validated for several phantom geometries irradiated under clinical conditions. It is the aim of the present study to investigate the applicability of a liquid-filled electronic portal imaging device in combination with these algorithms for two-dimensional midplane dose verification in clinical practice. MEASUREMENTS AND METHODS: Portal dose images were obtained during several patient treatments under routine clinical conditions. Measurements were performed to verify the midplane dose during radiotherapy of larynx cancer with 4 MV beams, breast and lung cancer with 8 MV beams and prostate cancer with both 8 and 18 MV beams. Midplane doses, determined from portal dose measurements and analyzed with our algorithms, were compared with midplane doses calculated with our three-dimensional (3D) treatment planning system (TPS). RESULTS: For the larynx treatment the measured 2D midplane dose agreed within 2.0% with TPS calculations in most parts of the field. Larger differences were found in a small region below the skin due to the absence of electron equilibrium, which is not taken into account in our portal dose analysis. For breast irradiations the measured midplane dose showed a homogeneous distribution in the AP direction in the axial plane, while high dose regions were observed in the cranial and caudal part of the breast. Portal dose measurements and TPS calculations agreed within 2.5% for most of the prostate and lung irradiations. For a few of the prostate and lung treatments larger local differences were found due to differences between the actual patient anatomy and the planning CT data, e.g. as a result of variable gas filling in the rectum and anatomical changes in the lung. CONCLUSIONS: Portal dose measurements with a liquid-filled electronic portal imaging device can be used to determine the 2D midplane dose for various treatment sites in clinical practice. Portal in vivo dosimetry has proven to be important in detecting changes in the patient's anatomy and its influence on the dose delivery. It is concluded that portal dosimetry is an excellent tool for accurate and independent verification of the dose in the entire (2D) midplane during patient treatment. However, a limited number of patients were involved in this study and the results are therefore preliminary. More research is needed to fully assess the clinical value of portal dose measurements.

Algorithms↗

Finding community structure in networks using the eigenvectors of matrices.

We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as "modularity" over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.

Journal Article↗

Optimal a posteriori time domain filter for average evoked potentials.

Evoked potentials measured with scalp electrodes are often described as a deterministic process corrupted by unrelated noise. The common procedure to determine the signal is to average N repetitive measurements. By obtaining additional information from the N measurements, signal detection can be improved. An algorithm that estimates the signal autocorrelation from N given measurements is proposed. The estimator is consistent and unbiased, and its variance tends to 0 as o(N). Two filters that are applied to the average response are introduced. Both depend on the estimation of the signal and the noise autocorrelations. One filter is based on the assumption that the average response is a stationary process. The second filter coefficients are obtained by minimizing the mean squared error (MSE) of an optimal filter of a nonstationary process applied on a single sweep. When a small number of sweeps are averaged, the stationary assumption is adequate, and the MSE of the stationary optimal filter is two to five times less than the MSE of the average response. When a large number of measurements are considered, the error in estimating the autocorrelations decreases. In this case, applying the optimal filter for a nonstationary process leads to a significant improvement in the signal estimation.

Algorithms↗

Comparison of algorithms for the simulation of action potentials with stochastic sodium channels.

This paper presents a comparison of computational algorithms to simulate action potentials using stochastic sodium channels. Four algorithms are compared in single-node models: Strassberg and DeFelice (1993) (SD), Rubinstein (1995) (R), Chow and White (1996) (CW), and Fox (1997) (F). Neural responses are simulated to a simple and a preconditioned monophasic current pulse. Three exact algorithms implementing Markov jumping processes (SD, R, CW) resulted in similar responses, while the approximation algorithm using Langevin's equation (F) showed quite different responses from those in the exact algorithms. The computational time was measured as well: 1(F), 7(CW), 32(SD), 39(R) relative to that of the F algorithm. Furthermore, it is shown that as the sampling step for integration of the transmembrane potential increases, neural responses in all algorithms tended to be different from those in dense sampling steps, however, the CW algorithm was robust even at a sparse sampling step. It is concluded that the most computationally efficient algorithm having appropriate properties of neural excitability is the CW algorithm.

Action Potentials↗