Improved bounds for subband-adaptive iterative shrinkage/thresholding algorithms.

This paper presents new methods for computing the step sizes of the subband-adaptive iterative shrinkage-thresholding algorithms proposed by Bayram & Selesnick and Vonesch & Unser. The method yields tighter wavelet-domain bounds of the system matrix, thus leading to improved convergence speeds. It is directly applicable to non-redundant wavelet bases, and we also adapt it for cases of redundant frames. It turns out that the simplest and most intuitive setting for the step sizes that ignores subband aliasing is often satisfactory in practice. We show that our methods can be used to advantage with reweighted least squares penalty functions as well as L1 penalties. We emphasize that the algorithms presented here are suitable for performing inverse filtering on very large datasets, including 3D data, since inversions are applied only to diagonal matrices and fast transforms are used to achieve all matrix-vector products.

The soft impact response of composite laminate beams

The quasi-static and dynamic responses of laminated beams of equal areal mass, made from monolithic CFRP and Ultra high molecular weight Polyethylene (UHMWPE), have been measured. The end-clamped beams were impacted at mid-span by metal foam projectiles to simulate localised blast loading. The effect of clamping geometry on the response was investigated by comparing the response of beams bolted into the supports with the response of beams whose ends were wrapped around the supports. The effect of laminate shear strength upon the static and dynamic responses was investigated by testing two grades of each of the CFRP and UHMWPE beams: (i) CFRP beams with a cured matrix and uncured matrix, and (ii) UHMWPE laminates with matrices of two different shear strengths. Quasi-static stretch-bend tests indicated that the load carrying capacity of the UHWMPE beams exceeds that of the CFRP beams, increases with diminishing shear strength of matrix, and increases when the ends are wrapped rather than through-bolted. The dynamic deformation mode of the beams is qualitatively different from that observed in the quasi-static stretch-bend tests. In the dynamic case, travelling hinges emanate from the impact location and propagate towards the supports; the beams finally fail by tensile fibre fracture at the supports. The UHMWPE beams outperform the CFRP beams in terms of a lower mid-span deflection for a given impulse, and a higher failure impulse. Also, the maximum attainable impulse increases with decreasing shear strength for both the UHMWPE and CFRP beams. The ranking of the beams for load carrying capacity in the quasi-static stretch-bend tests is identical to that for failure impulse in the impact tests. Thus, the static tests can be used to gauge the relative dynamic performances of the beams. © 2013 Elsevier Ltd. All rights reserved.

The effect of shear strength on the ballistic response of laminated composite plates

The ballistic performance of clamped circular carbon fibre reinforced polymer (CFRP) and Ultra High Molecular Weight Polyethylene (UHMWPE) fibre composite plates of equal areal mass and 0/90 lay-up were measured and compared with that of monolithic 304 stainless steel plates. The effect of matrix shear strength upon the dynamic response was explored by testing: (i) CFRP plates with both a cured and uncured matrix and (ii) UHMWPE laminates with identical fibres but with two matrices of different shear strength. The response of these plates when subjected to mid-span, normal impact by a steel ball was measured via a dynamic high speed shadow moiré technique. Travelling hinges emanate from the impact location and travel towards the supports. The anisotropic nature of the composite plate results in the hinges travelling fastest along the fibre directions and this results in square-shaped moiré fringes in the 0/90 plates. Projectile penetration of the UHMWPE and the uncured CFRP plates occurs in a progressive manner, such that the number of failed plies increases with increasing velocity. The cured CFRP plate, of high matrix shear strength, fails by cone-crack formation at low velocities, and at higher velocities by a combination of cone-crack formation and communition of plies beneath the projectile. On an equal areal mass basis, the low shear strength UHMWPE plate has the highest ballistic limit followed by the high matrix shear strength UHMWPE plate, the uncured CFRP, the steel plate and finally the cured CFRP plate. We demonstrate that the high shear strength UHMWPE plate exhibits Cunniff-type ballistic limit scaling. However, the observed Cunniff velocity is significantly lower than that estimated from the laminate properties. The data presented here reveals that the Cunniff velocity is limited in its ability to characterise the ballistic performance of fibre composite plates as this velocity is independent of the shear properties of the composites: the ballistic limit of fibre composite plates increases with decreasing matrix shear strength for both CFRP and UHMWPE plates. © 2013 Elsevier Masson SAS. All rights reserved.

Contraction and observer design on cones

We consider the problem of positive observer design for positive systems defined on solid cones in Banach spaces. The design is based on the Hilbert metric and convergence properties are analyzed in the light of the Birkhoff theorem. Two main applications are discussed: positive observers for systems defined in the positive orthant, and positive observers on the cone of positive semi-definite matrices with a view on quantum systems. © 2011 IEEE.

Low-rank optimization for distance matrix completion

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.

Linear regression under fixed-rank constraints: A Riemannian approach

In this paper, we tackle the problem of learning a linear regression model whose parameter is a fixed-rank matrix. We study the Riemannian manifold geometry of the set of fixed-rank matrices and develop efficient line-search algorithms. The proposed algorithms have many applications, scale to high-dimensional problems, enjoy local convergence properties and confer a geometric basis to recent contributions on learning fixed-rank matrices. Numerical experiments on benchmarks suggest that the proposed algorithms compete with the state-of-the-art, and that manifold optimization offers a versatile framework for the design of rank-constrained machine learning algorithms. Copyright 2011 by the author(s)/owner(s).

Consensus in non-commutative spaces

Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of the Hilbert metric for any positive homogeneous monotone map, provides an early yet general convergence result for consensus algorithms. Because Birkhoff theorem holds in arbitrary cones, we extend consensus algorithms to the cone of positive definite matrices. The proposed generalization finds applications in the convergence analysis of quantum stochastic maps, which are a generalization of stochastic maps to non-commutative probability spaces. ©2010 IEEE.

