Search results for " Informatica"

showing 10 items of 978 documents

Balanced Words Having Simple Burrows-Wheeler Transform

2009

The investigation of the "clustering effect" of the Burrows-Wheeler transform (BWT) leads to study the words having simple BWT , i.e. words w over an ordered alphabet $A=\{a_1,a_2,\ldots,a_k\}$, with $a_1 < a_2 < \ldots <a_k$, such that $bwt(w)$ is of the form $a_k^{n_k} a_{k-1}^{n_{k-1}} \cdots a_1^{n_1}$, for some non-negative integers $n_1, n_2, \ldots, n_k$. We remark that, in the case of binary alphabets, there is an equivalence between words having simple BWT, the family of (circular) balanced words and the conjugates of standard words. In the case of alphabets of size greater than two, there is no more equivalence between these notions. As a main result of this paper we prove that, u…

CombinatoricsConjugacy classClustering effectBurrows–Wheeler transformSettore INF/01 - InformaticaBurrows Wheeler Transform Combinatorics on Words Balanced sequences epistandard rich words words having simple BWTBinary numberBurrows-Wheeler TransformAlphabetBinary alphabetBurrows-Wheeler Transform; Clustering effectMathematics
researchProduct

Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences

2014

The degree of predictability of a sequence can be measured by its entropy and it is closely related to its repetitiveness and compressibility. Entropic profiles are useful tools to study the under- and over-representation of subsequences, providing also information about the scale of each conserved DNA region. On the other hand, compact classes of repetitive motifs, such as maximal motifs, have been proved to be useful for the identification of significant repetitions and for the compression of biological sequences. In this paper we show that there is a relationship between entropic profiles and maximal motifs, and in particular we prove that the former are a subset of the latter. As a furt…

CombinatoricsSpeedupSettore INF/01 - InformaticaLinear spacePattern discovery maximal motifsEntropy (information theory)PredictabilityTime complexityMathematics
researchProduct

Approximated overlap error for the evaluation of feature descriptors on 3D scenes

2013

This paper presents a new framework to evaluate feature descriptors on 3D datasets. The proposed method employs the approximated overlap error in order to conform with the reference planar evaluation case of the Oxford dataset based on the overlap error. The method takes into account not only the keypoint centre but also the feature shape and it does not require complex data setups, depth maps or an accurate camera calibration. Only a ground-truth fundamental matrix should be computed, so that the dataset can be freely extended by adding further images. The proposed approach is robust to false positives occurring in the evaluation process, which do not introduce any relevant changes in the …

Complex data typeSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - Informaticabusiness.industryComputer scienceGLOHEpipolar geometryComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformPattern recognitionLIOPMROGHkeypoint descriptorSIFTepipolar geometryFalse positive paradoxComputer visionArtificial intelligencebusinessFundamental matrix (computer vision)descriptor evaluationCamera resectioning
researchProduct

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…

