Search results for "Tree"

showing 10 items of 1841 documents

Description of Dynamic Structured Scenes by a SOM/ARSOM Hierarchy

2001

A neural architecture is presented, aimed to describe the dynamic evolution of complex structures inside a video sequence. The proposed system is arranged as a tree of self-organizing maps. Leaf nodes are implemented by ARSOM networks as a way to code dynamic inputs, while classical SOM's are used to implement the upper levels of the hierarchy. Depending on the application domain, inputs are made by suitable low level features extracted frame by frame of the sequence. Theoretical foundations of the architecture are reported along with a detailed outline of its structure, and encouraging experimental results.

Self-organizationVideo productionTheoretical computer scienceArtificial neural networkbusiness.industryApplication domainComputer scienceArtificial intelligencebusinessTree (graph theory)
researchProduct

Tree Structured Self-Organizing Maps

1999

Publisher Summary This chapter provides an overview of the tree structured self-organizing maps (TS-SOM). It was originally intended as a fast implementation of the self-organizing map (SOM). The chapter explains that TS-SOM is a constructive smoother for a class of dimension reduction problems. There is a well known relation between self-organizing maps and principal curves. Unfortunately in most presentations it is derived by simple reasoning, avoiding the mathematical statement of the problem, which is essential to understand how efficient SOM implementations can be constructed. In this chapter, SOM is derived as a numerical solution of a generic model in a continuous domain, which diffe…

Self-organizing mapTree (data structure)Theoretical computer scienceArtificial neural networkRelation (database)Simple (abstract algebra)Computer scienceDimensionality reductionConstructiveDomain (software engineering)
researchProduct

A Parallel Implementation of the Tree-Structured Self-Organizing Map

2002

This paper presents how Self-Organizing Maps (SOMs)can be trained efficiently using several, simultaneously executing threads on a shared memory Symmetric MultiProcessing (SMP)computer. The training method is a batch version of the Tree-Structured Self-Organizing Map. We note that SMP type of parallel training is very useful for large data sets obtained from nature, the process industry or large document collections, since we do not encounter similar model size limitations as with hardware SOM implementations.

Self-organizing mapTree (data structure)Theoretical computer scienceShared memoryComputer scienceSymmetric multiprocessingMessage Passing InterfaceBatch processingMultiprocessingParallel computingThread (computing)Implementation
researchProduct

Semi-automatic registration of retinal images based on line matching approach

2013

Accurate retinal image registration is essential to track the evolution of eye-related diseases. We propose a semiautomatic method based on features relying upon retinal graphs for temporal registration of retinal images. The features represent straight lines connecting vascular landmarks on the retina vascular tree: bifurcations, branchings, crossings, end points. In the built retinal graph, one straight line between two vascular landmarks indicates that they are connected by a vascular segment in the original retinal image. The locations of the landmarks are manually extracted to avoid the information loss due to errors in a retinal vessels segmentation algorithms. A straight line model i…

Semi-automatic registration of retinal images based on line matching approachGround truthSettore INF/01 - InformaticaMatching (graph theory)Computer sciencebusiness.industryFeature extractionImage registrationRetinalSimilarity measureTree (graph theory)chemistry.chemical_compoundchemistrySegmentationComputer visionArtificial intelligencebusinessProceedings of the 26th IEEE International Symposium on Computer-Based Medical Systems
researchProduct

Le forme del fritto

2018

La frittura è una modalità di trasformazione dei cibi specifica, spesso trascurata, non inclusa nel celebre triangolo culinario di Lévi-Strauss (Antropologia Strutturale, 1958). Brillat-Savarin elaborò nella Fisiologia del Gusto una sua ‘teoria della frittura’, mentre Bastide (1987, cfr. Marrone, Semiotica del gusto, 2016) oppose la frittura alla bollitura, mostrando come – al di là dell’apparente similarità per l’immersione dei cibi in un liquido – le categorie in gioco nei due processi di cottura siano inverse. Barthes (vd. la voce ‘frites’ in Marrone 2016, Roland Barthes: parole chiave) in un suo celebre articolo contenuto in Miti d’oggi eleva le frites a simbolo nazionale francese. Nell…

Semiotica del gusto percezione cibo di strada street food Palermo
researchProduct

Phylogenetic relationship of ubiquitin repeats in the polyubiquitin gene from the marine sponge Geodia cydonium

1994

Ubiquitin is a 76-residue protein which is highly conserved among eukaryotes. Sponge (Porifera) ubiquitin, isolated from Geodia cydonium, is encoded by a gene (termed GCUBI) with six repeats, GCUBI-1 to GCUBI-6. All repeat units encode the same protein (with one exception: GCUBI-4 encodes ubiquitin with a change of Leu to Val at position 71). On the nt level the sequences of the six repeats differ considerably. All changes (except in GCUBI-4) are silent substitutions, which do not affect the protein structure. However, there is one major difference between the repeats: Codons from both codon families (TCN and AGPy) are simultaneously used for the serine at position 65. Using this characteri…