From subspace learning to distance learning: A geometrical optimization approach

In this paper, we adopt a differential-geometry viewpoint to tackle the problem of learning a distance online. As this problem can be cast into the estimation of a fixed-rank positive semidefinite (PSD) matrix, we develop algorithms that exploits the rich geometry structure of the set of fixed-rank PSD matrices. We propose a method which separately updates the subspace of the matrix and its projection onto that subspace. A proper weighting of the two iterations enables to continuously interpolate between the problem of learning a subspace and learning a distance when the subspace is fixed. © 2009 IEEE.

A PDE viewpoint on basic properties of coordination algorithms with symmetries

Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with respect to a uniform translation of all subsystem values. The present paper shows that in presence of such symmetry, fundamental properties can be highlighted by viewing the distributed system as the discrete approximation of a partial differential equation. An important fact is that the symmetry on the state space differs from the popular spatial invariance property, which is not necessary for the present results. The relevance of the viewpoint is illustrated on two examples: (i) ill-conditioning of interaction matrices in coordination/consensus problems and (ii) the string instability issue. ©2009 IEEE.

Stabilization of symmetric formations to motion around convex loops

We provide a cooperative control algorithm to stabilize symmetric formations to motion around closed curves suitable for mobile sensor networks. This work extends previous results for stabilization of symmetric circular formations. We study a planar particle model with decentralized steering control subject to limited communication. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. We illustrate the result for a skewed superellipse, which is a type of curve that includes circles, ellipses, and rounded parallelograms. © 2007 Elsevier B.V. All rights reserved.

Collective motion of self-propelled particles: Stabilizing symmetric formations on closed curves

We provide feedback control laws to stabilize formations of multiple, unit speed particles on smooth, convex, and closed curves with definite curvature. As in previous work we exploit an analogy with coupled phase oscillators to provide controls which isolate symmetric particle formations that are invariant to rigid translation of all the particles. In this work, we do not require all particles to be able to communicate; rather we assume that inter-particle communication is limited and can be modeled by a fixed, connected, and undirected graph. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. The methodology is demonstrated using a superellipse, which is a type of curve that includes circles, ellipses, and rounded rectangles. These results can be used in applications involving multiple autonomous vehicles that travel at constant speed around fixed beacons. ©2006 IEEE.

Riemannian geometry of Grassmann manifolds with a view on algorithmic computation

We give simple formulas for the canonical metric, gradient, Lie derivative, Riemannian connection, parallel translation, geodesics and distance on the Grassmann manifold of p-planes in ℝn. In these formulas, p-planes are represented as the column space of n × p matrices. The Newton method on abstract Riemannian manifolds proposed by Smith is made explicit on the Grassmann manifold. Two applications - computing an invariant subspace of a matrix and the mean of subspaces - are worked out.

Designing climate change mitigation plans that add up.

Mitigation plans to combat climate change depend on the combined implementation of many abatement options, but the options interact. Published anthropogenic emissions inventories are disaggregated by gas, sector, country, or final energy form. This allows the assessment of novel energy supply options, but is insufficient for understanding how options for efficiency and demand reduction interact. A consistent framework for understanding the drivers of emissions is therefore developed, with a set of seven complete inventories reflecting all technical options for mitigation connected through lossless allocation matrices. The required data set is compiled and calculated from a wide range of industry, government, and academic reports. The framework is used to create a global Sankey diagram to relate human demand for services to anthropogenic emissions. The application of this framework is demonstrated through a prediction of per-capita emissions based on service demand in different countries, and through an example showing how the "technical potentials" of a set of separate mitigation options should be combined.

Warping trajectories for video synchronization

Temporal synchronization of multiple video recordings of the same dynamic event is a critical task in many computer vision applications e.g. novel view synthesis and 3D reconstruction. Typically this information is implied, since recordings are made using the same timebase, or time-stamp information is embedded in the video streams. Recordings using consumer grade equipment do not contain this information; hence, there is a need to temporally synchronize signals using the visual information itself. Previous work in this area has either assumed good quality data with relatively simple dynamic content or the availability of precise camera geometry. In this paper, we propose a technique which exploits feature trajectories across views in a novel way, and specifically targets the kind of complex content found in consumer generated sports recordings, without assuming precise knowledge of fundamental matrices or homographies. Our method automatically selects the moving feature points in the two unsynchronized videos whose 2D trajectories can be best related, thereby helping to infer the synchronization index. We evaluate performance using a number of real recordings and show that synchronization can be achieved to within 1 sec, which is better than previous approaches. Copyright 2013 ACM.

What is the weakest topology in which feedback stability is robust?

Mathematical theorems in control theory are only of interest in so far as their assumptions relate to practical situations. The space of systems with transfer functions in ℋ∞, for example, has many advantages mathematically, but includes large classes of non-physical systems, and one must be careful in drawing inferences from results in that setting. Similarly, the graph topology has long been known to be the weakest, or coarsest, topology in which (1) feedback stability is a robust property (i.e. preserved in small neighbourhoods) and (2) the map from open-to-closed-loop transfer functions is continuous. However, it is not known whether continuity is a necessary part of this statement, or only required for the existing proofs. It is entirely possible that the answer depends on the underlying classes of systems used. The class of systems we concern ourselves with here is the set of systems that can be approximated, in the graph topology, by real rational transfer function matrices. That is, lumped parameter models, or those distributed systems for which it makes sense to use finite element methods. This is precisely the set of systems that have continuous frequency responses in the extended complex plane. For this class, we show that there is indeed a weaker topology; in which feedback stability is robust but for which the maps from open-to-closed-loop transfer functions are not necessarily continuous. © 2013 Copyright Taylor and Francis Group, LLC.