Nandb-number and brightness in R with a novel automatic detrending algorithm.
Ontology highlight
ABSTRACT:
SUBMITTER: Nolan R
PROVIDER: S-EPMC5860167 | biostudies-literature | 2017 Nov
REPOSITORIES: biostudies-literature
Publications
nandb-number and brightness in R with a novel automatic detrending algorithm.
Nolan Rory R Alvarez Luis A J LAJ Elegheert Jonathan J Iliopoulou Maro M Jakobsdottir G Maria GM Rodriguez-Muñoz Marina M Aricescu A Radu AR Padilla-Parra Sergi S
Bioinformatics (Oxford, England) 20171101 21
<h4>Summary</h4>An R package for performing number and brightness image analysis, with the implementation of a novel automatic detrending algorithm.<h4>Availability and implementation</h4>Available at https://github.com/rorynolan/nandb for all platforms.<h4>Contact</h4>rnolan@well.ox.ac.uk or spadilla@well.ox.ac.uk.<h4>Supplementary information</h4>Supplementary data are available at Bioinformatics online. ...[more]
Similar Datasets
Project description:Four of the most common limitations of the many available clustering methods are: i) the lack of a proper strategy to deal with outliers; ii) the need for a good a priori estimate of the number of clusters to obtain reasonable results; iii) the lack of a method able to detect when partitioning of a specific data set is not appropriate; and iv) the dependence of the result on the initialization. Here we propose Cross-clustering (CC), a partial clustering algorithm that overcomes these four limitations by combining the principles of two well established hierarchical clustering algorithms: Ward's minimum variance and Complete-linkage. We validated CC by comparing it with a number of existing clustering methods, including Ward's and Complete-linkage. We show on both simulated and real datasets, that CC performs better than the other methods in terms of: the identification of the correct number of clusters, the identification of outliers, and the determination of real cluster memberships. We used CC to cluster samples in order to identify disease subtypes, and on gene profiles, in order to determine groups of genes with the same behavior. Results obtained on a non-biological dataset show that the method is general enough to be successfully used in such diverse applications. The algorithm has been implemented in the statistical language R and is freely available from the CRAN contributed packages repository.
| S-EPMC4807765 | biostudies-literature
Project description:Human neonates spontaneously associate changes in magnitude across the dimensions of number, length, and duration. Do these particular associations generalize to other pairs of magnitudes in the same way at birth, or do they reflect an early predisposition to expect specific relations between spatial, temporal, and numerical representations? To begin to answer this question, we investigated how strongly newborns associated auditory sequences changing in number/duration with visual objects changing in levels of brightness. We tested forty-eight newborn infants in one of three, bimodal stimulus conditions in which auditory numbers/durations increased or decreased from a familiarization trial to the two test trials. Auditory numbers/durations were paired with visual objects in familiarization that remained the same on one test trial but changed in luminance/contrast or shape on the other. On average, results indicated that newborns looked longer when changes in brightness accompanied the number/duration change as compared to no change, a preference that was most consistent when the brightness change was congruent with the number/duration change. For incongruent changes, this preference depended on trial order. Critically, infants showed no preference for a shape change over no shape change, indicating that infants likely treated brightness differently than a generic feature. Though this performance pattern is somewhat similar to previously documented associations, these findings suggest that cross-magnitude associations among number, length, and duration may be more specialized at birth, rather than emerge gradually from postnatal experience or maturation.
| S-EPMC6773210 | biostudies-literature
Project description:BackgroundAccurate assessment of hepatic steatosis is a key to grade disease severity in non-alcoholic fatty liver disease (NAFLD).MethodsWe developed a digital automated quantification of steatosis on whole-slide images (WSIs) of liver tissue and performed a validation study. Hematoxylin-eosin stained liver tissue slides were digitally scanned, and steatotic areas were manually annotated. We identified thresholds for size and roundness parameters by logistic regression to discriminate steatosis from surrounding liver tissue. The resulting algorithm produces a steatosis proportionate area (SPA; ratio of steatotic area to total tissue area described as percentage). The software can be implemented as a Java plug-in in FIJI, in which digital WSI can be processed automatically using the Pathomation extension.ResultsWe obtained liver tissue specimens from 61 NAFLD patients and 18 controls. The area under the curve of correctly classified steatosis by the algorithm was 0.970 (95% CI 0.968-0.973), P?<?0.001. Accuracy of the algorithm was 91.9%, with a classification error of 8.1%. SPA correlated significantly with steatosis grade (Rs = 0.845, CI: 0.749-0.902, P?<?0.001) and increased significantly with each individual steatosis grade, except between Grade 2 and 3.ConclusionsWe have developed a novel digital analysis algorithm that accurately quantifies steatosis on WSIs of liver tissue. This algorithm can be incorporated when quantification of steatosis is warranted, such as in clinical trials studying efficacy of new therapeutic interventions in NAFLD. © 2019 The Authors. Cytometry Part B: Clinical Cytometry published by Wiley Periodicals, Inc. on behalf of International Clinical Cytometry Society.
| S-EPMC6899563 | biostudies-literature
Project description:Many cancers have been linked to copy number variations (CNVs) in the genomic DNA. Although there are existing methods to analyze CNVs from individual samples, cancer-causing genes are more frequently discovered in regions where CNVs are common among tumor samples, also known as recurrent CNVs. Integrating multiple samples and locating recurrent CNV regions remain a challenge, both computationally and conceptually. We propose a new graph-based algorithm for identifying recurrent CNVs using the maximal clique detection technique. The algorithm has an optimal solution, which means all maximal cliques can be identified, and guarantees that the identified CNV regions are the most frequent and that the minimal regions have been delineated among tumor samples. The algorithm has successfully been applied to analyze a large cohort of breast cancer samples and identified some breast cancer-associated genes and pathways.
| S-EPMC5063805 | biostudies-literature
Project description:Incidental radiation exposure to the heart during lung cancer radiotherapy is associated with radiation-induced heart disease and increased rates of mortality. By considering the respiratory-induced motion of the heart it is possible to create a radiotherapy plan that results in a lower overall cardiac dose. This approach is challenging using current clinical practices: manual contouring of the heart is time consuming, and subject to inter- and intra-observer variability. In this work, we investigate the feasibility of our previously developed, atlas-based, automatic heart segmentation tool to delineate the heart in four-dimensional x-ray computed tomography (4D-CT) images. We used a dataset comprising 19 patients receiving radiotherapy for lung cancer, with 4D-CT imaging acquired at 10 respiratory phases and with a maximum intensity projection image generated from these. For each patient, one of four experienced radiation oncologists contoured the heart on each respiratory phase image and the maximum intensity image. Automatic segmentation of the heart on these same patient image sets was achieved using a leave-one-out approach, where for each patient the remaining 18 were used as an atlas set. The consistency of the automatic segmentation relative to manual contouring was evaluated using the Dice similarity coefficient (DSC) and mean absolute surface-to-surface distance (MASD). The DSC and MASD are comparable to inter-observer variability in clinically acceptable whole heart delineations (average DSC > 0.93 and average MASD < 2.0 mm in all the respiratory phases). The comparison between automatic and manual delineations on the maximum intensity images produced an overall mean DSC of 0.929 and a mean MASD of 2.07 mm. The automatic, atlas-based segmentation tool produces clinically consistent and robust heart delineations and is easy to implement in the routine care of lung cancer patients.
| S-EPMC7808597 | biostudies-literature
Project description:Assigning bond orders is a necessary and essential step for characterizing a chemical structure correctly in force field based simulations. Several methods have been developed to do this. They all have advantages but with limitations too. Here, an automatic algorithm for assigning chemical connectivity and bond order regardless of hydrogen for organic molecules is provided, and only three dimensional coordinates and element identities are needed for our algorithm. The algorithm uses hard rules, length rules and conjugation rules to fix the structures. The hard rules determine bond orders based on the basic chemical rules; the length rules determine bond order by the length between two atoms based on a set of predefined values for different bond types; the conjugation rules determine bond orders by using the length information derived from the previous rule, the bond angles and some small structural patterns. The algorithm is extensively evaluated in three datasets, and achieves good accuracy of predictions for all the datasets. Finally, the limitation and future improvement of the algorithm are discussed.
| S-EPMC3557220 | biostudies-literature
Project description:We hypothesized that the implementation of automatic real-time assessment of quality of forced spirometry (FS) may significantly enhance the potential for extensive deployment of a FS program in the community. Recent studies have demonstrated that the application of quality criteria defined by the ATS/ERS (American Thoracic Society/European Respiratory Society) in commercially available equipment with automatic quality assessment can be markedly improved. To this end, an algorithm for assessing quality of FS automatically was reported. The current research describes the mathematical developments of the algorithm. An innovative analysis of the shape of the spirometric curve, adding 23 new metrics to the traditional 4 recommended by ATS/ERS, was done. The algorithm was created through a two-step iterative process including: (1) an initial version using the standard FS curves recommended by the ATS; and, (2) a refined version using curves from patients. In each of these steps the results were assessed against one expert's opinion. Finally, an independent set of FS curves from 291 patients was used for validation purposes. The novel mathematical approach to characterize the FS curves led to appropriate FS classification with high specificity (95%) and sensitivity (96%). The results constitute the basis for a successful transfer of FS testing to non-specialized professionals in the community.
| S-EPMC4281176 | biostudies-literature
Project description:Parasitic infections are generally diagnosed by professionals trained to recognize the morphological characteristics of the eggs in microscopic images of fecal smears. However, this laboratory diagnosis requires medical specialists which are lacking in many of the areas where these infections are most prevalent. In response to this public health issue, we developed a software based on pattern recognition analysis from microscopi digital images of fecal smears, capable of automatically recognizing and diagnosing common human intestinal parasites. To this end, we selected 229, 124, 217, and 229 objects from microscopic images of fecal smears positive for Taenia sp., Trichuris trichiura, Diphyllobothrium latum, and Fasciola hepatica, respectively. Representative photographs were selected by a parasitologist. We then implemented our algorithm in the open source program SCILAB. The algorithm processes the image by first converting to gray-scale, then applies a fourteen step filtering process, and produces a skeletonized and tri-colored image. The features extracted fall into two general categories: geometric characteristics and brightness descriptions. Individual characteristics were quantified and evaluated with a logistic regression to model their ability to correctly identify each parasite separately. Subsequently, all algorithms were evaluated for false positive cross reactivity with the other parasites studied, excepting Taenia sp. which shares very few morphological characteristics with the others. The principal result showed that our algorithm reached sensitivities between 99.10%-100% and specificities between 98.13%- 98.38% to detect each parasite separately. We did not find any cross-positivity in the algorithms for the three parasites evaluated. In conclusion, the results demonstrated the capacity of our computer algorithm to automatically recognize and diagnose Taenia sp., Trichuris trichiura, Diphyllobothrium latum, and Fasciola hepatica with a high sensitivity and specificity.
| S-EPMC5391948 | biostudies-literature
Project description:Selective methyl labeling is an extremely powerful approach to study the structure, dynamics and function of biomolecules by NMR. Despite spectacular progress in the field, such studies remain rather limited in number. One of the main obstacles remains the assignment of the methyl resonances, which is labor intensive and error prone. Typically, NOESY crosspeak patterns are manually correlated to the available crystal structure or an in silico template model of the protein. Here, we propose methyl assignment by graphing inference construct, an exhaustive search algorithm with no peak network definition requirement. In order to overcome the combinatorial problem, the exhaustive search is performed locally, i.e. for a small number of methyls connected through-space according to experimental 3D methyl NOESY data. The local network approach drastically reduces the search space. Only the best local assignments are combined to provide the final output. Assignments that match the data with comparable scores are made available to the user for cross-validation by additional experiments such as methyl-amide NOEs. Several NMR datasets for proteins in the 25-50 kDa range were used during development and for performance evaluation against the manually assigned data. We show that the algorithm is robust, reliable and greatly speeds up the methyl assignment task.
| S-EPMC5764113 | biostudies-literature
Project description:This paper presents a method for automated detection of complex (non-self-avoiding) postures of the nematode Caenorhabditis elegans and its application to analyses of locomotion defects. Our approach is based on progressively detailed statistical models that enable detection of the head and the body even in cases of severe coilers, where data from traditional trackers is limited. We restrict the input available to the algorithm to a single digitized frame, such that manual initialization is not required and the detection problem becomes embarrassingly parallel. Consequently, the proposed algorithm does not propagate detection errors and naturally integrates in a "big data" workflow used for large-scale analyses. Using this framework, we analyzed the dynamics of postures and locomotion of wild-type animals and mutants that exhibit severe coiling phenotypes. Our approach can readily be extended to additional automated tracking tasks such as tracking pairs of animals (e.g., for mating assays) or different species.
| S-EPMC4595081 | biostudies-literature