Compressed suffix arrayGeneral Computer ScienceSuffix tree[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Generalized suffix tree0102 computer and information sciences02 engineering and technologyData_CODINGANDINFORMATIONTHEORYText indexing01 natural sciencesY-fast trielaw.inventionLongest common substring problemTheoretical Computer ScienceCombinatoricsSuffix treelawFactor and suffix automata0202 electrical engineering electronic engineering information engineeringData_FILESArithmeticFactor and suffix automata; Pattern matching; Suffix tree; Text indexing; Theoretical Computer Science; Computer Science (all)Pattern matchingMathematicsSettore INF/01 - InformaticaX-fast trieComputer Science (all)LCP array010201 computation theory & mathematics020201 artificial intelligence & image processingFM-index
researchProduct

Table Compression

2016

Data Compression Techniques for massive tables are described. Related methodological results are also presented.

Compression and transmission of tableSettore INF/01 - InformaticaBig Data ManagementStorageCompressive estimates of entropyData Compression. Algorithms. Data structuresCompression of multidimensional data
researchProduct

Local operators to detect regions of interest

1997

The performance of a visual system is strongly influenced by the information processing that is done in the early vision phase. The need exists to limit the computation on areas of interest to reduce the total amount of data and their redundancy. This paper describes a new method to drive the attention during the analysis of complex scenes. Two new local operators, based on the computation of local moments and symmetries, are combined to drive the selection. Experimental results on real data are also reported. © 1997 Elsevier Science B.V.

ComputationEarly visioncomputer.software_genreMachine learningFacial recognition systemSegmentationArtificial IntelligenceRedundancy (engineering)Selection (linguistics)AttentionSegmentationLimit (mathematics)Face recognitionElectrical and Electronic Engineering1707MathematicsSettore INF/01 - Informaticabusiness.industryInformation processingSignal ProcessingSymmetry operatorComputer Vision and Pattern RecognitionArtificial intelligenceData miningbusinesscomputerSoftwarePattern Recognition Letters
researchProduct

Attentional vs computational complexity measures in observing paintings

2009

Because of the great heterogeneity of subjects and styles, esthetic perception delineates a special and elusive field of research in vision, which represents an interesting challenge for cognitive science tools. With specific regard to the role of visual complexity, in this paper we present an experiment aimed to measure this dimension in a heterogeneous set of paintings. We compared perceived time complexity measures - based on a temporal estimation paradigm - with physical and statistical properties of the paintings, obtaining a strong correlation between psychological and computational results.

Computational complexity theoryVisionmedia_common.quotation_subjectMedicine in the ArtsVisual PhysiologyExperimental and Cognitive PsychologyField (computer science)PerceptionHumansAttentionDimension (data warehouse)Set (psychology)Time complexitymedia_commonSettore INF/01 - Informaticabusiness.industryDistance PerceptionComplexityForm PerceptionPattern Recognition VisualPattern recognition (psychology)PaintingsComputer Vision and Pattern RecognitionArtificial intelligenceFactor Analysis StatisticalPsychologybusinessPhotic StimulationCognitive psychology
researchProduct

Modelling the Effects of Internal Textures on Symmetry Detection Using Fuzzy Operators

2009

Symmetry is a crucial dimension which aids the visual system, human as well as artificial, to organize its environment and to recognize forms and objects. In humans, detection of symmetry, especially bilateral and rotational, is considered to be a primary factor for discovering and interacting with the surrounding environment. Rotational symmetry detecting can be affected by less-known factors, such as the stimulus internal texture. This paper explores how fuzzy operators can be usefully employed in modeling the effects of the internal texture on symmetry detection. To this aim, we selected two symmetry detection algorithms, based on different computational models, and compared their output…

Computational modelVisual perceptionSettore INF/01 - InformaticaComputer sciencebusiness.industryRotational symmetryFuzzy operatorsPattern recognitionFuzzy logicMemetic algorithmComputer visionArtificial intelligencebusinessvisual perception symmetry fuzzy logic
researchProduct

Information decomposition of short-term cardiovascular and cardiorespiratory variability

2013

We present an entropy decomposition strategy aimed at quantifying how the predictive information (PI) about heart rate (HR) variability is dynamically stored in HR and is transferred to HR from arterial pressure (AP) and respiration (RS) variability according to synergistic or redundant cooperation. The PI is expressed as the sum of the self entropy (SE) of HR plus the transfer entropy (TE) from RS,AP to HR, quantifying respectively the information stored in the cardiac system and transferred to the cardiac system to the vascular and respiratory systems. The information transfer is further decomposed as the sum of the (unconditioned) TE from RS to HR plus the TE from SP to HR conditioned to…

Computer Science (all)Settore ING-INF/06 - Bioingegneria Elettronica E InformaticaCardiology and Cardiovascular Medicine
researchProduct

Transient behavior of cardiorespiratory interactions towards the onset of epileptic seizures

2014

Epileptic seizures are typically related to autonomic dysfunction. During seizures, the cardiac and respiratory mechanisms are deeply affected. This effect of epilepsy can also occur a few seconds before the seizure onset in the EEG. In addition, the interaction between respiration and heart rate is also expected to be affected. This study aims to determine whether the cardiorespiratory interactions change during seizures, and more importantly if they show a transient behavior towards the seizure onset. This is done by means of a time series method based on entropy decomposition applied to ECG and respiratory data. Here, the information carried by the heart rate that can be predicted by its…

Computer Science (all)Settore ING-INF/06 - Bioingegneria Elettronica E InformaticaCardiology and Cardiovascular Medicine
researchProduct