4,819 research outputs found
Fast block-based image restoration employing the improved best neighborhood matching approach
2005-2006 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
HYDRA: Hybrid Deep Magnetic Resonance Fingerprinting
Purpose: Magnetic resonance fingerprinting (MRF) methods typically rely on
dictio-nary matching to map the temporal MRF signals to quantitative tissue
parameters. Such approaches suffer from inherent discretization errors, as well
as high computational complexity as the dictionary size grows. To alleviate
these issues, we propose a HYbrid Deep magnetic ResonAnce fingerprinting
approach, referred to as HYDRA.
Methods: HYDRA involves two stages: a model-based signature restoration phase
and a learning-based parameter restoration phase. Signal restoration is
implemented using low-rank based de-aliasing techniques while parameter
restoration is performed using a deep nonlocal residual convolutional neural
network. The designed network is trained on synthesized MRF data simulated with
the Bloch equations and fast imaging with steady state precession (FISP)
sequences. In test mode, it takes a temporal MRF signal as input and produces
the corresponding tissue parameters.
Results: We validated our approach on both synthetic data and anatomical data
generated from a healthy subject. The results demonstrate that, in contrast to
conventional dictionary-matching based MRF techniques, our approach
significantly improves inference speed by eliminating the time-consuming
dictionary matching operation, and alleviates discretization errors by
outputting continuous-valued parameters. We further avoid the need to store a
large dictionary, thus reducing memory requirements.
Conclusions: Our approach demonstrates advantages in terms of inference
speed, accuracy and storage requirements over competing MRF method
Compound Attention and Neighbor Matching Network for Multi-contrast MRI Super-resolution
Multi-contrast magnetic resonance imaging (MRI) reflects information about
human tissue from different perspectives and has many clinical applications. By
utilizing the complementary information among different modalities,
multi-contrast super-resolution (SR) of MRI can achieve better results than
single-image super-resolution. However, existing methods of multi-contrast MRI
SR have the following shortcomings that may limit their performance: First,
existing methods either simply concatenate the reference and degraded features
or exploit global feature-matching between them, which are unsuitable for
multi-contrast MRI SR. Second, although many recent methods employ transformers
to capture long-range dependencies in the spatial dimension, they neglect that
self-attention in the channel dimension is also important for low-level vision
tasks. To address these shortcomings, we proposed a novel network architecture
with compound-attention and neighbor matching (CANM-Net) for multi-contrast MRI
SR: The compound self-attention mechanism effectively captures the dependencies
in both spatial and channel dimension; the neighborhood-based feature-matching
modules are exploited to match degraded features and adjacent reference
features and then fuse them to obtain the high-quality images. We conduct
experiments of SR tasks on the IXI, fastMRI, and real-world scanning datasets.
The CANM-Net outperforms state-of-the-art approaches in both retrospective and
prospective experiments. Moreover, the robustness study in our work shows that
the CANM-Net still achieves good performance when the reference and degraded
images are imperfectly registered, proving good potential in clinical
applications.Comment: This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
Development Of A High Performance Mosaicing And Super-Resolution Algorithm
In this dissertation, a high-performance mosaicing and super-resolution algorithm is described. The scale invariant feature transform (SIFT)-based mosaicing algorithm builds an initial mosaic which is iteratively updated by the robust super resolution algorithm to achieve the final high-resolution mosaic. Two different types of datasets are used for testing: high altitude balloon data and unmanned aerial vehicle data. To evaluate our algorithm, five performance metrics are employed: mean square error, peak signal to noise ratio, singular value decomposition, slope of reciprocal singular value curve, and cumulative probability of blur detection. Extensive testing shows that the proposed algorithm is effective in improving the captured aerial data and the performance metrics are accurate in quantifying the evaluation of the algorithm
Geometry-Aware Neighborhood Search for Learning Local Models for Image Reconstruction
Local learning of sparse image models has proven to be very effective to
solve inverse problems in many computer vision applications. To learn such
models, the data samples are often clustered using the K-means algorithm with
the Euclidean distance as a dissimilarity metric. However, the Euclidean
distance may not always be a good dissimilarity measure for comparing data
samples lying on a manifold. In this paper, we propose two algorithms for
determining a local subset of training samples from which a good local model
can be computed for reconstructing a given input test sample, where we take
into account the underlying geometry of the data. The first algorithm, called
Adaptive Geometry-driven Nearest Neighbor search (AGNN), is an adaptive scheme
which can be seen as an out-of-sample extension of the replicator graph
clustering method for local model learning. The second method, called
Geometry-driven Overlapping Clusters (GOC), is a less complex nonadaptive
alternative for training subset selection. The proposed AGNN and GOC methods
are evaluated in image super-resolution, deblurring and denoising applications
and shown to outperform spectral clustering, soft clustering, and geodesic
distance based subset selection in most settings.Comment: 15 pages, 10 figures and 5 table
- âŠ