Maximized Spatial Information and Minimized Acquisition Time of Top-Hat IR-MALDESI-MSI of Zebrafish Using Nested Regions of Interest (nROIs)

Increasing the spatial resolution of a mass spectrometry imaging (MSI) method results in a more defined heatmap of the spatial distribution of molecules across a sample, but it is also associated with the disadvantage of increased acquisition time. Decreasing the area of the region of interest to achieve shorter durations results in the loss of potentially valuable information in larger specimens. This work presents a novel MSI method to reduce the time of MSI data acquisition with variable step size imaging: nested regions of interest (nROIs). Using nROIs, a small ROI may be imaged at a higher spatial resolution while nested inside a lower-spatial-resolution peripheral ROI. This conserves the maximal spatial and chemical information generated from target regions while also decreasing the necessary acquisition time. In this work, the nROI method was characterized on mouse liver and applied to top-hat MSI of zebrafish using a novel optical train, which resulted in a significant improvement in both acquisition time and spatial detail of the zebrafish. The nROI method can be employed with any step size pairing and adapted to any method in which the acquisition time of larger high-resolution ROIs poses a practical challenge.

Fast Multi-Grid Methods for Minimizing Curvature Energies

The geometric high-order regularization methods such as mean curvature and Gaussian curvature, have been intensively studied during the last decades due to their abilities in preserving geometric properties including image edges, corners, and contrast. However, the dilemma between restoration quality and computational efficiency is an essential roadblock for high-order methods. In this paper, we propose fast multi-grid algorithms for minimizing both mean curvature and Gaussian curvature energy functionals without sacrificing accuracy for efficiency. Unlike the existing approaches based on operator splitting and the Augmented Lagrangian method (ALM), no artificial parameters are introduced in our formulation, which guarantees the robustness of the proposed algorithm. Meanwhile, we adopt the domain decomposition method to promote parallel computing and use the fine-to-coarse structure to accelerate convergence. Numerical experiments are presented on image denoising, CT, and MRI reconstruction problems to demonstrate the superiority of our method in preserving geometric structures and fine details. The proposed method is also shown effective in dealing with large-scale image processing problems by recovering an image of size $1024\times 1024$ within 40s, while the ALM-based method requires around 200s.