Search PubMed⌕ Search

Biomedical subjects

Ramin Zabih

Publications and source records attributed to Ramin Zabih.

7 recordsLinked to original sources

Bayesian parallel imaging with edge-preserving priors.

Existing parallel MRI methods are limited by a fundamental trade-off in that suppressing noise introduces aliasing artifacts. Bayesian methods with an appropriately chosen image prior offer a promising alternative; however, previous methods with spatial priors assume that intensities vary smoothly over the entire image, resulting in blurred edges. Here we introduce an edge-preserving prior (EPP) that instead assumes that intensities are piecewise smooth, and propose a new approach to efficiently compute its Bayesian estimate. The estimation task is formulated as an optimization problem that requires a nonconvex objective function to be minimized in a space with thousands of dimensions. As a result, traditional continuous minimization methods cannot be applied. This optimization task is closely related to some problems in the field of computer vision for which discrete optimization methods have been developed in the last few years. We adapt these algorithms, which are based on graph cuts, to address our optimization problem. The results of several parallel imaging experiments on brain and torso regions performed under challenging conditions with high acceleration factors are shown and compared with the results of conventional sensitivity encoding (SENSE) methods. An empirical analysis indicates that the proposed method visually improves overall quality compared to conventional methods.

Algorithms↗

Automatic algorithm for correcting motion artifacts in time-resolved two-dimensional magnetic resonance angiography using convex projections.

Time-resolved contrast enhanced magnetic resonance angiography (MRA) may suffer from involuntary patient motion. It is noted that while MR signal change associated with motion is large in magnitude and has smooth phase variation in k-phase, signal change associated with vascular enhancement is small in magnitude and has rapid phase variation in k-space. Based upon this observation, a novel projection onto convex sets (POCS) algorithm is developed as an automatic iterative method to remove motion artifacts. The presented POCS algorithm consists of high-pass phase filtering and convex projections in both k-space and image space. Without input of detailed motion knowledge, motion effects are filtered out, while vasculature information is preserved. The proposed method can be effective for a large class of nonrigid motions, including through-plane motion. The algorithm is stable and converges quickly, usually within five iterations. A double-blind evaluation on a set of clinical MRA cases shows that a completely unsupervised version of the algorithm produces significantly better rank scores (P=0.038) when compared to angiograms produced manually by an experienced radiologist.

Algorithms↗

Multiprocessor scheduling implementation of the simultaneous multiple volume (SMV) navigator method.

The simultaneous multiple volume (SMV) approach in navigator-gated MRI allows the use of the whole motion range or the entire scan time for the reconstruction of final images by simultaneously acquiring different image volumes at different motion states. The motion tolerance range for each volume is kept small, thus SMV substantially increases the scan efficiency of navigator methods while maintaining the effectiveness of motion suppression. This article reports a general implementation of the SMV approach using a multiprocessor scheduling algorithm. Each motion state is regarded as a processor and each volume is regarded as a job. An efficient scheduling that completes all jobs in minimal time is maintained even when the motion pattern changes. Initial experiments demonstrated that SMV significantly increased the scan efficiency of navigator-gated MRI.

Algorithms↗

What energy functions can be minimized via graph cuts?

In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a general-purpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.

Algorithms↗

Simultaneous multiple volume (SMV) acquisition algorithm for real-time navigator gating.

Navigator gating techniques can effectively reduce motion effects in MRI by accepting data only when the object is in a small range of positions at the cost of significantly prolonging scan time. A simultaneous multiple volume (SMV) algorithm is reported here that can substantially increase the scan efficiency while maintaining the effectiveness of motion suppression. This is achieved by acquiring different image volumes at different motion states. Initial experiments demonstrate that SMV can significantly increase the scan efficiency of navigator MRI.

Algorithms↗

Automatic selection of mask and arterial phase images for temporally resolved MR digital subtraction angiography.

For time-resolved background-subtracted contrast-enhanced magnetic resonance angiography, the bright and sparse arterial signal allows unique identification of contrast bolus arrival in the arteries. This article presents an automatic filtering algorithm using such arterial characterization for selecting arterial phase images and mask images to generate an optimal summary arteriogram. A paired double-blinded comparison demonstrated that this automatic algorithm is as effective as the manual process.

Adult↗

Postprocessing techniques for time-resolved contrast-enhanced MR angiography.

The purpose of this study was to improve dynamic two-dimensional projection magnetic resonance digital subtraction angiography by using remasking and filtering postprocessing techniques. Four methods were evaluated in 50 patients: default mask subtraction, remasked subtraction, filtering based on the SD, and linear filtering. The results demonstrated that postprocessing techniques such as linear filtering can reduce background motion artifacts and improve arterial contrast-to-noise ratio.

Adult↗