Medical imaging plays an indispensable role in evaluating, predicting, and monitoring a range of medical conditions. Radiomics, a specialized branch of medical imaging, utilizes quantitative features extracted from medical images to describe underlying pathologies, genetic information, and prognostic indicators. The integration of radiomics with artificial intelligence presents innovative avenues for cancer diagnosis, prognosis evaluation, and therapeutic choices. In the context of oncology, radiomics offers significant potential. Feature selection emerges as a pivotal step, enhancing the clinical utility and precision of radiomics. It achieves this by purging superfluous and unrelated features, thereby augmenting model performance and generalizability. The goal of this review is to assess the fundamental radiomics process and the progress of feature selection methods, explore their applications and challenges in cancer research, and provide theoretical and methodological support for future investigations. Through an extensive literature survey, articles pertinent to radiomics and feature selection were garnered, synthesized, and appraised. The paper provides detailed descriptions of how radiomics is applied and challenged in different cancer types and their various stages. The review also offers comparative insights into various feature selection strategies, including filtering, packing, and embedding methodologies. Conclusively, the paper broaches the limitations and prospective trajectories of radiomics.

With the widespread application of convolutional neural networks (CNNs), the traditional model based denoising algorithms are now outperformed. However, CNNs face two problems. First, they are computationally demanding, which makes their deployment especially difficult for mobile terminals. Second, experimental evidence shows that CNNs often over-smooth regular textures present in images, in contrast to traditional non-local models. In this letter, we propose a solution to both issues by combining a nonlocal algorithm with a lightweight residual CNN. s solution gives full latitude to the advantages of both models. We apply this framework to two GPU implementations of classic nonlocal algorithms (NLM and BM3D) and observe a substantial gain in both cases, performing better than the state-of-the-art with low computational requirements. Our solution is between 10 and 20 times faster than CNNs with equivalent performance and attains higher PSNR. In addition the final method shows a notable gain on images containing complex textures like the ones of the MIT Moiré dataset.

Image demosaicing and denoising play a critical role in the raw imaging pipeline. These processes have often been treated as independent, without considering their interactions. Indeed, most classic denoising methods handle noisy RGB images, not raw images. Conversely, most demosaicing methods address the demosaicing of noise free images. The real problem is to jointly denoise and demosaic noisy raw images. But the question of how to proceed is still not clarified. In this paper, we carry out extensive experiments and a mathematical analysis to tackle this problem by low complexity algorithms. Indeed, both problems have only been addressed jointly by end-to-end heavy-weight convolutional neural networks (CNNs), which are currently incompatible with low-power portable imaging devices and remain by nature domain (or device) dependent. Our study leads us to conclude that, with moderate noise, demosaicing should be applied first, followed by denoising. This requires a simple adaptation of classic denoising algorithms to demosaiced noise, which we justify and specify. Although our main conclusion is 'demosaic first, then denoise, ' we also discover that for high noise, there is a moderate PSNR gain by a more complex strategy: partial CFA denoising followed by demosaicing and by a second denoising on the RGB image. These surprising results are obtained by a black-box optimization of the pipeline, which could be applied to any other pipeline. We validate our results on simulated and real noisy CFA images obtained from several benchmarks.

Sparse view computed tomography (CT) reconstruction poses a challenging ill-posed inverse problem, necessitating effective regularization techniques. In this letter, we employ $L_{p}$ -norm ( $0< p< 1$ ) regularization to induce sparsity and introduce inertial steps, leading to the development of the inertial $L_{p}$ -norm half-quadratic splitting algorithm. We rigorously prove the convergence of this algorithm. Furthermore, we leverage deep learning to initialize the conjugate gradient method, resulting in a deep unrolling network with theoretical guarantees. Our extensive numerical experiments demonstrate that our proposed algorithm surpasses existing methods, particularly excelling in fewer scanned views and complex noise conditions.