Sequence analysisMolecular Sequence Datamedicine.disease_causeUbiquitinPhylogeneticsGene duplicationGeneticsmedicineAnimalsGeodiaAmino Acid SequenceUbiquitinsMolecular BiologyGenePhylogenyEcology Evolution Behavior and SystematicsRepetitive Sequences Nucleic AcidGeneticsMutationBase SequencebiologyPhylogenetic treeDNASequence Analysis DNAbiology.organism_classificationBiological EvolutionPoriferaMutationbiology.proteinJournal of Molecular Evolution
researchProduct

Space of signatures as inverse limits of Carnot groups

2021

We formalize the notion of limit of an inverse system of metric spaces with 1-Lipschitz projections having unbounded fibers. The construction is applied to the sequence of free Carnot groups of fixed rank n and increasing step. In this case, the limit space is in correspondence with the space of signatures of rectifiable paths in ℝn, as introduced by Chen. Hambly-Lyons’s result on the uniqueness of signature implies that this space is a geodesic metric tree. As a particular consequence we deduce that every path in ℝn can be approximated by projections of some geodesics in some Carnot group of rank n, giving an evidence that the complexity of sub-Riemannian geodesics increases with the step.

SequencePure mathematicsControl and OptimizationRank (linear algebra)Geodesic010102 general mathematicsCarnot groupSpace (mathematics)01 natural sciencesComputational Mathematicssymbols.namesakeMetric spaceControl and Systems Engineering0103 physical sciencessymbolsMetric tree010307 mathematical physics0101 mathematicsCarnot cycleMathematicsESAIM: Control, Optimisation and Calculus of Variations
researchProduct

Deep learning for agricultural land use classification from Sentinel-2

2020

[ES] En el campo de la teledetección se ha producido recientemente un incremento del uso de técnicas de aprendizaje profundo (deep learning). Estos algoritmos se utilizan con éxito principalmente en la estimación de parámetros y en la clasificación de imágenes. Sin embargo, se han realizado pocos esfuerzos encaminados a su comprensión, lo que lleva a ejecutarlos como si fueran “cajas negras”. Este trabajo pretende evaluar el rendimiento y acercarnos al entendimiento de un algoritmo de aprendizaje profundo, basado en una red recurrente bidireccional de memoria corta a largo plazo (2-BiLSTM), a través de un ejemplo de clasificación de usos de suelo agrícola de la Comunidad Valenciana dentro d…

Series temporalesTime series010504 meteorology & atmospheric sciencesComputer scienceRemote sensing applicationGeography Planning and Development0211 other engineering and technologiesDecision treelcsh:G1-92202 engineering and technologyClasificaciónMachine learningcomputer.software_genre01 natural sciencesBiLSTMClassifier (linguistics)Earth and Planetary Sciences (miscellaneous)Spatial analysis021101 geological & geomatics engineering0105 earth and related environmental sciencesArtificial neural networkbusiness.industryDeep learningDeep learningClassificationRandom forestSupport vector machineArtificial intelligenceSentinel-2businesscomputerlcsh:Geography (General)
researchProduct

G2 rotavirus infections in an infantile population of the South of Italy: variability of viral strains over time.

2005

Rotavirus positive samples collected in Palermo, Italy, during 2002–2004 did not react with the G2 type-specific RV5:3 monoclonal antibodies (MAbs) and could be identified as G2 only by RT-PCR genotyping. The genetic variation of VP7 and VP4 antigenic proteins was studied in 14 G2 samples including a selection of both those successfully characterized by serotyping and those failing to be serotyped. The phylogenetic analysis performed on partial VP7 sequences showed a temporal clustering of these strains, with those isolated in Palermo in 2003 belonging to the same lineage of G2 MAbs-unreactive strains identified in UK in 1996–1997 and in Bari, Italy, in 2003–2004. A single amino acid substi…

SerotypeRotavirusSettore MED/07 - Microbiologia E Microbiologia ClinicaTime FactorsSettore MED/17 - Malattie InfettivevirusesPopulationReoviridaemedicine.disease_causeVirusRotavirus InfectionsFecesfluids and secretionsVirologyRotavirusGenetic variationmedicineHumansSerotypingeducationGenotypingAntigens ViralPhylogenyGeneticsrotavirus G2 genetic variation phylogenetic analysiseducation.field_of_studybiologyPhylogenetic treeInfant Newbornvirus diseasesInfantbiology.organism_classificationVirologyInfectious DiseasesItalyChild PreschoolCapsid ProteinsJournal of medical virology
researchProduct

Datamining: Pemanfaatan Algoritma Apriori dalam Menganalisa Pola-Pola Transaksi yang Terjadi

2012

This paper will be described about implementation and analysis of the well-known apriori algorithm, which is called Market Basket Analysis (MBA) in data mining. This algorithm is widely used to predict the relation among market basket in the huge amount of database. This algorithm is based on the concept of a prefix tree. There are several ways to organize the nodes of such a tree, to encode the items, and to organize the transactions, which may be used in order to minimize the time needed to find the frequent itemsets as well as to reduce the amount of memory needed to store the counters. The rules produced will be used by management of supermarket to organize the items set to increase the…

Set (abstract data type)Apriori algorithmTree (data structure)Relation (database)Order (exchange)Computer scienceMarket basketTrieInformationSystems_DATABASEMANAGEMENTAffinity analysisData miningcomputer.software_genrecomputerJurnal Natural
researchProduct