Search results for "Tree"

showing 10 items of 1841 documents

Region-based segmentation on depth images from a 3D reference surface for tree species recognition.

2013

International audience; The aim of the work presented in this paper is to develop a method for the automatic identification of tree species using Terrestrial Light Detection and Ranging (T-LiDAR) data. The approach that we propose analyses depth images built from 3D point clouds corresponding to a 30 cm segment of the tree trunk in order to extract characteristic shape features used for classifying the different tree species using the Random Forest classifier. We will present the method used to transform the 3D point cloud to a depth image and the region based segmentation method used to segment the depth images before shape features are computed on the segmented images. Our approach has be…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingComputer science[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingFeature extractionPoint cloudComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-space segmentation[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing02 engineering and technology[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV][INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Minimum spanning tree-based segmentation[STAT.AP] Statistics [stat]/Applications [stat.AP][INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing[ INFO.INFO-TI ] Computer Science [cs]/Image Processing0202 electrical engineering electronic engineering information engineeringSegmentationComputer vision[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing[STAT.AP]Statistics [stat]/Applications [stat.AP]Contextual image classificationbusiness.industry[ STAT.AP ] Statistics [stat]/Applications [stat.AP][INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineeringPattern recognitionImage segmentation15. Life on landdepth image segmentationRandom forestdepth images from 3D point cloudsIEEE[INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV][INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]020201 artificial intelligence & image processingsingle tree species recognitionArtificial intelligenceRange segmentationbusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingForest inventory
researchProduct

Detection and matching of curvilinear structures

2011

We propose an approach to curvilinear and wiry object detection and matching based on a new curvilinear region detector (CRD) and a shape context-like descriptor (COH). Standard methods for local patch detection and description are not directly applicable to wiry objects and curvilinear structures, such as roads, railroads and rivers in satellite and aerial images, vessels and veins in medical images, cables, poles and fences in urban scenes, stems and tree branches in natural images, since they assume the object is compact, i.e. that most elliptical patches around features cover only the object. However, wiry objects often have no flat parts and most neighborhoods include both foreground a…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingMatching (graph theory)Computer science[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing02 engineering and technology01 natural sciences010309 optics[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingArtificial Intelligence0103 physical sciences0202 electrical engineering electronic engineering information engineeringSegmentationComputer visionComputingMilieux_MISCELLANEOUSCurvilinear coordinatesbusiness.industryObject (computer science)Object detectionTree (data structure)Signal ProcessingPattern recognition (psychology)020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligenceScale (map)business[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingSoftware
researchProduct

A new minimum trees-based approach for shape matching with improved time computing : application to graphical symbols recognition

2010

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longe…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingMatching (graph theory)[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputer scienceFeature extractionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingMinimum spanning tree[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingActive shape model0202 electrical engineering electronic engineering information engineeringDiscrete cosine transformComputingMilieux_MISCELLANEOUS[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingSpanning treebusiness.industry020206 networking & telecommunicationsPattern recognitionGraphShortest path problemGraph (abstract data type)020201 artificial intelligence & image processingArtificial intelligencebusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingImage compression
researchProduct

Visualizing linguistic variation in a network of Latin documents and scribes

2018

This article explores whether and how network visualization can benefit philological and historical-linguistic study. This is illustrated with a corpus-based investigation of scribes' language use in a lemmatized and morphologically annotated corpus of documentary Latin (Late Latin Charter Treebank, LLCT2). We extract four continuous linguistic variables from LLCT2 and utilize a gradient colour palette in Gephi to visualize the variable values as node attributes in a trimodal network which consists of the documents, writers, and writing locations underlying the same corpus. We call this network the "LLCT2 network". The geographical coordinates of the location nodes form an approximate map, …

[ SHS.HIST ] Humanities and Social Sciences/HistoryComputer sciencemedia_common.quotation_subjectlatin linguisticsTreebank[shs.hist] humanities and social sciences/history01 natural sciences050105 experimental psychologyArgumentation theory[shs.langue] humanities and social sciences/linguistics[shs.class] humanities and social sciences/classical studiesGraph drawing0103 physical sciencesNode (computer science)lcsh:AZ20-9990501 psychology and cognitive sciences[shs.stat] humanities and social sciences/methods and statistics[SHS.LANGUE]Humanities and Social Sciences/Linguistics010306 general physics[SHS.CLASS]Humanities and Social Sciences/Classical studies[ SHS.STAT ] Humanities and Social Sciences/Methods and statisticsmedia_commonCreative visualization[SHS.STAT]Humanities and Social Sciences/Methods and statisticsearly middle ages05 social sciencesphilologynetwork visualizationlcsh:History of scholarship and learning. The humanitiesLinguisticslcsh:ZLinguistic competencelcsh:Bibliography. Library science. Information resourcesVariable (computer science)Variation (linguistics)[ SHS.CLASS ] Humanities and Social Sciences/Classical studies[ SHS.LANGUE ] Humanities and Social Sciences/Linguistics[SHS.HIST]Humanities and Social Sciences/History
researchProduct

Topological properties of cellular automata on trees

2012

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata Theory0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Complexity (cs.CC)Topology01 natural scienceslcsh:QA75.5-76.95[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]0101 mathematicsF.1.1;F.1.2;F.1.3MathematicsCellular Automata and Lattice Gases (nlin.CG)lcsh:Mathematics010102 general mathematicsCellular automaton tree shift expansivity permutivity right-closingness opennesslcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonComputer Science - Computational Complexity010201 computation theory & mathematicsTree (set theory)lcsh:Electronic computers. Computer scienceF.1.2F.1.3ExpansiveNonlinear Sciences - Cellular Automata and Lattice GasesF.1.1Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

ECO-generation for some restricted classes of compositions

2013

International audience; We study several restricted classes of compositions by giving one-to-one maps between them and different classes of restricted binary strings or pattern avoiding permutations. Inspired by the ECO method, new succession rules for these classes are presented. Finally, we obtain generating algorithms in Constant Amortized Time (CAT) for theses classes.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]succession ruleComposition of an integerECO method[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]lcsh:Electronic computers. Computer science[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]generating treepattern avoiding permutationlcsh:QA75.5-76.95
researchProduct

MODERATE DEVIATION PRINCIPLES FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS

2021

Bitseki and Delmas (2021) have studied recently the central limit theorem for kernel estimator of invariant density in bifurcating Markov chains models. We complete their work by proving a moderate deviation principle for this estimator. Unlike the work of Bitseki and Gorgui (2021), it is interesting to see that the distinction of the two regimes disappears and that we are able to get moderate deviation principle for large values of the ergodic rate. It is also interesting and surprising to see that for moderate deviation principle, the ergodic rate begins to have an impact on the choice of the bandwidth for values smaller than in the context of central limit theorem studied by Bitseki and …

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]60J80[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Bifurcating Markov chains[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]binary trees[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 62G0560F10
researchProduct

CENTRAL LIMIT THEOREM FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS

2021

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. Motivated by the functional estimation of the density of the invariant probability measure which appears as the asymptotic distribution of the trait, we prove the consistence and the Gaussian fluctuations for a kernel estimator of this density based on late generations. In this setting, it is interesting to note that the distinction of the three regimes on the ergodic rate identified in a previous work (for fluctuations of average over large generations) disappears. This result is a first step to go beyond the thresh…

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]fluctuations for tree indexed Markov chain60J8060J05[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Bifurcating Markov chains60F05binary trees[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 62G05
researchProduct

CENTRAL LIMIT THEOREM FOR BIFURCATING MARKOV CHAINS

2020

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We first provide a central limit theorem for general additive functionals of BMC, and prove the existence of three regimes. This corresponds to a competition between the reproducing rate (each individual has two children) and the ergodicity rate for the evolution of the trait. This is in contrast with the work of Guyon (2007), where the considered additive functionals are sums of martingale increments, and only one regime appears. Our first result can be seen as a discrete time version, but with general trait evoluti…

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]fluctuations for tree indexed Markov chain60J80[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Bifurcating Markov chains60F05binary trees62G05[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 60J05
researchProduct

Impact of many-body correlations on the dynamics of an ion-controlled bosonic Josephson junction

2016

We investigate an atomic ensemble of interacting bosons trapped in a symmetric double well potential in contact with a single tightly trapped ion which has been recently proposed [R. Gerritsma et al., Phys. Rev. Lett. 109, 080402 (2012)] as a source of entanglement between a Bose-Einstein condensate and an ion. Compared to the previous study, the present work aims at performing a detailed and accurate many-body analysis of such combined atomic quantum system by means of the ab-initio multi-configuration time-dependent Hartree method for bosons, which allows to take into account all correlations in the system. The analysis elucidates the importance of quantum correlations in the bosonic ense…

[PHYS]Physics [physics]Condensed Matter::Quantum GasesJosephson effectPhysicsQuantum PhysicsAb initioFOS: Physical sciencesQuantum entanglementHartree01 natural sciences010305 fluids & plasmasIonMCTDHQuantum Gases (cond-mat.quant-gas)Quantum mechanics0103 physical sciencesQuantum system[CHIM]Chemical SciencesQuantum Physics (quant-ph)Condensed Matter - Quantum Gases010306 general physicsQuantumBosonPhysical Review A. General Physics
researchProduct