Henry Boyette (dayshake77)

Model-based reconstruction methods have emerged as a powerful alternative to classical Fourier-based MRI techniques, largely because of their ability to explicitly model (and therefore, potentially overcome) moderate field inhomogeneities, streamline reconstruction from non-Cartesian sampling, and even allow for the use of custom designed non-Fourier encoding methods. Their application in such scenarios, however, often comes with a substantial increase in computational cost, owing to the fact that the corresponding forward model in such settings no longer possesses a direct Fourier Transform based implementation. This paper introduces an algorithmic framework designed to reduce the computational burden associated with model-based MRI reconstruction tasks. The key innovation is the strategic sparsification of the corresponding forward operators for these models, giving rise to approximations of the forward models (and their adjoints) that admit low computational complexity application. This enables overall a reduced computational complexity application of popular iterative first-order reconstruction methods for these reconstruction tasks. Computational results obtained on both synthetic and experimental data illustrate the viability and efficiency of the approach.Differentiating Vertebral Compression Fractures (VCFs) associated with trauma and osteoporosis (benign VCFs) or those caused by metastatic cancer (malignant VCFs) is critically important for treatment decisions. So far, automatic VCFs diagnosis is solved in a two-step manner, i.e., first identify VCFs and then classify them into benign or malignant. In this paper, we explore to model VCFs diagnosis as a three-class classification problem, i.e., normal vertebrae, benign VCFs, and malignant VCFs. However, VCFs recognition and classification require very different features, and both tasks are characterized by high intra-class variation and high inter-class similarity. Moreover, the dataset is extremely class-imbalanced. To address the above challenges, we propose a novel Two-Stream Compare and Contrast Network (TSCCN) for VCFs diagnosis. This network consists of two streams, a recognition stream which learns to identify VCFs through comparing and contrasting between adjacent vertebrae, and a classification stream which compares and contrasts between intra-class and inter-class to learn features for fine-grained classification. The two streams are integrated via a learnable weight control module which adaptively sets their contribution. TSCCN is evaluated on a dataset consisting of 239 VCFs patients and achieves the average sensitivity and specificity of 92.56% and 96.29%, respectively.chapters/abstract.We consider the problem of representation learning for graph data. Given images are special cases of graphs with nodes lie on 2D lattices, graph embedding tasks have a natural correspondence with image pixel-wise prediction tasks such as segmentation. While encoder-decoder architectures like U-Nets have been successfully applied to image pixel-wise prediction tasks, similar methods are lacking for graph data. This is because pooling and up-sampling operations are not natural on graph data. To address these challenges, we propose novel graph pooling and unpooling operations. The gPool layer adaptively selects some nodes to form a smaller graph based on their scalar projection values. We further propose the gUnpool layer as the inverse operation of the gPool layer. Based on our proposed methods, we develop an encoder-decoder model, known as the graph U-Nets. Experimental results on node classification and graph classification tasks demonstrate that our methods achieve consistently better performance than previous models. Along this direction, we extend our methods by integrating attention mechanisms. Based on attention operators, we proposed attention-based pooling and unpooling layers, which can better capture graph topology information. The empirical results on graph clas