60,760 research outputs found
Methods of Hierarchical Clustering
We survey agglomerative hierarchical clustering algorithms and discuss
efficient implementations that are available in R and other software
environments. We look at hierarchical self-organizing maps, and mixture models.
We review grid-based clustering, focusing on hierarchical density-based
approaches. Finally we describe a recently developed very efficient (linear
time) hierarchical clustering algorithm, which can also be viewed as a
hierarchical grid-based algorithm.Comment: 21 pages, 2 figures, 1 table, 69 reference
Single-tree detection in high-density LiDAR data from UAV-based survey
UAV-based LiDAR survey provides very-high-density point clouds, which involve very rich information about forest detailed structure, allowing for detection of individual trees, as well as demanding high computational load. Single-tree detection is of great interest for forest management and ecology purposes, and the task is relatively well solved for forests made of single or largely dominant species, and trees having a very evident pointed shape in the upper part of the canopy (in particular conifers). Most authors proposed methods based totally or partially on search of local maxima in the canopy, which has poor performance for species that have flat or irregular upper canopy, and for mixed forests, especially where taller trees hide smaller ones. Such considerations apply in particular to Mediterranean hardwood forests. In such context, it is imperative to use the whole volume of the point cloud, however keeping computational load tractable. The authors propose the use of a methodology based on modelling the 3D-shape of the tree, which improves performance w.r.t to maxima-based models. A case study, performed on a hazel grove, is provided to document performance improvement on a relatively simple, but significant, case
FastJet user manual
FastJet is a C++ package that provides a broad range of jet finding and
analysis tools. It includes efficient native implementations of all widely used
2-to-1 sequential recombination jet algorithms for pp and e+e- collisions, as
well as access to 3rd party jet algorithms through a plugin mechanism,
including all currently used cone algorithms. FastJet also provides means to
facilitate the manipulation of jet substructure, including some common boosted
heavy-object taggers, as well as tools for estimation of pileup and
underlying-event noise levels, determination of jet areas and subtraction or
suppression of noise in jets.Comment: 69 pages. FastJet 3 is available from http://fastjet.fr
- …