Computer vision for pattern detection in chromosome contact maps.
Ontology highlight
ABSTRACT:
SUBMITTER: Matthey-Doret C
PROVIDER: S-EPMC7670471 | biostudies-literature | 2020 Nov
REPOSITORIES: biostudies-literature
Publications
Computer vision for pattern detection in chromosome contact maps.
Matthey-Doret Cyril C Baudry Lyam L Breuer Axel A Montagne Rémi R Guiglielmoni Nadège N Scolari Vittore V Jean Etienne E Campeas Arnaud A Chanut Philippe Henri PH Oriol Edgar E Méot Adrien A Politis Laurent L Vigouroux Antoine A Moreau Pierrick P Koszul Romain R Cournac Axel A
Nature communications 20201116 1
Chromosomes of all species studied so far display a variety of higher-order organisational features, such as self-interacting domains or loops. These structures, which are often associated to biological functions, form distinct, visible patterns on genome-wide contact maps generated by chromosome conformation capture approaches such as Hi-C. Here we present Chromosight, an algorithm inspired from computer vision that can detect patterns in contact maps. Chromosight has greater sensitivity than e ...[more]
Similar Datasets
Project description:High-frequency oscillations >80 Hz (HFOs) have unique features distinguishing them from spikes and artifactual components that can be well-evidenced in the time-frequency representations. We introduce an unsupervised HFO detector that uses computer-vision algorithms to detect HFO landmarks on two-dimensional (2D) time-frequency maps. To validate the detector, we introduce an analytical model of the HFO based on a sinewave having a Gaussian envelope, for which analytical equations in time-frequency space can be derived, allowing us to establish a direct correspondence between common HFO detection criteria in the time domain with the ones in the frequency domain, used by the computer-vision detection algorithm. The detector identifies potential HFO events on the time-frequency representation, which are classified as true HFOs if criteria regarding the HFO's frequency, amplitude, and duration are met. The detector is validated on simulated HFOs according to the analytical model, in the presence of noise, with different signal-to-noise ratios (SNRs) ranging from -9 to 0 dB. The detector's sensitivity was 0.64 at an SNR of -9 dB, 0.98 at -6 dB, and >0.99 at -3 dB and 0 dB, while its positive prediction value was >0.95, regardless of the SNR. Using the same simulation dataset, our detector is benchmarked against four previously published HFO detectors. The F-measure, a combined metric that takes into account both sensitivity and positive prediction value, was used to compare detection algorithms. Our detector surpassed the other detectors at -6, -3, and 0 dB and had the second best F-score at -9 dB SNR after the MNI detector (0.77 vs. 0.83). The ability to detect HFOs in clinical recordings has been tested on a set of 36 intracranial electroencephalogram (EEG) channels in six patients, with 89% of the detections being validated by two independent reviewers. The results demonstrate that the unsupervised detection of HFOs based on their 2D features in time-frequency maps is feasible and has a performance comparable or better than the most used HFO detectors.
| S-EPMC7104802 | biostudies-literature
Project description:ObjectiveHand hygiene is essential for preventing hospital-acquired infections but is difficult to accurately track. The gold-standard (human auditors) is insufficient for assessing true overall compliance. Computer vision technology has the ability to perform more accurate appraisals. Our primary objective was to evaluate if a computer vision algorithm could accurately observe hand hygiene dispenser use in images captured by depth sensors.Materials and methodsSixteen depth sensors were installed on one hospital unit. Images were collected continuously from March to August 2017. Utilizing a convolutional neural network, a machine learning algorithm was trained to detect hand hygiene dispenser use in the images. The algorithm's accuracy was then compared with simultaneous in-person observations of hand hygiene dispenser usage. Concordance rate between human observation and algorithm's assessment was calculated. Ground truth was established by blinded annotation of the entire image set. Sensitivity and specificity were calculated for both human and machine-level observation.ResultsA concordance rate of 96.8% was observed between human and algorithm (kappa = 0.85). Concordance among the 3 independent auditors to establish ground truth was 95.4% (Fleiss's kappa = 0.87). Sensitivity and specificity of the machine learning algorithm were 92.1% and 98.3%, respectively. Human observations showed sensitivity and specificity of 85.2% and 99.4%, respectively.ConclusionsA computer vision algorithm was equivalent to human observation in detecting hand hygiene dispenser use. Computer vision monitoring has the potential to provide a more complete appraisal of hand hygiene activity in hospitals than the current gold-standard given its ability for continuous coverage of a unit in space and time.
| S-EPMC7481030 | biostudies-literature
Project description:With the rapid aging of the U.S. population, the mobility impairment is becoming a more and more challenging issue that affects a large number of individuals. The research presented in this paper aims at helping the mobility-challenged individuals with a novel robotic companion, which is a walker-type mobile robot capable of accompanying the human user and keeping user at the center for protection and possible power assistance. The robotic companion is equipped with a 3D computer vision system, which provides a unique capability of sensing the human-robot relative position/orientation without physical contact or the need for wearable sensors. As such, the robotic companion enables the user to walk freely with minimum disturbance to his/her normal gait, relieving the user from the physical and cognitive loads associated with the use of traditional assistive devices. For the development of the robotic companion, the authors designed and fabricated a low-cost, differentially steered mobile robotic platform, and also developed a unique image processing system to extract the position/orientation information from the 3D camera-captured images. Furthermore, an advanced motion control system was developed for the robotic companion, which provides novel solutions to the unique challenges such as sway reduction and noise reduction in digital differentiation. To quantify the performance, component and system-level experimentation was conducted, and the results demonstrated that robotic companion and its key components function as desired and the system is expected to reduce the user load and improve the user mobility in real-world scenarios.
| S-EPMC7990042 | biostudies-literature
Project description:Stable cell-cell contacts underpin tissue architecture and organization. Quantification of junctions of mammalian epithelia requires laborious manual measurements that are a major roadblock for mechanistic studies. We designed Junction Mapper as an open access, semi-automated software that defines the status of adhesiveness via the simultaneous measurement of pre-defined parameters at cell-cell contacts. It identifies contacting interfaces and corners with minimal user input and quantifies length, area and intensity of junction markers. Its ability to measure fragmented junctions is unique. Importantly, junctions that considerably deviate from the contiguous staining and straight contact phenotype seen in epithelia are also successfully quantified (i.e. cardiomyocytes or endothelia). Distinct phenotypes of junction disruption can be clearly differentiated among various oncogenes, depletion of actin regulators or stimulation with other agents. Junction Mapper is thus a powerful, unbiased and highly applicable software for profiling cell-cell adhesion phenotypes and facilitate studies on junction dynamics in health and disease.
| S-EPMC7034980 | biostudies-literature
Project description:The purpose of this protocol is to develop a detailed MRI technique and haemodynamic maps enabling early detection of colorectal metastases in the liver.
| 2037102 | ecrin-mdr-crc
Project description:Accurately predicting chromatin loops from genome-wide interaction matrices such as Hi-C data is critical to deepening our understanding of proper gene regulation. Current approaches are mainly focused on searching for statistically enriched dots on a genome-wide map. However, given the availability of orthogonal data types such as ChIA-PET, HiChIP, Capture Hi-C, and high-throughput imaging, a supervised learning approach could facilitate the discovery of a comprehensive set of chromatin interactions. Here, we present Peakachu, a Random Forest classification framework that predicts chromatin loops from genome-wide contact maps. We compare Peakachu with current enrichment-based approaches, and find that Peakachu identifies a unique set of short-range interactions. We show that our models perform well in different platforms, across different sequencing depths, and across different species. We apply this framework to predict chromatin loops in 56 Hi-C datasets, and release the results at the 3D Genome Browser.
| S-EPMC7347923 | biostudies-literature
Project description:Macromolecules carrying biological information often consist of independent modules containing recurring structural motifs. Detection of a specific structural motif within a protein (or DNA) aids in elucidating the role played by the protein (DNA element) and the mechanism of its operation. The number of crystallographically known structures at high resolution is increasing very rapidly. Yet, comparison of three-dimensional structures is a laborious time-consuming procedure that typically requires a manual phase. To date, there is no fast automated procedure for structural comparisons. We present an efficient O(n3) worst case time complexity algorithm for achieving such a goal (where n is the number of atoms in the examined structure). The method is truly three-dimensional, sequence-order-independent, and thus insensitive to gaps, insertions, or deletions. This algorithm is based on the geometric hashing paradigm, which was originally developed for object recognition problems in computer vision. It introduces an indexing approach based on transformation invariant representations and is especially geared toward efficient recognition of partial structures in rigid objects belonging to large data bases. This algorithm is suitable for quick scanning of structural data bases and will detect a recurring structural motif that is a priori unknown. The algorithm uses protein (or DNA) structures, atomic labels, and their three-dimensional coordinates. Additional information pertaining to the structure speeds the comparisons. The algorithm is straightforwardly parallelizable, and several versions of it for computer vision applications have been implemented on the massively parallel connection machine. A prototype version of the algorithm has been implemented and applied to the detection of substructures in proteins.
| S-EPMC52955 | biostudies-other
Project description:State-of-the-art computer vision systems use frame-based cameras that sample the visual scene as a series of high-resolution images. These are then processed using convolutional neural networks using neurons with continuous outputs. Biological vision systems use a quite different approach, where the eyes (cameras) sample the visual scene continuously, often with a non-uniform resolution, and generate neural spike events in response to changes in the scene. The resulting spatio-temporal patterns of events are then processed through networks of spiking neurons. Such event-based processing offers advantages in terms of focusing constrained resources on the most salient features of the perceived scene, and those advantages should also accrue to engineered vision systems based upon similar principles. Event-based vision sensors, and event-based processing exemplified by the SpiNNaker (Spiking Neural Network Architecture) machine, can be used to model the biological vision pathway at various levels of detail. Here we use this approach to explore structural synaptic plasticity as a possible mechanism whereby biological vision systems may learn the statistics of their inputs without supervision, pointing the way to engineered vision systems with similar online learning capabilities.
| S-EPMC6015816 | biostudies-literature
Project description:Understanding the extremely variable, complex shape and venation characters of angiosperm leaves is one of the most challenging problems in botany. Machine learning offers opportunities to analyze large numbers of specimens, to discover novel leaf features of angiosperm clades that may have phylogenetic significance, and to use those characters to classify unknowns. Previous computer vision approaches have primarily focused on leaf identification at the species level. It remains an open question whether learning and classification are possible among major evolutionary groups such as families and orders, which usually contain hundreds to thousands of species each and exhibit many times the foliar variation of individual species. Here, we tested whether a computer vision algorithm could use a database of 7,597 leaf images from 2,001 genera to learn features of botanical families and orders, then classify novel images. The images are of cleared leaves, specimens that are chemically bleached, then stained to reveal venation. Machine learning was used to learn a codebook of visual elements representing leaf shape and venation patterns. The resulting automated system learned to classify images into families and orders with a success rate many times greater than chance. Of direct botanical interest, the responses of diagnostic features can be visualized on leaf images as heat maps, which are likely to prompt recognition and evolutionary interpretation of a wealth of novel morphological characters. With assistance from computer vision, leaves are poised to make numerous new contributions to systematic and paleobotanical studies.
| S-EPMC4812720 | biostudies-literature
Project description:Today, computer vision systems are tested by their accuracy in detecting and localizing instances of objects. As an alternative, and motivated by the ability of humans to provide far richer descriptions and even tell a story about an image, we construct a "visual Turing test": an operator-assisted device that produces a stochastic sequence of binary questions from a given test image. The query engine proposes a question; the operator either provides the correct answer or rejects the question as ambiguous; the engine proposes the next question ("just-in-time truthing"). The test is then administered to the computer-vision system, one question at a time. After the system's answer is recorded, the system is provided the correct answer and the next question. Parsing is trivial and deterministic; the system being tested requires no natural language processing. The query engine employs statistical constraints, learned from a training set, to produce questions with essentially unpredictable answers-the answer to a question, given the history of questions and their correct answers, is nearly equally likely to be positive or negative. In this sense, the test is only about vision. The system is designed to produce streams of questions that follow natural story lines, from the instantiation of a unique object, through an exploration of its properties, and on to its relationships with other uniquely instantiated objects.
| S-EPMC4378453 | biostudies-literature