The most persistent soft-clique in a set of sampled graphs

When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques. We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations. Copyright 2012 by the author(s)/owner(s).

Analytical approximations for the modal acoustic impedances of simply supported, rectangular plates.

Coupling of the in vacuo modes of a fluid-loaded, vibrating structure by the resulting acoustic field, while known to be negligible for sufficiently light fluids, is still only partially understood. A particularly useful structural geometry for the study of this problem is the simply supported, rectangular flat plate, since it exhibits all the relevant physical features while still admitting an analytical description of the modes. Here the influence of the fluid can be expressed in terms of a set of doubly infinite integrals over wave number: the modal acoustic impedances. Closed-form solutions for these impedances do not exist and, while their numerical evaluation is possible, it greatly increases the computational cost of solving the coupled system of modal equations. There is thus a need for accurate analytical approximations. In this work, such approximations are sought in the limit where the modal wavelength is small in comparison with the acoustic wavelength and the plate dimensions. It is shown that contour integration techniques can be used to derive analytical formulas for this regime and that these formulas agree closely with the results of numerical evaluations. Previous approximations [Davies, J. Sound Vib. 15(1), 107-126 (1971)] are assessed in the light of the new results and are shown to give a satisfactory description of real impedance components, but (in general) erroneous expressions for imaginary parts.

Automated 3D Structure Inference of Civil Infrastructure Using a Stereo Camera Set

The commercial far-range (>10m) infrastructure spatial data collection methods are not completely automated. They need significant amount of manual post-processing work and in some cases, the equipment costs are significant. This paper presents a method that is the first step of a stereo videogrammetric framework and holds the promise to address these issues. Under this method, video streams are initially collected from a calibrated set of two video cameras. For each pair of simultaneous video frames, visual feature points are detected and their spatial coordinates are then computed. The result, in the form of a sparse 3D point cloud, is the basis for the next steps in the framework (i.e., camera motion estimation and dense 3D reconstruction). A set of data, collected from an ongoing infrastructure project, is used to show the merits of the method. Comparison with existing tools is also shown, to indicate the performance differences of the proposed method in the level of automation and the accuracy of results.