We present the warp tracker, a new system for tracking features through a sequence of images. Employing an automated multi-resolution lattice deformation technique, the warp tracker performs fairly well on its own, and its hierarchical nature naturally lends itself to being integrated with other tracking algorithms for increased accuracy and robustness. Developed specifically for use in next-ge...

The Warp machine* is a high-performance systolic array computer with a linear array of 10 or more cells, each of which is a programmable processor capable of performing 10 million floating-point operations per second (10 MFLOPS). A 10-cell machine has a peak performance of 100 MFLOPS. Warp is integrated into a UNIXTM host system, and program development is supported by a compiler. Two copies of...

The Time Warp Operating System runs discrete event simulations in parallel using an optimistic synchronization method based on the theory of virtual time. It has had great success in extracting speedup from many simulations, and is now available for experimental use. The first half of this tutorial will discuss how to use the Time Warp Operating System to write and run discrete event simulation...

Assuming the magnetic hypothesis for the formation of warps, we deduce a very simple formula for the warp curve in an idealized scenario. According to this formula the warp rises as the third power of radius in the innermost warped region, reaches the maximum slope at intermediate radii and has an asymptotic slope coincident with the direction of the extragalactic magnetic field. In most cases,...

In non-rigid registration, the tradeoff between warp regularization and image fidelity is typically determined empirically. In atlas-based segmentation, this leads to a probabilistic atlas of arbitrary sharpness: weak regularization results in well-aligned training images and a sharp atlas; strong regularization yields a "blurry" atlas. In this paper, we employ a generative model for the joint ...