Fast multicomponent 3D-T1ρ relaxometry.

NMR relaxometry can provide information about the relaxation of the magnetization in different tissues, increasing our understanding of molecular dynamics and biochemical composition in biological systems. In general, tissues have complex and heterogeneous structures composed of multiple pools. As a result, bulk magnetization returns to its original state with different relaxation times, in a multicomponent relaxation. Recovering the distribution of relaxation times in each voxel is a difficult inverse problem; it is usually unstable and requires long acquisition time, especially on clinical scanners. MRI can also be viewed as an inverse problem, especially when compressed sensing (CS) is used. The solution of these two inverse problems, CS and relaxometry, can be obtained very efficiently in a synergistically combined manner, leading to a more stable multicomponent relaxometry obtained with short scan times. In this paper, we will discuss the details of this technique from the viewpoint of inverse problems.

Monotone FISTA with Variable Acceleration for Compressed Sensing Magnetic Resonance Imaging.

An improvement of the monotone fast iterative shrinkage-thresholding algorithm (MFISTA) for faster convergence is proposed. Our motivation is to reduce the reconstruction time of compressed sensing problems in magnetic resonance imaging. The proposed modification introduces an extra term, which is a multiple of the proximal-gradient step, into the so-called momentum formula used for the computation of the next iterate in MFISTA. In addition, the modified algorithm selects the next iterate as a possibly-improved point obtained by any other procedure, such as an arbitrary shift, a line search, or other methods. As an example, an arbitrary-length shift in the direction from the previous iterate to the output of the proximal-gradient step is considered. The resulting algorithm accelerates MFISTA in a manner that varies with the iterative steps. Convergence analysis shows that the proposed modification provides improved theoretical convergence bounds, and that it has more flexibility in its parameters than the original MFISTA. Since such problems need to be studied in the context of functions of several complex variables, a careful extension of FISTA-like methods to complex variables is provided.

A Backprojection Slice Theorem for Tomographic Reconstruction.

Fast image reconstruction techniques are becoming important with the increasing number of scientific cases in high resolution micro and nano tomography. The processing of the large scale 3D data demands new mathematical tools for the tomographic reconstruction. Due to the high computational complexity of most current algorithms, big data sizes demands powerful hardware and more sophisticated numerical techniques. Several reconstruction algorithms are dependent on a mathematical tool called backprojection (a transposition process). A conventional implementation of the backprojection operator has cubic computational complexity. In the present manuscript we propose a new fast backprojection operator for the processing of tomographic data, providing a low-cost algorithm for this task. We compare our formula against other fast transposition techniques, using real and simulated large data sets.

Accelerating Overrelaxed and Monotone Fast Iterative Shrinkage-Thresholding Algorithms With Line Search for Sparse Reconstructions.

Recently, specially crafted unidimensional optimization has been successfully used as line search to accelerate the overrelaxed and monotone fast iterative shrinkage-threshold algorithm (OMFISTA) for computed tomography. In this paper, we extend the use of fast line search to the monotone fast iterative shrinkage-threshold algorithm (MFISTA) and some of its variants. Line search can accelerate the FISTA family considering typical synthesis priors, such as the ℓ1-norm of wavelet coefficients, as well as analysis priors, such as anisotropic total variation. This paper describes these new MFISTA and OMFISTA with line search, and also shows through numerical results that line search improves their performance for tomographic high-resolution image reconstruction.

Similarity preserving snippet-based visualization of web search results.

Internet users are very familiar with the results of a search query displayed as a ranked list of snippets. Each textual snippet shows a content summary of the referred document (or webpage) and a link to it. This display has many advantages, for example, it affords easy navigation and is straightforward to interpret. Nonetheless, any user of search engines could possibly report some experience of disappointment with this metaphor. Indeed, it has limitations in particular situations, as it fails to provide an overview of the document collection retrieved. Moreover, depending on the nature of the query--for example, it may be too general, or ambiguous, or ill expressed--the desired information may be poorly ranked, or results may contemplate varied topics. Several search tasks would be easier if users were shown an overview of the returned documents, organized so as to reflect how related they are, content wise. We propose a visualization technique to display the results of web queries aimed at overcoming such limitations. It combines the neighborhood preservation capability of multidimensional projections with the familiar snippet-based representation by employing a multidimensional projection to derive two-dimensional layouts of the query search results that preserve text similarity relations, or neighborhoods. Similarity is computed by applying the cosine similarity over a "bag-of-words" vector representation of collection built from the snippets. If the snippets are displayed directly according to the derived layout, they will overlap considerably, producing a poor visualization. We overcome this problem by defining an energy functional that considers both the overlapping among snippets and the preservation of the neighborhood structure as given in the projected layout. Minimizing this energy functional provides a neighborhood preserving two-dimensional arrangement of the textual snippets with minimum overlap. The resulting visualization conveys both a global view of the query results and visual groupings that reflect related results, as illustrated in several examples shown.