2D diffuse optical imaging using clustered sparsity

Diffuse optical imaging (DOI) is a non-invasive technique which measures hemodynamic changes in the tissue with near infrared light, and has been increasingly used to study brain functions. Due to the nature of light propagation in the tissue, the reconstruction problem is severely ill-posed. Sparsity-regularization has achieved promising results in recent works for linearized DOI problem. In this paper, we exploit more prior information to improve DOI besides sparsity. Based on the functional specialization of the brain, the in vivo absorption changes caused by specific brain function can be clustered in certain region(s) and not randomly distributed. Thus, a new algorithm is proposed to utilize this prior in reconstruction. Results of numerical simulations and phantom experiments have demonstrated the superiority of the proposed method over the state-of-the-art.

[1]  Jong Chul Ye,et al.  Exact reconstruction formula for diffuse optical tomography using simultaneous sparse representation , 2008, 2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[2]  Turgut Durduran,et al.  Compressed sensing in diffuse optical tomography. , 2010, Optics express.

[3]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[4]  Phaneendra K. Yalavarthy,et al.  Sparse Recovery Methods Hold Promise for Diffuse Optical Tomographic Image Reconstruction , 2014, IEEE Journal of Selected Topics in Quantum Electronics.

[5]  Richard Baraniuk,et al.  Recovery of Clustered Sparse Signals from Compressive Measurements , 2009 .

[6]  Junzhou Huang,et al.  Learning with structured sparsity , 2009, ICML '09.

[7]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[8]  Junzhou Huang,et al.  Fast multi-contrast MRI reconstruction. , 2014, Magnetic resonance imaging.

[9]  Arye Nehorai,et al.  Image reconstruction for diffuse optical tomography using sparsity regularization and expectation-maximization algorithm. , 2007, Optics express.

[10]  Dianne P. O'Leary,et al.  The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems , 1993, SIAM J. Sci. Comput..

[11]  Junzhou Huang,et al.  Composite splitting algorithms for convex optimization , 2011, Comput. Vis. Image Underst..

[12]  Junzhou Huang,et al.  Compressive Sensing MRI with Wavelet Tree Sparsity , 2012, NIPS.

[13]  Britta K. Hölzel,et al.  Differential engagement of anterior cingulate and adjacent medial frontal cortex in adept meditators and non-meditators , 2007, Neuroscience Letters.

[14]  Junzhou Huang,et al.  The benefit of tree sparsity in accelerated MRI , 2014, Medical Image Anal..

[15]  Hanli Liu,et al.  Development of a compensation algorithm for accurate depth localization in diffuse optical tomography. , 2010, Optics letters.

[16]  Junzhou Huang,et al.  Learning with dynamic group sparsity , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[17]  Ivan W. Selesnick,et al.  Translation-invariant shrinkage/thresholding of group sparse signals , 2013, Signal Process..

[18]  Hanli Liu,et al.  Optimization of probe geometry for diffuse optical brain imaging based on measurement density and distribution. , 2009, Applied optics.

[19]  Jean-Philippe Vert,et al.  Group lasso with overlap and graph lasso , 2009, ICML '09.