Tv/l1 Minimization for Hardi Data Denoising with Reduced Constraint

نویسندگان

  • Yunho Kim
  • Liang Zhan
  • Paul M. Thompson
  • Arthur W. Toga
  • Luminita A. Vese
چکیده

We denoise High Angular Resolution Diffusion Imaging (HARDI) data, a necessary step for reconstruction of fibers and pathways in the living brain. HARDI gives more accurate information than diffusion tensor imaging (DTI) and allows to reconstruct highly complex fiber architecture. Intensity data is given at all voxels and directions on the sphere. A tuning parameter b is used to collect the data. Although larger b values help to more accurately measure the water diffusion in the brain, more noise is generated as well. We directly denoise raw HARDI data and not the pre-processed orientation distribution functions (ODFs). We propose to minimize an energy composed of three terms: vectorial total variation, L data term, and a logarithmic barrier term to realize the constraints imposed by the image formation model. We present experimental results for denoising synthetic and real HARDI data. Using two measures of restoration accuracy, we can conclude that the proposed denoising model improves data quality. The algorithm is simple and relatively fast.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HARDI Denoising: Variational Regularization of the Spherical Apparent Diffusion Coefficient sADC

We denoise HARDI (High Angular Resolution Diffusion Imaging) data arising in medical imaging. Diffusion imaging is a relatively new and powerful method to measure the 3D profile of water diffusion at each point. This can be used to reconstruct fiber directions and pathways in the living brain, providing detailed maps of fiber integrity and connectivity. HARDI is a powerful new extension of diff...

متن کامل

A General Framework for a Class of First Order Primal-dual Algorithms for Tv Minimization

We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA CAM Report [08-34], May 2008], draw connections to similar methods and discuss convergence of several special cases and modifications. In particular, we point out a convergence result fo...

متن کامل

Dual Constrained TV-based Regularization on Graphs

Algorithms based on Total Variation (TV) minimization are prevalent in image processing. They play a key role in a variety of applications such as image denoising, compressive sensing and inverse problems in general. In this work, we extend the TV dual framework that includes Chambolle’s and Gilboa-Osher’s projection algorithms for TV minimization. We use a flexible graph data representation th...

متن کامل

A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science

We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA CAM Report [08-34], May 2008] to a broader class of convex optimization problems. In addition, we survey several closely related methods and explain the connections to PDHG. We point out...

متن کامل

Variational Image Denoising with Adaptive Constraint Sets

We propose a generalization of the total variation (TV) minimization method proposed by Rudin, Osher and Fatemi. This generalization allows for adaptive regularization, which depends on the minimizer itself. Existence theory is provided in the framework of quasi-variational inequalities. We demonstrate the usability of our approach by considering applications for image and movie denoising.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009