This paper proposes a segmentation-free radiomics method to classify malignant and benign breast tumors with shear-wave elastography (SWE) data. The method is targeted to integrate the advantage of both SWE in providing important elastic with morphology information and convolutional neural network (CNN) in automatic feature extraction and accurate classification. Compared to traditional methods, the proposed method is designed to directly extract features from the dataset without the pre-requisite of segmentation and manual operation. This can keep the peri-tumor information which is lost by segmentation-based methods. With the proposed model trained on 205 cases (70 from malignant breast patients and 135 from benign breast patients respectively), an accuracy of 95.79%, a sensitivity of 96.23% and a specificity of 95.65% was obtained for the final test. The superior performances compared to the existing state-of-the-art methods and its automatic nature both demonstrate that the proposed method has a great potential to be applied to clinical computer-aided diagnosis of breast cancer.

X-ray computed tomography (CT) is of great clinical significance in medical practice because it can provide anatomical information about the human body without invasion, while its radiation risk has continued to attract public concerns. Reducing the radiation dose may induce noise and artifacts to the reconstructed images, which will interfere with the judgments of radiologists. Previous studies have confirmed that deep learning (DL) is promising for improving low-dose CT imaging. However, almost all the DL-based methods suffer from subtle structure degeneration and blurring effect after aggressive denoising, which has become the general challenging issue. This paper develops the Comprehensive Learning Enabled Adversarial Reconstruction (CLEAR) method to tackle the above problems. CLEAR achieves subtle structure enhanced low-dose CT imaging through a progressive improvement strategy. First, the generator established on the comprehensive domain can extract more features than the one built on degraded CT images and directly map raw projections to high-quality CT images, which is significantly different from the routine GAN practice. Second, a multi-level loss is assigned to the generator to push all the network components to be updated towards high-quality reconstruction, preserving the consistency between generated images and gold-standard images. Finally, following the WGAN-GP modality, CLEAR can migrate the real statistical properties to the generated images to alleviate over-smoothing. Qualitative and quantitative analyses have demonstrated the competitive performance of CLEAR in terms of noise suppression, structural fidelity and visual perception improvement.

The score-based generative model (SGM) has demonstrated remarkable performance in addressing challenging under-determined inverse problems in medical imaging. However, acquiring high-quality training datasets for these models remains a formidable task, especially in medical image reconstructions. Prevalent noise perturbations or artifacts in low-dose Computed Tomography (CT) or under-sampled Magnetic Resonance Imaging (MRI) hinder the accurate estimation of data distribution gradients, thereby compromising the overall performance of SGMs when trained with these data. To alleviate this issue, we propose a wavelet-improved denoising technique to cooperate with the SGMs, ensuring effective and stable training. Specifically, the proposed method integrates a wavelet sub-network and the standard SGM sub-network into a unified framework, effectively alleviating inaccurate distribution of the data distribution gradient and enhancing the overall stability. The mutual feedback mechanism between the wavelet sub-network and the SGM sub-network empowers the neural network to learn accurate scores even when handling noisy samples. This combination results in a framework that exhibits superior stability during the learning process, leading to the generation of more precise and reliable reconstructed images. During the reconstruction process, we further enhance the robustness and quality of the reconstructed images by incorporating regularization constraint. Our experiments, which encompass various scenarios of low-dose and sparse-view CT, as well as MRI with varying under-sampling rates and masks, demonstrate the effectiveness of the proposed method by significantly enhanced the quality of the reconstructed images. Especially, our method with noisy training samples achieves comparable results to those obtained using clean data. Our code at https://zenodo.org/record/8266123.

To improve the compressive sensing MRI (CS-MRI) ap-proaches in terms of fine structure loss under high acceler-ation factors, we have proposed an iterative feature re-finement model (IFR-CS), equipped with fixed transforms, to restore the meaningful structures and details. Neverthe-less, the proposed IFR-CS still has some limitations, such as the selection of hyper-parameters, a lengthy reconstruction time, and the fixed sparsifying transform. To alleviate these issues, we unroll the iterative feature refinement pro-cedures in IFR-CS to a supervised model-driven network, dubbed IFR-Net. Equipped with training data pairs, both regularization parameter and the utmost feature refine-ment operator in IFR-CS become trainable. Additionally, inspired by the powerful representation capability of con-volutional neural network (CNN), CNN-based inversion blocks are explored in the sparsity-promoting denoising module to generalize the sparsity-enforcing operator. Ex-tensive experiments on both simulated and in vivo MR da-tasets have shown that the proposed network possesses a strong capability to capture image details and preserve well the structural information with fast reconstruction speed.

In recent years Bregman iterative method (or related augmented Lagrangian method) has shown to be an efficient optimization technique for various inverse problems. In this paper, we propose a two-level Bregman Method with dictionary updating for highly undersampled magnetic resonance (MR) image reconstruction. The outer-level Bregman iterative procedure enforces the sampled k-space data constraints, while the inner-level Bregman method devotes to updating dictionary and sparse representation of small overlapping image patches, emphasizing local structure adaptively. Modified sparse coding stage and simple dictionary updating stage applied in the inner minimization make the whole algorithm converge in a relatively small number of iterations, and enable accurate MR image reconstruction from highly undersampled k-space data. Experimental results on both simulated MR images and real MR data consistently demonstrate that the proposed algorithm can efficiently reconstruct MR images and present advantages over the current state-of-the-art reconstruction approach.