Search results for "informatica"

showing 10 items of 1003 documents

Combining one class fuzzy KNN’s

2007

This paper introduces a parallel combination of N > 2 one class fuzzy KNN (FKNN) classifiers. The classifier combination consists of a new optimization procedure based on a genetic algorithm applied to FKNN’s, that differ in the kind of similarity used. We tested the integration techniques in the case of N = 5 similarities that have been recently introduced to face with categorical data sets. The assessment of the method has been carried out on two public data set, the Masquerading User Data (www.schonlau.net) and the badges database on the UCI Machine Learning Repository (http://www.ics.uci.edu/~mlearn/). Preliminary results show the better performance obtained by the fuzzy integration …

Fuzzy classificationSettore INF/01 - InformaticaComputer sciencebusiness.industryPattern recognitioncomputer.software_genreFuzzy logicClassifier combinationComputingMethodologies_PATTERNRECOGNITIONGenetic algorithmFuzzy set operationsData miningArtificial intelligencebusinessfuzzy classificationCategorical variablecomputerFuzzy knnClassifier (UML)
researchProduct

Fuzziness: Came for the View, Stayed for the Same

2013

The first time I came across Fuzzy Sets, my first point of contact with Soft Computing, I was a young and inexperienced student of Computer Science in my hometown University. I had just completed the first semester, and as an aside of an image processing curriculum a loud-spoken, very kinetic lecturer spent a couple of hours introducing us to the mysteries of the idea of degree and Fuzzy arithmetic. The whole thing had a sort of secret sect bent, something like the secret tools that the powers to be don’t want you to know and use – a probably unwitting attitude I have seen many times in the community and that has harmed more than helped, but that on an unexperienced and young student as mys…

Fuzzy entropySettore INF/01 - InformaticaPoint (typography)AsideFuzzy setFuzzy arithmeticMathematics educationFuzzines Fuzzy Sets TheoryCurriculum
researchProduct

Keypoint descriptor matching with context-based orientation estimation

2014

Abstract This paper presents a matching strategy to improve the discriminative power of histogram-based keypoint descriptors by constraining the range of allowable dominant orientations according to the context of the scene under observation. This can be done when the descriptor uses a circular grid and quantized orientation steps, by computing or providing a global reference orientation based on the feature matches. The proposed matching strategy is compared with the standard approaches used with the SIFT and GLOH descriptors and the recent rotation invariant MROGH and LIOP descriptors. A new evaluation protocol based on an approximated overlap error is presented to provide an effective an…

GLOHComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformContext basedReference orientationImage descriptorLIOPDiscriminative modelMROGHHistogramKeypoint matchingSIFTComputer Science::MultimediaComputer visionInvariant (mathematics)MathematicsDominant orientationSettore INF/01 - Informaticabusiness.industryPattern recognitionGridLocal featureRotation invarianceComputer Science::Computer Vision and Pattern RecognitionSignal ProcessingImage descriptors; Local features; Dominant orientation; Rotation invariance; Keypoint matching; SIFT; LIOP; MROGHComputer Vision and Pattern RecognitionArtificial intelligencebusiness
researchProduct

From Nerode's congruence to Suffix Automata with mismatches

2009

AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…

General Computer ScienceOpen problem[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyString searching algorithm01 natural sciencesTheoretical Computer ScienceCombinatoricsDeterministic automatonSuffix automata0202 electrical engineering electronic engineering information engineeringCombinatorics on words Indexing Suffix Automata Languages with mismatches Approximate string matchingMathematicsDiscrete mathematicsCombinatorics on wordsApproximate string matchingSettore INF/01 - InformaticaLanguages with mismatchesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)PrefixCombinatorics on wordsDeterministic finite automaton010201 computation theory & mathematicsSuffix automatonIndexing020201 artificial intelligence & image processingSuffixComputer Science::Formal Languages and Automata TheoryComputer Science(all)
researchProduct

On the exhaustive generation of k-convex polyominoes

2017

The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.

General Computer SciencePolyomino0102 computer and information sciences02 engineering and technologyComputer Science::Computational Geometry01 natural sciencesConvexityTheoretical Computer ScienceCombinatoricsCAT algorithmIntegerExhaustive generation0202 electrical engineering electronic engineering information engineeringConvex polyominoeConvexity K-convex polyominoes.Convex polyominoesComputer Science::DatabasesMathematicsDiscrete mathematicsAmortized analysisMathematics::CombinatoricsDegree (graph theory)Settore INF/01 - InformaticaComputer Science (all)Regular polygonMonotone polygon010201 computation theory & mathematicsPath (graph theory)020201 artificial intelligence & image processingCAT algorithms; Convex polyominoes; Exhaustive generation;CAT algorithms
researchProduct

A combinatorial view on string attractors

2021

Abstract The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w 1 w 2 ⋯ w n is a subset Γ of the positions { 1 , … , n } , such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. In this paper we explore the notion of string attractor by focusing on its combinatorial properties. In particular, we show how the size of the smallest string attractor of a word varies when combinatorial operations are applied and we deduce that such a measure is not monotone. Moreover, we introduce a c…

General Computer ScienceSettore INF/01 - InformaticaString (computer science)de Bruijn word0102 computer and information sciences02 engineering and technologyCharacterization (mathematics)Burrows-Wheeler transform01 natural sciencesMeasure (mathematics)Standard Sturmian wordTheoretical Computer ScienceCombinatoricsConjugacy classMonotone polygonString attractor010201 computation theory & mathematicsAttractorThue-Morse word0202 electrical engineering electronic engineering information engineeringLempel-Ziv encoding020201 artificial intelligence & image processingWord (group theory)Mathematics
researchProduct

A framework for assessing frequency domain causality in physiological time series with instantaneous effects.

2013

We present an approach for the quantification of directional relations in multiple time series exhibiting significant zero-lag interactions. To overcome the limitations of the traditional multivariate autoregressive (MVAR) modelling of multiple series, we introduce an extended MVAR (eMVAR) framework allowing either exclusive consideration of time-lagged effects according to the classic notion of Granger causality, or consideration of combined instantaneous and lagged effects according to an extended causality definition. The spectral representation of the eMVAR model is exploited to derive novel frequency domain causality measures that generalize to the case of instantaneous effects the kno…

General MathematicsGeneral Physics and AstronomyModels BiologicalCausality (physics)Physics and Astronomy (all)Engineering (all)Granger causalityEconometricsMathematics (all)Coherence (signal processing)AnimalsHumansComputer SimulationDirected coherenceMathematicsMultivariate autoregressive modelModels StatisticalSeries (mathematics)Partial directed coherenceGeneral EngineeringSystem identificationAC powerAutoregressive modelFrequency domainSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaGranger causalityDirected coherence; Granger causality; Multivariate autoregressive models; Partial directed coherence; Mathematics (all); Engineering (all); Physics and Astronomy (all)AlgorithmsPhilosophical transactions. Series A, Mathematical, physical, and engineering sciences
researchProduct

Fusion of visual tools in virtual spaces

1996

Virtual space environment may be improved by combining it with graphical and visual tools. This paper analyses an integrated system able to merge fusion techniques, icons tools and a virtual space environment. A virtual space is characterised by a set of dynamic visual icons and by a heterogeneous virtual reality environment. Their integration is supported by virtual icon grammar (VIG) working on dynamic icons and virtual world. VIG allows to test the actions made by dynamic icons on the activated Virtual World metaphors at a time “t”, and a range of different transactions that place between user and VW(visual query, view and browse of under-world,...), moreover, user can define, modify and…

GrammarSettore INF/01 - InformaticaVirtual worldmedia_common.quotation_subjectVirtual spaceVirtual realityMetaverseMixed realityHuman–computer interactionVisual queryIconVirtual spaces graphical and visual toolscomputerSimulationMathematicsmedia_commoncomputer.programming_language
researchProduct

Granger causality analysis of sleep brain-heart interactions

2014

We studied the networks of Granger causality (GC) between the time series of cardiac vagal autonomic activity and brain wave activities, measured respectively as the normalized high frequency (HF) component of heart rate variability and EEG power in the δ, θ, α, σ, β bands, computed in 10 healthy subjects during sleep. GC analysis was performed by vector autoregressive modeling, and significance of each link in the network was assessed using F-statistics. The whole-night analysis revealed the existence of a fully connected network of brain-heart and brain-brain interactions, with the ß EEG power acting as a hub which conveys the largest number of GC links between the heart and brain n…

Granger causality analysismedicine.diagnostic_testBiomedical EngineeringHealthy subjectsElectroencephalographySleep in non-human animalsGranger causalityAutoregressive modelSettore ING-INF/06 - Bioingegneria Elettronica E InformaticamedicineHeart rate variabilityPsychologyNeuroscienceSlow-wave sleep2014 8th Conference of the European Study Group on Cardiovascular Oscillations (ESGCO)
researchProduct

New Error Measures to Evaluate Features on Three-Dimensional Scenes

2011

In this paper new error measures to evaluate image features in three-dimensional scenes are proposed and reviewed. The proposed error measures are designed to take into account feature shapes, and ground truth data can be easily estimated. As other approaches, they are not error-free and a quantitative evaluation is given according to the number of wrong matches and mismatches in order to assess their validity

Ground truthFeature Detector Feature Descriptor Overlap Error Epipolar Geometry Feature Matching and ComparisonSettore INF/01 - InformaticaFeature (computer vision)business.industryEpipolar geometryFeature descriptorPattern recognitionArtificial intelligencebusinessFeature matchingMathematics
researchProduct