Ultrasonic imaging of 3D displacement vectors using a simulated 2D array and beamsteering.

Most quasi-static ultrasound elastography methods image only the axial strain, derived from displacements measured in the direction of ultrasound propagation. In other directions, the beam lacks high resolution phase information and displacement estimation is therefore less precise. However, these estimates can be improved by steering the ultrasound beam through multiple angles and combining displacements measured along the different beam directions. Previously, beamsteering has only considered the 2D case to improve the lateral displacement estimates. In this paper, we extend this to 3D using a simulated 2D array to steer both laterally and elevationally in order to estimate the full 3D displacement vector over a volume. The method is tested on simulated and phantom data using a simulated 6-10MHz array, and the precision of displacement estimation is measured with and without beamsteering. In simulations, we found a statistically significant improvement in the precision of lateral and elevational displacement estimates: lateral precision 35.69μm unsteered, 3.70μm steered; elevational precision 38.67μm unsteered, 3.64μm steered. Similar results were found in the phantom data: lateral precision 26.51μm unsteered, 5.78μm steered; elevational precision 28.92μm unsteered, 11.87μm steered. We conclude that volumetric 3D beamsteering improves the precision of lateral and elevational displacement estimates.

Representations and algorithms for finite-state bisimulations of linear discrete-time control systems

While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.

Ultrasonic imaging of 3D displacement vectors using a simulated 2D array and beamsteering

Most quasi-static ultrasound elastography methods image only the axial strain, derived from displacements measured in the direction of ultrasound propagation. In other directions, the beam lacks high resolution phase information and displacement estimation is therefore less precise. However, these estimates can be improved by steering the ultrasound beam through multiple angles and combining displacements measured along the different beam directions. Previously, beamsteering has only considered the 2D case to improve the lateral displacement estimates. In this paper, we extend this to 3D using a simulated 2D array to steer both laterally and elevationally in order to estimate the full 3D displacement vector over a volume. The method is tested on simulated and phantom data using a simulated 6-10 MHz array, and the precision of displacement estimation is measured with and without beamsteering. In simulations, we found a statistically significant improvement in the precision of lateral and elevational displacement estimates: lateral precision 35.69 μm unsteered, 3.70 μm steered; elevational precision 38.67 μm unsteered, 3.64 μm steered. Similar results were found in the phantom data: lateral precision 26.51 μm unsteered, 5.78 μm steered; elevational precision 28.92 μm unsteered, 11.87 μm steered. We conclude that volumetric 3D beamsteering improves the precision of lateral and elevational displacement estimates. © 2012 Elsevier B.V. All rights reserved.

Distributed flow algorithms for scalable similarity visualization

We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.

Convex relaxation of mixture regression with efficient algorithms

We develop a convex relaxation of maximum a posteriori estimation of a mixture of regression models. Although our relaxation involves a semidefinite matrix variable, we reformulate the problem to eliminate the need for general semidefinite programming. In particular, we provide two reformulations that admit fast algorithms. The first is a max-min spectral reformulation exploiting quasi-Newton descent. The second is a min-min reformulation consisting of fast alternating steps of closed-form updates. We evaluate the methods against Expectation-Maximization in a real problem of motion segmentation from video data.