Graph edit distance from spectral seriation

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this, we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as a maximum a posteriori probability (MAP) alignment of the seriation sequences for pairs of graphs. This treatment leads to an expression in which the edit cost is the negative logarithm of the a posteriori sequence alignment probability. We compute the edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. The edit costs are determined by the components of the leading eigenvectors of the adjacency matrix and by the edge densities of the graphs being matched. We demonstrate the utility of the edit distance on a number of graph clustering problems

Pattern vectors from algebraic graph theory

Graphstructures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper, we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian. To embed the graphs in a pattern space, we explore whether the vectors of invariants can be embedded in a low- dimensional space using a number of alternative strategies, including principal components analysis ( PCA), multidimensional scaling ( MDS), and locality preserving projection ( LPP). Experimentally, we demonstrate that the embeddings result in well- defined graph clusters. Our experiments with the spectral representation involve both synthetic and real- world data. The experiments with synthetic data demonstrate that the distances between spectral feature vectors can be used to discriminate between graphs on the basis of their structure. The real- world experiments show that the method can be used to locate clusters of graphs

Port choice by intra-regional container service operators : an application of decision-making techniques to liner services between Malaysian and other Asian ports

Intra-regional container service operators are challenged to design regular and reliable liner services connecting regional ports at the lowest cost and shortest transit time while considering customer demand. This paper focuses on the selection of ports of call in regular intra-regional container services, an under-researched part of the container shipping market. A combination of decision-making techniques (i.e. Analytical Hierarchy Process, fuzzy link-based and Evidential Reasoning) are presented to assist intra-regional container service operators in selecting ports of call. The proposed methodology is empirically applied to container services between Malaysian and other nearby Asian ports. While Port Klang is the main gateway to Malaysia, the results show that other Malaysian ports should play a more prominent role in accommodating intra-Asian container services. This research can assist maritime stakeholders in evaluating intra-regional port-to-port liner service configurations. Furthermore, the novel mix of decision-making techniques complements and enriches existing academic literature on port choice and liner service configuration

Higher-order Projected Power Iterations for Scalable Multi-Matching

The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-matching problem is difficult. It can be phrased as simultaneously solving multiple (NP-hard) quadratic assignment problems (QAPs) that are coupled via cycle-consistency constraints. The main limitations of existing multi-matching methods are that they either ignore geometric consistency and thus have limited robustness, or they are restricted to small-scale problems due to their (relatively) high computational cost. We address these shortcomings by introducing a Higher-order Projected Power Iteration method, which is (i) efficient and scales to tens of thousands of points, (ii) straightforward to implement, (iii) able to incorporate geometric consistency, (iv) guarantees cycle-consistent multi-matchings, and (iv) comes with theoretical convergence guarantees. Experimentally we show that our approach is superior to existing methods

Spatial transformations of diffusion tensor magnetic resonance images

The authors address the problem of applying spatial transformations (or “image warps”) to diffusion tensor magnetic resonance images. The orientational information that these images contain must be handled appropriately when they are transformed spatially during image registration. The authors present solutions for global transformations of three-dimensional images up to 12-parameter affine complexity and indicate how their methods can be extended for higher order transformations. Several approaches are presented and tested using synthetic data. One method, the preservation of principal direction algorithm, which takes into account shearing, stretching and rigid rotation, is shown to be the most effective. Additional registration experiments are performed on human brain data obtained from a single subject, whose head was imaged in three different orientations within the scanner. All of the authors' methods improve the consistency between registered and target images over naive warping algorithms

Instability waves in a subsonic round jet detected using a near-field phased microphone array

We propose a diagnostic technique to detect instability waves in a subsonic round jet using a phased microphone array. The detection algorithm is analogous to the beam-forming technique, which is typically used with a far-field microphone array to localize noise sources. By replacing the reference solutions used in the conventional beam-forming with eigenfunctions from linear stability analysis, the amplitudes of instability waves in the axisymmetric and first two azimuthal modes are inferred. Experimental measurements with particle image velocimetry and a database from direct numerical simulation are incorporated to design a conical array that is placed just outside the mixing layer near the nozzle exit. The proposed diagnostic technique is tested in experiments by checking for consistency of the radial decay, streamwise evolution and phase correlation of hydrodynamic pressure. The results demonstrate that in a statistical sense, the pressure field is consistent with instability waves evolving in the turbulent mean flow from the nozzle exit to the end of the potential core, particularly near the most amplified frequency of each azimuthal mode. We apply this technique to study the effects of jet Mach number and temperature ratio on the azimuthal mode balance and evolution of instability waves. We also compare the results from the beam-forming algorithm with the proper orthogonal decomposition and discuss some implications for jet noise

Efficient Deformable Shape Correspondence via Kernel Matching

We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior on the mapping, and propose a projected descent optimization procedure inspired by difference of convex functions (DC) programming. Surprisingly, in spite of the highly non-convex nature of the resulting quadratic assignment problem, our method converges to a semantically meaningful and continuous mapping in most of our experiments, and scales well. We provide preliminary theoretical analysis and several interpretations of the method.Comment: Accepted for oral presentation at 3DV 2017, including supplementary materia