Shim design using a linear programming algorithm
✍ Scribed by Sharon E. Ungersma; Hao Xu; Blaine A. Chronik; Greig C. Scott; Al Macovski; Steven M. Conolly
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 471 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0740-3194
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The advent of open magnetic resonance imaging (MRI) scanners and dedicated MRI scanners tailored to specific body parts has led to an increasing number of noncylindrical MRI scanner geometries, for which noncylindrical gradients and shims are needed. These new scanner geometries are driving the need for fast, flexible shim design methods that can design shim coils for any geometry. A linear programming (LP) algorithm was developed to design minimum‐power resistive shim coils on an arbitrary surface. These coils can be designed to produce any order shim field over an arbitrarily shaped target region, which can be placed anywhere within the coil. The resulting designs are relatively sparse and can be readily constructed. This algorithm was used to design and construct a seven‐coil cylindrical shim set for a knee imaging magnet with a cylindrical homogeneous region. The algorithm was then used to design shim coils for a biradial head imager with an asymmetrically located spherical target region for brain imaging. Magn Reson Med 52:619–627, 2004. © 2004 Wiley‐Liss, Inc.
📜 SIMILAR VOLUMES
We introduce in this paper a new multiple-objective linear programming (MOLP) algorithm. The algorithm is based on the single-objective path-following primal-dual linear programming algorithm and combines it with aspiration levels and the use of achievement scalarizing functions. The resulting algor
## Abstract In many applications of filter banks, a low‐delay filter bank in which the system delay is small is desirable. In this paper, two new design methods are proposed for low‐delay perfect‐reconstruction filter banks. First, a design method is described for a two‐channel perfect‐reconstructi