Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.10831

MoCoNet: Motion Correction in 3D MPRAGE images using a Convolutional Neural Network approach

Kamlesh Pawar·Zhaolin Chen·N. Jon Shah·Gary F. Egan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Purpose: The suppression of motion artefacts from MR images is a challenging task. The purpose of this paper is to develop a standalone novel technique to suppress motion artefacts from MR images using a data-driven deep learning approach. Methods: A deep learning convolutional neural network (CNN) was developed to remove motion artefacts in brain MR images. A CNN was trained on simulated motion corrupted images to identify and suppress artefacts due to the motion. The network was an encoder-decoder CNN architecture where the encoder decomposed the motion corrupted images into a set of feature maps. The feature maps were then combined by the decoder network to generate a motion-corrected image. The network was tested on an unseen simulated dataset and an experimental, motion corrupted in vivo brain dataset. Results: The trained network was able to suppress the motion artefacts in the simulated motion corrupted images, and the mean percentage error in the motion corrected images was 2.69 % with a standard deviation of 0.95 %. The network was able to effectively suppress the motion artefacts from the experimental dataset, demonstrating the generalisation capability of the trained network. Conclusion: A novel and generic motion correction technique has been developed that can suppress motion artefacts from motion corrupted MR images. The proposed technique is a standalone post-processing method that does not interfere with data acquisition or reconstruction parameters, thus making it suitable for a multitude of MR sequences.

Explore related subjects

eess.IVcs.CVcs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kamlesh Pawar, Zhaolin Chen, N. Jon Shah, Gary F. Egan. 2018-07-29. MoCoNet: Motion Correction in 3D MPRAGE images using a Convolutional Neural Network approach. https://doi.org/10.1002/nbm.4225

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

IViT: A Novel Interpretable Visual Transformer for Skin Disease Detection

The clinical diagnosis of skin diseases is susceptible to interference from inter-class similarity of skin lesions, and over-reliance on clinicians'experience easily leads to subjective bias. Although existing deep learning aided diagnosis methods achieve competitive accuracy, they suffer from the black-box opacity of Vision Transformer (ViT) and poor adaptability to medical few-shot scenarios. Moreover, mainstream explainable algorithms generally face the bottleneck of significant accuracy degradation when improving interpretability. This paper proposes an interpretable ViT (IViT) constrained by Quadratic Programming (QP). The introduced pre-trained transfer learning adapts to few-shot feature extraction. A discrete QP feature selection framework is constructed to screen generic and discriminative features consistent with clinical diagnostic logic. A multi-objective loss function is designed to reduce feature redundancy and optimize activation distribution while preserving classification performance. Experimental results on six standard skin disease datasets show that IViT achieves an accuracy of 93.80%, only 0.21% lower than the baseline, with feature redundancy reduced by 29.5%. Its core activation regions are consistent with clinically concerned lesion areas. The proposed model balances accuracy and interpretability, providing a reliable solution for the clinical deployment of few-shot intelligent skin disease diagnosis.

eess.IV↗
arXiv2026

Automated Distinction of Intimal and Medial Intracranial Arterial Calcification from CT Head

Intracranial arterial calcifications (IACs) are a common finding on clinical non-contrast enhanced head CT scans and are associated with neurovascular disease. Calcifications can occur in the intimal or medial layer of the arterial wall, subtypes that differ in aetiology and may have distinct clinical relevance. These subtypes can be visually distinguished by radiologists based on the shape of the calcifications. We investigate three automated approaches for subtype classification of IAC from head CT-derived segmentation masks: (1) an automated adaptation of the established radiological visual score, (2) a sphericity-based method, and (3) a method based on shape embeddings extracted by a medical shape foundation model. All approaches use the same lightweight classification pipeline on top of the features they compute and are evaluated using 5-fold cross-validation. The three methods achieved comparable performance, with the embedding-based approach yielding the best overall results with a weighted F1 (mean $\pm$ SD) of up to 71.5 $\pm$ 3.7 for a single artery and 59.8 $\pm$ 1.7 for the joint artery classification. Performance was largely preserved when using automated instead of manual IAC segmentation masks, and we found the difference in weighted F1 not significant. Our results show that fully automated IAC subtype quantification from head CT is feasible and remains robust to the use of manual and automated IAC segmentation masks. Code at https://github.com/bjin96/iac-subtyping.

eess.IV↗
arXiv2026

Recasting the Destroy Step of Large Neighborhood Search as Dense Segmentation

Large neighborhood search improves an incumbent by releasing selected variables and repairing the resulting subproblem under a time limit. FOVEA casts variable selection as dense semantic segmentation on a fixed $128\times128$ canvas. A small U-Net reads twelve semantic channels and predicts cell scores, which are decoded into a variable set subject to a fixed variable budget. Family-specific layouts connect the search state to the canvas, while one set of network weights serves four problem families. The FP32 network input occupies $786$\,kB across instance sizes. Our analysis bounds constraint coupling for spatially coherent regions, gives a rank certificate for rounds with zero possible improvement, and bounds the coupling advantage attainable on an expander family. On the tested families and hardware, FOVEA trails the strongest graph encoder at $10^{4}$ variables and overtakes it near $1.5\times10^{4}$; the cost model provides an approximate crossover estimate. At larger sizes, where the graph-encoder baselines exceed device memory, FOVEA reduces the primal integral by $12$ to $16\%$ relative to the best runnable baselines. On the expander family, FOVEA performs comparably to random selection, with a coupling advantage close to one.

eess.IV↗