Search results for "Array"
showing 10 items of 1264 documents
Genomic structural diversity in local goats: Analysis of copy-number variations
2020
Copy-number variations (CNVs) are one of the widely dispersed forms of structural variations in mammalian genomes, and are present as deletions, insertions, or duplications. Only few studies have been conducted in goats on CNVs derived from SNP array data, and many local breeds still remain uncharacterized, e.g., the Sicilian goat dairy breeds. In this study, CNV detection was performed, starting from the genotypic data of 120 individuals, belonging to four local breeds (Argentata dell&rsquo
Multichannel single-output color pattern recognition by use of a joint-transform correlator.
1996
A novel method for performing color image recognition by the use of the coherent joint-transform correlator is introduced. The input plane of the proposed method is a spatial rearrangement of the separation into color channels of both the color input scene and the color target. This input plane is gray scaled and monochromatic, thus it can be displayed by the use of amplitude spatial light modulators to achieve real-time operation. The system provides a single output-plane result of the optical coherent addition of the separate channels’ correlation outputs. At the output plane no electronic postprocessing is needed, and the detection decision is achieved simply by the application of thresh…
A Combinatorial Color Edge Detector
2004
In this paper, we present an edge detection approach in color image using neighborhood hypergraph. The edge structure is detected by a structural model. The Color Image Neighborhood Hypergraph (CINH) representation is first computed, then the hyperedges of CINH are classified into noise or edge based on hypergraph properties. To evaluate the algorithm performance, experiments were carried out on synthetic and real color images corrupted by alpha-stable noise. The results show that the proposed edge detector finds the edges properly from color images.
Application of the S-CIELAB color model to processed and calibrated images with a colorimetric dithering method.
2009
This work uses the S-CIELAB color model to compare images that have been calibrated and processed using a colorimetric dithering method which simulates increments in viewing distance. Firstly, we obtain XYZ calibrated images by applying the appropriate color transformations to the original images. These transformations depend on whether the image is viewed on a display device or encoded by a capture device, for example. Secondly, we use a colorimetric dithering method consisting of a partitive additive mixing of XYZ tristimulus values. The number of dithered pixels depends on simulated viewing distance. The dithered tristimulus values are transformed to digital data to observe the dithering…
Overview of the Evolution of Silica-Based Chromo-Fluorogenic Nanosensors
2019
[EN] This review includes examples of silica-based, chromo-fluorogenic nanosensors with the aim of illustrating the evolution of the discipline in recent decades through relevant research developed in our group. Examples have been grouped according to the sensing strategies. A clear evolution from simply functionalized materials to new protocols involving molecular gates and the use of highly selective biomolecules such as antibodies and oligonucleotides is reported. Some final examples related to the evolution of chromogenic arrays and the possible use of nanoparticles to communicate with other nanoparticles or cells are also included. A total of 64 articles have been summarized, highlight…
THE INFLUENCE OF CHROMATIC ABERRATION ON DEMOSAICKING
2014
International audience; The wide deployment of colour imaging devices owes much to the use of colour filter array (CFA). A CFA produces a mosaic image, and normally a subsequent CFA demosaick-ing algorithm interpolates the mosaic image and estimates the full-resolution colour image. Among various types of optical aberrations from which a mosaic image may suffer, chromatic aberration (CA) influences the spatial and spectral correlation through the artefacts such as blur and mis-registration, which demosaicking also relies on. In this paper we propose a simulation framework aimed at an investigation of the influence of CA on demosaicking. Results show that CA benefits de-mosaicking to some ex…
On the construction of classes of suffix trees for square matrices: Algorithms and applications
1995
Given an n × n TEXT matrix with entries defined over an ordered alphabet σ, we introduce 4n−1 classes of index data structures for TEXT. Those indices are informally the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on TEXT. We provide one simple algorithm that efficiently builds any chosen index in those classes in O(n2 log n) worst case time using O(n2) space. The algorithm can be modified to require optimal O(n2) expected time for bounded σ.
On-line construction of two-dimensional suffix trees
1997
We present a new technique, which we refer to as implicit updates, based on which we obtain: (a) an algorithm for the on-line construction of the Lsuffix tree of an n x n matrix A — this data structure, described in [13], is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations for LZ1-type on-dine lossless image compression methods. Those methods, recently introduced by Storer [35], are generalizations of LZl-type compression methods for strings (see also [24, 31]). For the problem in (a), we get nearly an order of magnitude improvement over algorithms that can be derived from known techniques [13]. For the problem in (b), we do …
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
JANE: efficient mapping of prokaryotic ESTs and variable length sequence reads on related template genomes
2009
Abstract Background ESTs or variable sequence reads can be available in prokaryotic studies well before a complete genome is known. Use cases include (i) transcriptome studies or (ii) single cell sequencing of bacteria. Without suitable software their further analysis and mapping would have to await finalization of the corresponding genome. Results The tool JANE rapidly maps ESTs or variable sequence reads in prokaryotic sequencing and transcriptome efforts to related template genomes. It provides an easy-to-use graphics interface for information retrieval and a toolkit for EST or nucleotide sequence function prediction. Furthermore, we developed for rapid mapping an enhanced sequence align…