Search results for "minimum spanning tree"
showing 10 items of 34 documents
Hybrid Procedure for Automated Detection of Cracking with 3D Pavement Data
2016
Pavement cracks are considered a major indicator of pavement performance. Because traditional manual crack surveys are dangerous, time consuming, and expensive, technologies have been developed to collect high-speed pavement images, and numerous algorithms have been proposed to detect cracks on pavement surface. The latest PaveVision3D Ultra system (3D Ultra) has been implemented to achieve 30-kHz three-dimensional (3D) scanning rate for 1-mm resolution pavement surface data at highway speed up to 100 km/h (60 mi/h). This paper presents the application of a hybrid procedure for automated crack detection on 3D pavement data collected using 3D Ultra. The procedure combines three different me…
Bootstrap validation of links of a minimum spanning tree
2018
We describe two different bootstrap methods applied to the detection of a minimum spanning tree obtained from a set of multivariate variables. We show that two different bootstrap procedures provide partly distinct information that can be highly informative about the investigated complex system. Our case study, based on the investigation of daily returns of a portfolio of stocks traded in the US equity markets, shows the degree of robustness and completeness of the information extracted with popular information filtering methods such as the minimum spanning tree and the planar maximally filtered graph. The first method performs a "row bootstrap" whereas the second method performs a "pair bo…
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
2017
International audience; The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by dening (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determining if there exist two (i, j)-disjoint spanning trees in a graph G is NP-comple…
A genetic algorithm for image segmentation
2002
The paper describes a new algorithm for image segmentation. It is based on a genetic approach that allow us to consider the segmentation problem as a global optimization problem (GOP). For this purpose, a fitness function, based on the similarity between images, has been defined. The similarity is a function of both the intensity and the spatial position of pixels. Preliminary results, obtained using real images, show a good performance of the segmentation algorithm.
A new minimum spanning tree-based method for shape description and matching working in Discrete Cosine space
2009
In this article, a new minimum spanning tree-based method for shape description and matching is proposed. Its properties are checked through the problem of graphical symbols recognition. Recognition invariance in front shift and multi-oriented noisy objects was studied in the context of small and low resolution binary images. The approach seems to have many desirable properties, even if the construction of graphs induces an expensive algorithmic cost. In order to reduce time computing, an alternative solution based on image compression concepts is provided. The recognition is realized in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discuss…
On the Bias and Performance of the Edge-Set Encoding
2009
The edge-set encoding of trees directly represents trees as sets of their edges. Nonheuristic operators for edge-sets manipulate trees' edges without regard for their weights, while heuristic operators consider edges' weights when including or excluding them. In the latter case, the operators generally favor edges with lower weights, and they tend to generate trees that resemble minimum spanning trees. This bias is strong, which suggests that evolutionary algorithms (EAs) that employ heuristic operators will succeed when optimum solutions resemble minimum spanning trees (MSTs) but fail otherwise. The one-max tree problem is a scalable test problem for trees where the optimum solution can be…
On Optimal Solutions for the Optimal Communication Spanning Tree Problem
2009
This paper presents an experimental investigation into the properties of the optimal communication spanning tree (OCST) problem. The OCST problem seeks a spanning tree that connects all the nodes and satisfies their communication requirements at a minimum total cost. The paper compares the properties of random trees to the properties of the best solutions for the OCST problem that are found using an evolutionary algorithm. The results show, on average, that the optimal solution and the minimum spanning tree (MST) share a higher number of links than the optimal solution and a random tree. Furthermore, optimal solutions for OCST problems with randomly chosen distance weights share a higher n…
Statistical Multivariate Techniques for the Stock Location Assignment Problem
1998
In previous papers we proposed to apply multivariate statistical methodologies, like Multidimensional Scaling (MDS) and Seriation to the stock location assignment problem of a warehouse, often solved by considering the Cube per Order Index (COI). In this paper we compare the results by MDS, Seriation, a COI based method and the Maximum Path criterion, considering the data of a whole year of a Sicilian supermarket chain warehouse. The comparison is based on the simulated times to satisfy a sample of real orders.
A tool for filtering information in complex systems
2005
We introduce a technique to filter out complex data-sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation based graphs giving filtered graphs which preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0) triangular loops and 4 element cliques are formed. The application of this filtering procedure to 100 stocks in the USA equity markets shows that such loops and cliqu…
Spanning Trees and bootstrap reliability estimation in correlation based networks
2007
We introduce a new technique to associate a spanning tree to the average linkage cluster analysis. We term this tree as the Average Linkage Minimum Spanning Tree. We also introduce a technique to associate a value of reliability to links of correlation based graphs by using bootstrap replicas of data. Both techniques are applied to the portfolio of the 300 most capitalized stocks traded at New York Stock Exchange during the time period 2001-2003. We show that the Average Linkage Minimum Spanning Tree recognizes economic sectors and sub-sectors as communities in the network slightly better than the Minimum Spanning Tree does. We also show that the average reliability of links in the Minimum …