Search

Aiming at the traditional schemes for encrypting and transmitting images can be subject to arbitrary destruction by attackers, making it difficult for algorithms with poor robustness to recover the original image, this paper proposes a new visually image encryption algorithm, which can embed the compressed and encrypted image into a carrier image to achieve visual security, thus avoiding destruction and attacks. Foremost, a new conservative hyperchaotic system without attractors was constructed that can resist reconstruction attacks. Secondly, a two-dimensional (2D) compressed sensing technique is adopted, and the pseudo random sequences of the proposed chaotic system generates a measurement matrix in compressed sensing, and optimizes this matrix to improve the visual quality of image reconstruction. Finally, by combining discrete wavelet transform (DWT) and singular value decomposition (SVD) methods, the encrypted image is embedded into the carrier image to achieve the purpose of image compression, encryption, and hiding. And experimental results and comparative analysis demonstrate that this algorithm has high security, good image reconstruction quality, and strong imperceptibility after image embedding. Under limited bandwidth conditions, the algorithm achieves excellent visual security effects. [ABSTRACT FROM AUTHOR]

Block compressed sensing (BCS) is a promising method for resource-constrained image/video coding applications. However, the quantization of BCS measurements has posed a challenge, leading to significant quantization errors and encoding redundancy. In this paper, we propose a quantization method for BCS measurements using convolutional neural networks (CNN). The quantization process maps measurements to quantized data that follow a uniform distribution based on the measurements' distribution, which aims to maximize the amount of information carried by the quantized data. The dequantization process restores the quantized data to data that conform to the measurements' distribution. The restored data are then modified by the correlation information of the measurements drawn from the quantized data, with the goal of minimizing the quantization errors. The proposed method uses CNNs to construct quantization and dequantization processes, and the networks are trained jointly. The distribution parameters of each block are used as side information, which is quantized with 1 bit by the same method. Extensive experiments on four public datasets showed that, compared with uniform quantization and entropy coding, the proposed method can improve the PSNR by an average of 0.48 dB without using entropy coding when the compression bit rate is 0.1 bpp. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Signal Processing is the property of Journal of Signal Processing and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Although hyperpolarized (HP) 129Xe ventilation MRI can be carried out within a breath hold, it is still challenging for many sick patients. Compressed sensing (CS) is a viable alternative to accelerate this approach. However, undersampled images with identical sampling ratios differ from one another. Twenty subjects (n = 10 healthy and n = 10 patients with asthma) were scanned using a GE MR750 3 T scanner, acquiring fully sampled 2D multi‐slice HP 129Xe lung ventilation images (10 s breath hold, 128 × 80 (FE × PE—frequency encoding × phase encoding) and 16 slices). Using fully sampled data, 500 variable‐density Cartesian random undersampling patterns were generated, each at eight different sampling ratios from 10% to 80%. The parallel imaging and compressed sensing (PICS) command from BART was employed to reconstruct undersampled data. The signal to noise ratio (SNR), structural similarity index measurement (SSIM) and sidelobe to peak ratio of each were subsequently compared. There was a high degree of variation in both SNR and SSIM results from each of the 500 masks of each sampling rate. As the undersampling increases, there is more variation in the quantifying metrics, for both healthy and asthmatic individuals. Our study shows that random undersampling poses a significant challenge when applied at sampling ratios less than 60%, despite fulfilling CS's incoherency criteria. Such low sampling ratios will result in a large variety of undersampling patterns. Therefore, skipped segments of k‐space cannot be allowed to happen randomly at low sampling rates. By optimizing the sampling pattern, CS will reach its full potential and be able to be applied to a highly undersampled 129Xe lung dataset. [ABSTRACT FROM AUTHOR]

This research paper examines compressed sensing's impact on medical imaging. Math and signal processing inspired compressed sensing. Future picture-capturing will be radically different. The paper focuses on adaptive random sampling (ARS), iterative shrinkage-thresholding algorithms (ISTA), and temporal compressed sensing (TCS). These approaches were rigorously tested using MRIs, X-rays, and dynamic imaging patterns. Low scan times, picture quality, and dynamic imaging were the main test criteria. The technologies considerably reduced scan time, demonstrating their potential to speed up imaging procedures. The reconstructed photos had higher SNRs and SSIs than those obtained using normal techniques, indicating greater accuracy. The TCS algorithm's dynamic imaging skills, especially evident in heart and musculoskeletal imaging, eliminated motion defects while exhibiting real-time physiological changes. The study was expanded to incorporate customized treatment, and the recommended procedures have proven amazing adaptability to each patient's demands. This adaptability fits current medical treatments, making unique imaging technologies viable. [ABSTRACT FROM AUTHOR]

Using numerical indices and visual evaluation, we evaluated the dependence of coronary-artery depictability on the denoising parameter in compressed sensing magnetic resonance angiography (CS-MRA). This study was conducted to clarify the acceleration factor (AF) and denoising factor (DF) dependence of CS-MRA image quality. Vascular phantoms and clinical images were acquired using three-dimensional CS-MRA on a clinical 1.5 T system. For the phantom measurements, we compared the full width at half maximum (FWHM), sharpness, and contrast ratio of the vascular profile curves for various AFs and DFs. In the clinical cases, the FWHM, sharpness, contrast ratio, signal-to-noise ratio, noise level values, and visual evaluation results were compared for various DFs. Phantom image analyses demonstrated that the respective measurements of the FWHM, sharpness, and contrast ratios did not significantly change with an increase in AF. The FWHM and sharpness measurements slightly changed with the DF level. However, the contrast ratio tended to increase with an increase in the DF level. In the clinical cases, the FWHM and sharpness showed no significant differences, even when the DF level was changed. However, the contrast ratio tended to decrease as the DF level increased. When the DF levels of the clinical cases increased, the background signals of the myocardium, fat, and noise levels decreased. We investigated the dependence of the coronary-artery depictability on AF and DF using CS-MRA. Analysis of the coronary-artery profile curves indicated that a better image quality was achieved with a stronger DF on coronary CS-MRA. [ABSTRACT FROM AUTHOR]

The escalating deployment of distributed power sources and random loads in DC distribution networks has amplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimal configuration of measurement points, this paper presents an optimal configuration scheme for fault location measurement points in DC distribution networks based on an improved particle swarm optimization algorithm. Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing. The model aims to achieve the minimum number of measurement points while attaining the best compressive sensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Halton sequence for population initialization, generating uniformly distributed individuals. This enhancement reduces individual search blindness and overlap probability, thereby promoting population diversity. Furthermore, an adaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the global search capability and search speed. The established model for the optimal configuration of measurement points is solved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configuration reduces the number of measurement points, enhances localization accuracy, and improves the convergence speed of the algorithm. These findings validate the effectiveness and utility of the proposed approach. [ABSTRACT FROM AUTHOR]

In practical applications, some sparse signals have structural characteristics of block sparsity. Under the hypothesis of removing the requirements on the noise in recent literature concerning the ℓ 2 / ℓ p (0 < p ≤ 1) minimization method, uniform block restricted isometry property (B-RIP) condition is established for the stable recovery of approximately block k-sparse signals with partial block support information by employing the weighted ℓ 2 / ℓ p minimization method. Compared with the state-of-the-art results, the newly-obtained results present more relaxed sufficient condition for block sparse signal recovery, and meanwhile provide more precise reconstruction error estimations in different noise settings. Numerical experiments demonstrate that the new method exhibits a substantial increase in the reconstruction quality for highly undersampled block structural signals. [ABSTRACT FROM AUTHOR]

Sparse representation has garnered significant attention across multiple fields, including signal processing, statistics, and machine learning. The fundamental concept of this technique is that we can express the signal as a linear combination of only a few elements from a known basis. Compressed sensing (CS) is an interesting application of this technique. It is valued for its potential to improve data collection and ensure efficient acquisition and recovery from just a few measurements. In this paper, we propose a novel approach for the high-order CS problem based on the Einstein product, utilizing a tensor dictionary instead of the commonly used matrix-based dictionaries in the Tucker model. Our approach provides a more general framework for compressed sensing. We present two novel models to address the CS problem in the multidimensional case. The first model represents a natural generalization of CS to higher-dimensional signals; we extend the traditional CS framework to effectively capture the sparsity of multidimensional signals and enable efficient recovery. In the second model, we introduce a complexity reduction technique by utilizing a low-rank representation of the signal. We extend the OMP and the homotopy algorithms to solve the high-order CS problem. Through various simulations, we validate the effectiveness of our proposed method, including its application to solving the completion tensor problem in 2D and 3D colored and hyperspectral images. [ABSTRACT FROM AUTHOR]

Parallel compressive super-resolution imaging has attracted increasing attention in recent years. However, the super-resolution quality depends on modulation masks and reconstruction algorithms. A deep-learning method provides an efficient solution, but in wide field-of-view (FOV) scenarios, the differences between optical transfer functions (OTFs) of each pixel increase the system complexity and limit its practical application. This study proposed a wide FOV parallel compressive super-resolution imaging approach based on a physics-enhanced network. First, the network and modulation masks of an arbitrary 128 × 128-pixel region were trained; then, the trained network was fine-tuned for the rest of the 128 × 128-pixel regions in the entire wide FOV, which effectively eliminated the OTF variability. Numerical simulations and practical experiments demonstrated that through the proposed approach, super-resolution images of 1020 × 1500 pixels can be reconstructed from 272 × 400-pixel low-resolution measurements using only three designed masks, with the resolution enhanced 3.75 × 3.75 times and the peak signal-to-noise ratio improved by 89.4% compared to the results of the previous compressed sensing algorithm. Besides, the training time was dramatically reduced by 95.5-fold compared with the traditional training strategy for each region alone. This approach decreases the imaging complexity of wide FOV and achieves the high-quality super-resolution reconstruction under few trained masks, thus we believe it can promote rapid imaging for super-resolution and a wide FOV ranging from infrared to terahertz. [ABSTRACT FROM AUTHOR]

Two‐dimensional (2D) direction‐of‐arrival (DOA) estimation is crucial in array signal processing. Compressed sensing (CS) provides a superior alternative to spatial spectrum estimation algorithms by enabling 2D DOA estimation of correlated sources from single snapshot data. However, the grid mismatch effect inherent in grid‐based CS algorithms impacts estimation accuracy. Despite recent advancements, the state‐of‐the‐art gridless CS algorithm, decoupled atomic norm minimization, is limited to specific 2D array geometries, such as uniform rectangular arrays. This letter presents an efficient gridless 2D DOA estimation algorithm for generalized rectangular arrays, including both uniform and sparse arrays. The proposed algorithm achieves high accuracy through a novel approach called generalized matrix‐form atomic norm minimization and provides a fast solution using the alternating direction method of multipliers. Validation through computer simulations and practical experiments underscores its efficacy. [ABSTRACT FROM AUTHOR]

We introduce three architecture modifications to enhance the performance of the end-to-end (E2E) variational network (VarNet) for undersampled MRI reconstructions. We first implemented the Feature VarNet, which propagates information throughout the cascades of the network in an N-channel feature-space instead of a 2-channel feature-space. Then, we add an attention layer that utilizes the spatial locations of Cartesian undersampling artifacts to further improve performance. Lastly, we combined the Feature and E2E VarNets into the Feature-Image (FI) VarNet, to facilitate cross-domain learning and boost accuracy. Reconstructions were evaluated on the fastMRI dataset using standard metrics and clinical scoring by three neuroradiologists. Feature and FI VarNets outperformed the E2E VarNet for 4 × , 5 × and 8 × Cartesian undersampling in all studied metrics. FI VarNet secured second place in the public fastMRI leaderboard for 4 × Cartesian undersampling, outperforming all open-source models in the leaderboard. Radiologists rated FI VarNet brain reconstructions with higher quality and sharpness than the E2E VarNet reconstructions. FI VarNet excelled in preserving anatomical details, including blood vessels, whereas E2E VarNet discarded or blurred them in some cases. The proposed FI VarNet enhances the reconstruction quality of undersampled MRI and could enable clinically acceptable reconstructions at higher acceleration factors than currently possible. [ABSTRACT FROM AUTHOR]

It is well-known that the problem of sampling recovery in the L_2-norm on unweighted Korobov spaces (Sobolev spaces with mixed smoothness) as well as classical smoothness classes such as Hölder classes suffers from the curse of dimensionality. We show that the problem is tractable for those classes if they are intersected with the Wiener algebra of functions with summable Fourier coefficients. In fact, this is a relatively simple implication of powerful results from the theory of compressed sensing. Tractability is achieved by the use of non-linear algorithms, while linear algorithms cannot do the job. [ABSTRACT FROM AUTHOR]

The generative autoencoders, such as the variational autoencoders or the adversarial autoencoders, have achieved great success in lots of real-world applications, including image generation and signal communication. However, little concern has been devoted to their robustness during practical deployment. Due to the probabilistic latent structure, variational autoencoders (VAEs) may confront problems such as a mismatch between the posterior distribution of the latent and real data manifold, or discontinuity in the posterior distribution of the latent. This leaves a back door for malicious attackers to collapse VAEs from the latent space, especially in scenarios where the encoder and decoder are used separately, such as communication and compressed sensing. In this work, we provide the first study on the adversarial robustness of generative autoencoders in the latent space. Specifically, we empirically demonstrate the latent vulnerability of popular generative autoencoders through attacks in the latent space. We also evaluate the difference between variational autoencoders and their deterministic variants and observe that the latter performs better in latent robustness. Meanwhile, we identify a potential trade-off between the adversarial robustness and the degree of the disentanglement of the latent codes. Additionally, we also verify the feasibility of improvement for the latent robustness of generative autoencoders through adversarial training. In summary, we suggest concerning the adversarial latent robustness of the generative autoencoders, analyze several robustness-relative issues, and give some insights into a series of key challenges. [ABSTRACT FROM AUTHOR]

Cardiac diffusion tensor imaging (cDTI) is a promising and noninvasive magnetic resonance imaging (MRI) technique for assessing myocardial fiber microstructure. However, its clinical application is hampered by lengthy scanning and susceptibility to motion artifacts. This study proposes a cDTI reconstruction model (OSDTI), which leverages octave convolution (OctConv) and Swin Transformer to reconstruct diffusion‐weighted (DW) images from undersampled k‐space data. Our model capitalizes on the strengths of both OctConv and Swin Transformers. Specifically, the OctConv module excels at capturing intricate details and texture information within DW images, while the residual‐connected Swin Transformer module facilitates information retention across various feature extraction stages, thereby enhancing overall image comprehension and reconstruction accuracy. The evaluation of OSDTI using a human ex vivo heart dataset robustly validated the generalization ability of the model. Comparative analyze against existing deep‐learning methods demonstrated OSDTI's superior performance in both DW image quality and diffusion tensor metrics. [ABSTRACT FROM AUTHOR]

In inverse synthetic aperture radar (ISAR) imaging, the conventional range-Doppler (RD) algorithm cannot obtain satisfactory imaging results for sparse aperture. Compressed sensing (CS) imaging methods, such as the typical iterative shrinkage and thresholding algorithm (ISTA), are often used in sparse aperture radar imaging. However, CS-based methods have high computational complexity and difficulty in setting parameters. To overcome the shortcomings, a new deep unfolding network named complex-valued weighted learning ISTA (CV-WLISTA) is proposed in this paper. The new network is very efficient and can learn the parameters adaptively. Based on ISTA and a new weighting strategy, it takes advantage of both the sparsity and the structural property of ISAR images to improve imaging performance. The experimental results show that CV-WLISTA has better reconstruction performance and higher efficiency compared with the traditional algorithms. Therefore, CV-WLISTA is an efficient ISAR imaging method with excellent performance. [ABSTRACT FROM AUTHOR]

Photoacoustic imaging (PAI) is a rapidly developing emerging non-invasive biomedical imaging technique that combines the strong contrast from optical absorption imaging and the high resolution from acoustic imaging. Abnormal biological tissues (such as tumors and inflammation) generate different levels of thermal expansion after absorbing optical energy, producing distinct acoustic signals from normal tissues. This technique can detect small tissue lesions in biological tissues and has demonstrated significant potential for applications in tumor research, melanoma detection, and cardiovascular disease diagnosis. During the process of collecting photoacoustic signals in a PAI system, various factors can influence the signals, such as absorption, scattering, and attenuation in biological tissues. A single ultrasound transducer cannot provide sufficient information to reconstruct high-precision photoacoustic images. To obtain more accurate and clear image reconstruction results, PAI systems typically use a large number of ultrasound transducers to collect multi-channel signals from different angles and positions, thereby acquiring more information about the photoacoustic signals. Therefore, to reconstruct high-quality photoacoustic images, PAI systems require a significant number of measurement signals, which can result in substantial hardware and time costs. Compressed sensing is an algorithm that breaks through the Nyquist sampling theorem and can reconstruct the original signal with a small number of measurement signals. PAI based on compressed sensing has made breakthroughs over the past decade, enabling the reconstruction of low artifacts and high-quality images with a small number of photoacoustic measurement signals, improving time efficiency, and reducing hardware costs. This article provides a detailed introduction to PAI based on compressed sensing, such as the physical transmission model-based compressed sensing method, two-stage reconstruction-based compressed sensing method, and single-pixel camera-based compressed sensing method. Challenges and future perspectives of compressed sensing-based PAI are also discussed. [ABSTRACT FROM AUTHOR]

Faced with the problem of incompatibility between traditional information acquisition mode and spaceborne earth observation tasks, starting from the general mathematical model of compressed sensing, a theoretical model of block compressed sensing was established, and a full-process adaptive coding and decoding compressed sensing framework for remote sensing images was proposed, which includes five parts: mode selection, feature factor extraction, adaptive shape segmentation, adaptive sampling rate allocation and image reconstruction. Unlike previous semi-adaptive or local adaptive methods, the advantages of the adaptive encoding and decoding method proposed in this paper are mainly reflected in four aspects: (1) Ability to select encoding modes based on image content, and maximizing the use of the richness of the image to select appropriate sampling methods; (2) Capable of utilizing image texture details for adaptive segmentation, effectively separating complex and smooth regions; (3) Being able to detect the sparsity of encoding blocks and adaptively allocate sampling rates to fully explore the compressibility of images; (4) The reconstruction matrix can be adaptively selected based on the size of the encoding block to alleviate block artifacts caused by non-stationary characteristics of the image. Experimental results show that the method proposed in this article has good stability for remote sensing images with complex edge textures, with the peak signal-to-noise ratio and structural similarity remaining above 35 dB and 0.8. Moreover, especially for ocean images with relatively simple image content, when the sampling rate is 0.26, the peak signal-to-noise ratio reaches 50.8 dB, and the structural similarity is 0.99. In addition, the recovered images have the smallest BRISQUE value, with better clarity and less distortion. In the subjective aspect, the reconstructed image has clear edge details and good reconstruction effect, while the block effect is effectively suppressed. The framework designed in this paper is superior to similar algorithms in both subjective visual and objective evaluation indexes, which is of great significance for alleviating the incompatibility between traditional information acquisition methods and satellite-borne earth observation missions. [ABSTRACT FROM AUTHOR]

Sparse arrays are widely used to achieve full array performance with fewer elements to reduce the cost of array and beamforming computation. Sparse array synthesis methods such as Bayesian compressed sensing (BCS) yield small element numbers; however, they are limited by the tradeoff between complexity and accuracy. Herein, a novel sparse array synthesis method with two-stage progressive BCS and an undirected graph-based element spacing constraint is proposed. The two-stage progressive BCS includes fast on-grid sparsification and accurate off-grid global re-estimation. First, the multitask BCS is solved using a relevance vector machine to efficiently select elements from candidate positions. Subsequently, a convex surrogate cost function is applied to the global re-estimation of the element weights to increase the beam pattern matching accuracy of the sparse array. Global optimization can improve the array performance. In addition, to satisfy the spacing constraint, a weighted merging method based on an undirected graph is proposed and inserted between the two stages to merge elements that are too close, which ensures the processability of the array. Simulations and experiments involving a variety of arrays were conducted to confirm the advantages of the method with regard to array sparsity, sidelobe suppression, beam pattern matching accuracy, and array processability. The proposed method achieved accurate and effective sparse array synthesis and outperformed existing methods. [ABSTRACT FROM AUTHOR]

It is well-known that point sources with sufficient mutual distance can be reconstructed exactly from finitely many Fourier measurements by solving a convex optimization problem with Tikhonov-regularization (this property is sometimes termed superresolution). In the case of noisy measurements one can bound the reconstruction error in unbalanced Wasserstein distances or weak Sobolev-type norms. A natural question is to what other settings the phenomenon of super-resolution extends. We here keep the same measurement operator but replace the regularizer to anisotropic total variation, which is particularly suitable for regularizing piecewise constant images with horizontal and vertical edges. Under sufficient mutual distance between the horizontal and vertical edges we prove exact reconstruction results and L¹ error bounds in terms of the measurement noise [ABSTRACT FROM AUTHOR]

To assess the utility of deep learning (DL)-based image reconstruction with the combination of compressed sensing (CS) denoising cycle by comparing images reconstructed by conventional CS-based method without DL in fat-suppressed (Fs)-contrast enhanced (CE) three-dimensional (3D) T1-weighted images (T1WIs) of the head and neck. We retrospectively analyzed the cases of 39 patients who had undergone head and neck Fs-CE 3D T1WI applying reconstructions based on conventional CS and CS augmented by DL, respectively. In the qualitative assessment, we evaluated overall image quality, visualization of anatomical structures, degree of artifacts, lesion conspicuity, and lesion edge sharpness based on a five-point system. In the quantitative assessment, we calculated the signal-to-noise ratios (SNRs) of the lesion and the posterior neck muscle and the contrast-to-noise ratio (CNR) between the lesion and the adjacent muscle. For all items of the qualitative analysis, significantly higher scores were awarded to images with DL-based reconstruction (p < 0.001). In the quantitative analysis, DL-based reconstruction resulted in significantly higher values for both the SNR of lesions (p < 0.001) and posterior neck muscles (p < 0.001). Significantly higher CNRs were also observed in images with DL-based reconstruction (p < 0.001). DL-based image reconstruction integrating into the CS-based denoising cycle offered superior image quality compared to the conventional CS method. This technique will be useful for the assessment of patients with head and neck disease. • The acquisition of good image quality poses challenges in MRI of the head and neck. • Superior image quality in CE 3D-T1WI was achieved using CS-based DL reconstruction. • CS-based DL reconstruction may serve as a beneficial tool for head and neck MRI. [ABSTRACT FROM AUTHOR]

The purpose of this study was to determine the utility of compressed sensing (CS) with deep learning reconstruction (DLR) for improving spatial resolution, image quality and focal liver lesion detection on high-resolution contrast-enhanced T1-weighted imaging (HR-CE-T1WI) obtained by CS with DLR as compared with conventional CE-T1WI with parallel imaging (PI). Seventy-seven participants with focal liver lesions underwent conventional CE-T1WI with PI and HR-CE-T1WI, surgical resection, transarterial chemoembolization, and radiofrequency ablation, followed by histopathological or >2-year follow-up examinations in our hospital. Signal-to-noise ratios (SNRs) of liver, spleen and kidney were calculated for each patient, after which each SNR was compared by means of paired t -test. To compare focal lesion detection capabilities of the two methods, a 5-point visual scoring system was adopted for a per lesion basis analysis. Jackknife free-response receiver operating characteristic (JAFROC) analysis was then performed, while sensitivity and false positive rates (/data set) for consensus assessment of the two methods were also compared by using McNemar's test or the signed rank test. Each SNR of HR-CE-T1WI was significantly higher than that of conventional CE-T1WI with PI (p < 0.05). Sensitivities for consensus assessment showed that HR-CE-MRI had significantly higher sensitivity than conventional CE-T1WI with PI (p = 0.004). Moreover, there were significantly fewer FP/cases for HR-CE-T1WI than for conventional CE-T1WI with PI (p = 0.04). CS with DLR are useful for improving spatial resolution, image quality and focal liver lesion detection capability of Gd-EOB-DTPA enhanced 3D T1WI without any need for longer breath-holding time. • SNR of HR-CE-T1WI for each organ were significantly higher than that of conventional CE-T1WI with PI (p<0.05). • Qualitative indexes of HR-CE-T1WI were significantly improved, when compared with conventional CE-T1WI with PI (p<0.05). • HR-CE-T1WI demonstrated significantly better diagnostic performance with conventional CE-T1WI with PI (p<0.05). [ABSTRACT FROM AUTHOR]

Due to the limitations of the actual acquisition environment in the field, especially in ocean bottom seismometer (OBS) acquisition, the acquired seismic data are often irregular and incomplete, which affects the subsequent data imaging, interpretation and hydrocarbon‐bearing reservoir prediction. The interpolation reconstruction algorithm based on the compressive sensing theory can reconstruct the data without the limitation of Nyquist sampling interval. However, the reconstruction accuracy and effect are different for different sparse representations of the data. On the basis of compressed sensing theory, we propose a Bregman iterative seismic data reconstruction method based on the sparse decomposition of discrete orthonormal Coiflets and Symlets wavelet transforms. First, the discrete orthonormal matrix is constructed by using the above two wavelet functions to make the original seismic data sparse, then the Bregman iterative algorithm is used to reconstruct the sparse coefficients in the discrete wavelet domain, and finally the recovery matrix is used to reconstruct the seismic data. The discrete orthonormal Coiflets and Symlets wavelet transforms have good sparse representation ability and can compensate for the problem that discrete Fourier transform cannot well sparse representation of the data. After numerical experiments on horizontal‐layered model, Marmousi2 model and actual data, it is verified that the proposed method can reconstruct the missing seismic data under the regular observation system and under the irregular observation system with non‐uniform OBS distribution. Furthermore, this method can hardly bring the interference of random noise, and the reconstruction result is of high accuracy. [ABSTRACT FROM AUTHOR]

With the development of offshore wind turbine single power toward levels beyond 10 MW, the increase in heat loss of components in the nacelle leads to a high local temperature in the nacelle, which seriously affects the performance of the components. Accurate reconstruction and control of thermal turbulence in the nacelle can alleviate this problem. However, the physical environment of thermal turbulence in the nacelle is very complex. Due to the intermittent and fluctuating nature of turbulence, the turbulent thermal environment is highly nonlinear when coupled with the temperature field. This leads to large reconstruction errors in existing reconstruction methods. Therefore, we improve the sparse reconstruction method for compressed sensing (CS) based on the concept of virtual time using proper orthogonal decomposition (POD). The POD-CS method links the turbulent thermal environment reconstruction with matrix decomposition to ensure computational accuracy and computational efficiency. The improved particle swarm optimization (PSO) is used to optimize the sensor arrangement to ensure stability of the reconstruction and to save sensor resources. We apply this novel and improved PSO-POD-CS coupled reconstruction method to the thermal turbulence reconstruction in the nacelle. The effects of different basis vector dimensions and different sensor location arrangements (boundary and interior) on the reconstruction errors are also evaluated separately, and finally, the desired reconstruction accuracy is obtained. The method is of research value for the reconstruction of conjugate heat transfer problems with high turbulence intensity. [ABSTRACT FROM AUTHOR]

Objective: To investigate the potential applicability of AI-assisted compressed sensing (ACS) in knee MRI to enhance and optimize the scanning process. Methods: Volunteers and patients with sports-related injuries underwent prospective MRI scans with a range of acceleration techniques. The volunteers were subjected to varied ACS acceleration levels to ascertain the most effective level. Patients underwent scans at the determined optimal 3D-ACS acceleration level, and 3D compressed sensing (CS) and 2D parallel acquisition technology (PAT) scans were performed. The resultant 3D-ACS images underwent 3.5 mm/2.0 mm multiplanar reconstruction (MPR). Experienced radiologists evaluated and compared the quality of images obtained by 3D-ACS-MRI and 3D-CS-MRI, 3.5 mm/2.0 mm MPR and 2D-PAT-MRI, diagnosed diseases, and compared the results with the arthroscopic findings. The diagnostic agreement was evaluated using Cohen's kappa correlation coefficient, and both absolute and relative evaluation methods were utilized for objective assessment. Results: The study involved 15 volunteers and 53 patients. An acceleration factor of 10.69 × was identified as optimal. The quality evaluation showed that 3D-ACS provided poorer bone structure visualization, and improved cartilage visualization and less satisfactory axial images with 3.5 mm/2.0 mm MPR than 2D-PAT. In terms of objective evaluation, the relative evaluation yielded satisfactory results across different groups, while the absolute evaluation revealed significant variances in most features. Nevertheless, high levels of diagnostic agreement (κ: 0.81–0.94) and accuracy (0.83–0.98) were observed across all diagnoses. Conclusion: ACS technology presents significant potential as a replacement for traditional CS in 3D-MRI knee scans, allowing thinner MPRs and markedly faster scans without sacrificing diagnostic accuracy. Clinical relevance statement: 3D-ACS-MRI of the knee can be completed in the 160 s with good diagnostic consistency and image quality. 3D-MRI-MPR can replace 2D-MRI and reconstruct images with thinner slices, which helps to optimize the current MRI examination process and shorten scanning time. Key Points: • AI-assisted compressed sensing technology can reduce knee MRI scan time by over 50%. • 3D AI-assisted compressed sensing MRI and related multiplanar reconstruction can replace traditional accelerated MRI and yield thinner 2D multiplanar reconstructions. • Successful application of 3D AI-assisted compressed sensing MRI can help optimize the current knee MRI process. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Technology (Natural Science) is the property of Chongqing University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background: Cardiac MRI feature‐tracking (FT) with breath‐holding (BH) cine balanced steady state free precession (bSSFP) imaging is well established. It is unclear whether FT‐strain measurements can be reliably derived from free‐breathing (FB) compressed sensing (CS) bSSFP imaging. Purpose: To compare left ventricular (LV) strain analysis and image quality of an FB CS bSSFP cine sequence with that of a conventional BH bSSFP sequence in children. Study Type: Prospective. Subjects: 40 children able to perform BHs (cohort 1 [12.1 ± 2.2 years]) and 17 children unable to perform BHs (cohort 2 [5.2 ± 1.8 years]). Field Strength/Sequence: 3T, bSSFP sequence with and without CS. Assessment: Acquisition times and image quality were assessed. LV myocardial deformation parameters were compared between BH cine and FB CS cine studies in cohort 1. Strain indices and image quality of FB CS cine studies were also assessed in cohort 2. Intraobserver and interobserver variability of strain parameters was determined. Statistical Tests: Paired t‐test, Wilcoxon signed‐rank test, intraclass correlation coefficient (ICC), and Bland–Altman analysis. A P‐value <0.05 was considered statistically significant. Results: In cohort 1, the mean acquisition time of the FB CS cine study was significantly lower than for conventional BH cine study (15.6 s vs. 209.4 s). No significant difference were found in global circumferential strain rate (P = 0.089), global longitudinal strain rate (P = 0.366) and EuroCMR image quality scores (P = 0.128) between BH and FB sequences in cohort 1. The overall image quality score of FB CS cine in cohort 2 was 3.5 ± 0.5 with acquisition time of 14.7 ± 2.1 s. Interobserver and intraobserver variabilities were good to excellent (ICC = 0.810 to 0.943). Data Conclusion: FB CS cine imaging may be a promising alternative technique for strain assessment in pediatric patients with poor BH ability. Level of Evidence: 1 Technical Efficacy: Stage 1 [ABSTRACT FROM AUTHOR]

Purpose: To develop a highly‐accelerated, real‐time phase contrast (rtPC) MRI pulse sequence with 40 fps frame rate (25 ms effective temporal resolution). Methods: Highly‐accelerated golden‐angle radial sparse parallel (GRASP) with over regularization may result in temporal blurring, which in turn causes underestimation of peak velocity. Thus, we amplified GRASP performance by synergistically combining view‐sharing (VS) and k‐space weighted image contrast (KWIC) filtering. In 17 pediatric patients with congenital heart disease (CHD), the conventional GRASP and the proposed GRASP amplified by VS and KWIC (or GRASP + VS + KWIC) reconstruction for rtPC MRI were compared with respect to clinical standard PC MRI in measuring hemodynamic parameters (peak velocity, forward volume, backward volume, regurgitant fraction) at four locations (aortic valve, pulmonary valve, left and right pulmonary arteries). Results: The proposed reconstruction method (GRASP + VS + KWIC) achieved better effective spatial resolution (i.e., image sharpness) compared with conventional GRASP, ultimately reducing the underestimation of peak velocity from 17.4% to 6.4%. The hemodynamic metrics (peak velocity, volumes) were not significantly (p > 0.99) different between GRASP + VS + KWIC and clinical PC, whereas peak velocity was significantly (p < 0.007) lower for conventional GRASP. RtPC with GRASP + VS + KWIC also showed the ability to assess beat‐to‐beat variation and detect the highest peak among peaks. Conclusion: The synergistic combination of GRASP, VS, and KWIC achieves 25 ms effective temporal resolution (40 fps frame rate), while minimizing the underestimation of peak velocity compared with conventional GRASP. [ABSTRACT FROM AUTHOR]

This paper aims to investigate sufficient conditions for the recovery of sparse signals via the generalized orthogonal matching pursuit (gOMP) algorithm. In the noisy case, a sufficient condition for recovering the support of k-sparse signal is presented based on restricted isometry property (RIP) and restricted orthogonality constant (ROC). [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Ultrafast dynamic contrast-enhanced (UF-DCE) MRI is a new method to obtain early dynamic information on lesions at high temporal resolution without reducing spatial resolution. The kinetic parameters obtained from UF-DCE MRI can help identify benign and malignant lesions of breast and evaluate prognostic markers of breast cancer. In this paper, the technology and kinetic parameters of UF-DCE MRI are described, its application in breast cancer and the research trend of this new technology are discussed. [ABSTRACT FROM AUTHOR]

Large-aperture, lightweight, and high-resolution imaging are hallmarks of major optical systems. To eliminate aberrations, traditional systems are often bulky and complex, whereas the small volume and light weight of diffractive lenses position them as potential substitutes. However, their inherent diffraction mechanism leads to severe dispersion, which limits their application in wide spectral bands. Addressing the dispersion issue in diffractive lenses, we propose a chromatic aberration correction algorithm based on compressed sensing. Utilizing the diffractive lens's focusing ability at the reference wavelength and its degradation performance at other wavelengths, we employ compressed sensing to reconstruct images from incomplete image information. In this work, we design a harmonic diffractive lens with a diffractive order of M = 150 , an aperture of 40 mm, a focal length f 0 = 320 mm, a reference wavelength λ 0 = 550 nm, a wavelength range of 500–800 nm, and 7 annular zones. Through algorithmic recovery, we achieve clear imaging in the visible spectrum, with a peak signal-to-noise ratio (PSNR) of 22.85 dB, a correlation coefficient of 0.9596, and a root mean square error (RMSE) of 0.02, verifying the algorithm's effectiveness. [ABSTRACT FROM AUTHOR]

Channel estimation in Underwater Acoustic Communication (UAC) faces significant challenges due to the non-Gaussian, impulsive noise in ocean environments and the inherent high dimensionality of the estimation task. This paper introduces a robust channel estimation algorithm by solving an l 1 − l 1 optimization problem via the Alternating Direction Method of Multipliers (ADMM), effectively exploiting channel sparsity and addressing impulsive noise outliers. A non-monotone backtracking line search strategy is also developed to improve the convergence behavior. The proposed algorithm is low in complexity and has robust performance. Simulation results show that it exhibits a small performance deterioration of less than 1 dB for Channel Impulse Response (CIR) estimation in impulsive noise environments, nearly matching its performance under Additive White Gaussian Noise (AWGN) conditions. For Delay-Doppler (DD) doubly spread channel estimation, it maintains Bit Error Rate (BER) performance comparable to using ground truth channel information in both AWGN and impulsive noise environments. At-sea experimental validations for channel estimation in Orthogonal Frequency Division Multiplexing (OFDM) systems further underscore the fast convergence speed and high estimation accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

Background: To investigate the potential of combining compressed sensing (CS) and artificial intelligence (AI), in particular deep learning (DL), for accelerating three-dimensional (3D) magnetic resonance imaging (MRI) sequences of the knee. Methods: Twenty healthy volunteers were examined using a 3-T scanner with a fat-saturated 3D proton density sequence with four different acceleration levels (10, 13, 15, and 17). All sequences were accelerated with CS and reconstructed using the conventional and a new DL-based algorithm (CS-AI). Subjective image quality was evaluated by two blinded readers using seven criteria on a 5-point-Likert-scale (overall impression, artifacts, delineation of the anterior cruciate ligament, posterior cruciate ligament, menisci, cartilage, and bone). Using mixed models, all CS-AI sequences were compared to the clinical standard (sense sequence with an acceleration factor of 2) and CS sequences with the same acceleration factor. Results: 3D sequences reconstructed with CS-AI achieved significantly better values for subjective image quality compared to sequences reconstructed with CS with the same acceleration factor (p ≤ 0.001). The images reconstructed with CS-AI showed that tenfold acceleration may be feasible without significant loss of quality when compared to the reference sequence (p ≥ 0.999). Conclusions: For 3-T 3D-MRI of the knee, a DL-based algorithm allowed for additional acceleration of acquisition times compared to the conventional approach. This study, however, is limited by its small sample size and inclusion of only healthy volunteers, indicating the need for further research with a more diverse and larger sample. Trial registration: DRKS00024156. Relevance statement: Using a DL-based algorithm, 54% faster image acquisition (178 s versus 384 s) for 3D-sequences may be possible for 3-T MRI of the knee. Key points: • Combination of compressed sensing and DL improved image quality and allows for significant acceleration of 3D knee MRI. • DL-based algorithm achieved better subjective image quality than conventional compressed sensing. • For 3D knee MRI at 3 T, 54% faster image acquisition may be possible. [ABSTRACT FROM AUTHOR]

Scaling technology and shrinking transistor size have enabled the integration of multicore modules on a single chip for high-performance computing. Wireless Network-On-Chips has been demonstrated to be a viable choice for on-chip communication compared with wired communication, considering latency, energy, and data rate as performance metrics. Limitations in on–off keying modulation schemes have been addressed using OFDM modulation methods. In this paper, a new method based on the compressed sensing integrated dual tree complex wavelet transform (CS-DTCWT) is presented for OFDM modulation and demodulation operating in the mm-wave band. The CS-DTCWT-based OFDM model is developed in MATLAB and evaluated for its performance in the mm-wave operating frequency band of 20–60 GHz and for subcarriers of 128–1024. The BER performances of CS-DTCWT-based OFDM are demonstrated to be an improvement of 80% compared to FFT-based OFDM techniques. In addition, it can save 3.11% more energy than existing works. The proposed OFDM model is suitable for wireless NOC applications. [ABSTRACT FROM AUTHOR]

In the paper, we investigate a massive machine-type communication (mMTC), where numerous single-antenna users communicate with a single-antenna base station while being active. However, the status of user can undergoes multiple transitions between active and inactive states across whole consecutive intervals. Then, we formulate the problem of joint user activity detection and channel estimation within the dynamic compressed sensing (DCS) framework, considering the temporally-correlated user activity across the entire consecutive intervals. To be specific, we introduce a new hybrid vector approximate message passing algorithm for DCS (HyVAMP-DCS). The proposed algorithm comprises a VAMP block for estimating channel and a loopy belief propagation (LBP) block for detecting user activity. Moreover, these two blocks can exchange messages, enhancing the performance of both channel estimation and user activity detection. Importantly, compared to the fragile GAMP algorithm, VAMP is robust and applicable to a much broader class of large random matrices. Furthermore, the fixed points of VAMP's state evolution align with the replica prediction of the minimum mean-squared error. The simulation results illustrate the superiority of HyVAMP-DCS, demonstrating its significant outperformance over HyGAMP-DCS. [ABSTRACT FROM AUTHOR]

Traditional bridge health monitoring methods that necessitate sensor installation are not only costly but also time-consuming. In contrast, utilizing smartphone data collected from vehicles as they traverse bridges offers an efficient and cost-effective alternative. This paper introduces a cutting-edge damage detection framework for indirect monitoring of bridge structures, leveraging a substantial volume of acceleration data collected from smartphones in vehicles passing over the bridge. Our innovative approach addresses the challenge of collecting and transmitting high-frequency data while preserving smartphone battery life and data plans through the integration of compressed sensing (CS) into the crowdsensing-based monitoring framework. CS employs random sampling and signal recovery from a significantly reduced number of samples compared to the requirements of the Nyquist–Shannon sampling theorem. In the proposed framework, acceleration signals from vehicles are initially acquired using smartphone sensors, undergo compression, and are then transmitted for signal reconstruction. Subsequently, feature extraction and dimensionality reduction are performed using Mel-frequency cepstral coefficients and principal component analysis. Damage indexes are computed based on the dissimilarity between probability distribution functions utilizing the Wasserstein distance metric. The efficacy of the proposed methodology in bridge monitoring has been substantiated through the utilization of numerical models and a lab-scale bridge. Furthermore, the feasibility of implementing the framework in a real-world application has been investigated, leveraging the smartphone data from 102 vehicle trips on the Golden Gate Bridge. The results demonstrate that damage detection using the reconstructed signals obtained through compressed sensing achieves comparable performance to that obtained with the original data sampled at the Nyquist measurement sampling rate. However, it is observed that to retain severity information within the signals for accurate damage severity identification, the compression level should be limited to 20%. These findings affirm that compressed sensing significantly reduces the data collection requirements for crowdsensing-based monitoring applications, without compromising the accuracy of damage detection while preserving essential damage-sensitive information within the dataset. [ABSTRACT FROM AUTHOR]

EEG signals combined with deep learning play an important role in the study of human–computer interaction. However, the limited dataset makes it challenging to study EEG signals using deep learning methods. Inspired by the GAN network in image generation, this paper presents an improved generative adversarial network model L-C-WGAN-GP to generate artificial EEG data to augment training sets and improve the application of BCI in various fields. The generator consists of a long short-term memory (LSTM) network and the discriminator consists of a convolutional neural network (CNN) which uses the gradient penalty-based Wasserstein distance as the loss function in model training. The model can learn the statistical features of EEG signals and generate EEG data that approximate real samples. In addition, the performance of the compressed sensing reconstruction model can be improved by using augmented datasets. Experiments show that, compared with the existing advanced data amplification techniques, the proposed model produces EEG signals closer to the real EEG signals as measured by RMSE, FD and WTD indicators. In addition, in the compressed reconstruction of EEG signals, adding the new data reduces the loss by about 15% compared with the original data, which greatly improves the reconstruction accuracy of the EEG signals' compressed sensing. [ABSTRACT FROM AUTHOR]

Microphone array-based beamforming algorithms are widely used in sound source identification, fault diagnosis, and radar communication because of their excellent performance. However, their limited spatial resolution and high dynamic side flap level seriously affect the recognition accuracy. To explore a high-performance beamforming sound source identification algorithm, the microphone array compressed beamforming underdetermined equation is solved by extending the iterative threshold. A sound source identification model is established, and a new compressed beamforming (CSB-II) algorithm is proposed. Numerical simulations show that the CSB-II algorithm can effectively reduce the starting frequency of sound source identification and has high sound source identification accuracy. The effects of signal-to-noise ratio, sound source distance, and array number on sound source identification accuracy are analyzed separately. The laws affecting sound source identification accuracy are derived from guiding actual sound source measurements. [ABSTRACT FROM AUTHOR]

This paper studies the ℓ 1 - α ℓ 2 local minimization model for α ∈ (0 , 2 ] , which is the first time to consider the case of α > 1 . We obtain the necessary and sufficient conditions for a fixed sparse signal to be recovered from this model. Based on this condition, we also obtain the necessary and sufficient conditions for any k-sparse signal to be recovered from ℓ 1 - α ℓ 2 local minimization model with 0 < α < 1 , α = 1 and 1 < α ≤ 2 . The experimental data show that the size of α is positively correlated with the success rate of signal recovery. [ABSTRACT FROM AUTHOR]

The relaxed CQ algorithm is one of the most important algorithms for solving the split feasibility problem. We study the issue of strong convergence of the relaxed CQ algorithm in Hilbert spaces together with estimates on the convergence rate. Under a kind of Hölderian type bounded error bound property, strong convergence of the relaxed CQ algorithm is established. Furthermore, qualitative estimates on the convergence rate is presented. In particular, for the case when the involved exponent is equal to 1, the linear convergence of the relaxed CQ algorithm is established. Finally, numerical experiments are performed to show the convergence property of the relaxed CQ algorithm for the compressed sensing problem. [ABSTRACT FROM AUTHOR]

Connectome spectrum electromagnetic tomography (CSET) combines diffusion MRI‐derived structural connectivity data with well‐established graph signal processing tools to solve the M/EEG inverse problem. Using simulated EEG signals from fMRI responses, and two EEG datasets on visual‐evoked potentials, we provide evidence supporting that (i) CSET captures realistic neurophysiological patterns with better accuracy than state‐of‐the‐art methods, (ii) CSET can reconstruct brain responses more accurately and with more robustness to intrinsic noise in the EEG signal. These results demonstrate that CSET offers high spatio‐temporal accuracy, enabling neuroscientists to extend their research beyond the current limitations of low sampling frequency in functional MRI and the poor spatial resolution of M/EEG. [ABSTRACT FROM AUTHOR]

Diffusion Spectrum Imaging (DSI) using dense Cartesian sampling of q‐space has been shown to provide important advantages for modeling complex white matter architecture. However, its adoption has been limited by the lengthy acquisition time required. Sparser sampling of q‐space combined with compressed sensing (CS) reconstruction techniques has been proposed as a way to reduce the scan time of DSI acquisitions. However prior studies have mainly evaluated CS‐DSI in post‐mortem or non‐human data. At present, the capacity for CS‐DSI to provide accurate and reliable measures of white matter anatomy and microstructure in the living human brain remains unclear. We evaluated the accuracy and inter‐scan reliability of 6 different CS‐DSI schemes that provided up to 80% reductions in scan time compared to a full DSI scheme. We capitalized on a dataset of 26 participants who were scanned over eight independent sessions using a full DSI scheme. From this full DSI scheme, we subsampled images to create a range of CS‐DSI images. This allowed us to compare the accuracy and inter‐scan reliability of derived measures of white matter structure (bundle segmentation, voxel‐wise scalar maps) produced by the CS‐DSI and the full DSI schemes. We found that CS‐DSI estimates of both bundle segmentations and voxel‐wise scalars were nearly as accurate and reliable as those generated by the full DSI scheme. Moreover, we found that the accuracy and reliability of CS‐DSI was higher in white matter bundles that were more reliably segmented by the full DSI scheme. As a final step, we replicated the accuracy of CS‐DSI in a prospectively acquired dataset (n = 20, scanned once). Together, these results illustrate the utility of CS‐DSI for reliably delineating in vivo white matter architecture in a fraction of the scan time, underscoring its promise for both clinical and research applications. [ABSTRACT FROM AUTHOR]

This paper proposes a dual-channel speech separation method based on spatial estimation via sparse Bayesian inference (SBI) and nonnegative matrix factorization (NMF). The spatial information estimated by traditional compressed sensing (CS) models is insufficient when two microphones receive limited columns of mixed signals. Considering the sparsity of peak values in the cross-correlation spectrum between two received signals, the proposed method builds a new CS model based on cross-correlation spectrum and applies SBI algorithm to solve this model to improve the estimation accuracy of spatial information. Combined the spatial information with the spectral features decomposed by NMF, NMF coefficient matrix masks belonging to individual source are generated for pre-separation. To mitigate retained potential interference components, a post-separation processing stage is designed using an expectation maximization (EM) algorithm based on a Gaussian mixture model (GMM). The estimated spatial information and binary time–frequency masks are used for parameter initialization of the EM algorithm. The experimental results using real-world speech data show that the proposed method can achieve better separation performance compared to various existing methods. [ABSTRACT FROM AUTHOR]

Compressed Sensing (CS) encompasses a broad array of theoretical and applied techniques for recovering signals, given partial knowledge of their coefficients, cf. Candés (C. R. Acad. Sci. Paris, Ser. I 346, 589–592 (2008)), Candés et al. (IEEE Trans. Inf. Theo (2006)), Donoho (IEEE Trans. Inf. Theo. 52(4), (2006)), Donoho et al. (IEEE Trans. Inf. Theo. 52(1), (2006)). Its applications span various fields, including mathematics, physics, engineering, and several medical sciences, cf. Adcock and Hansen (Compressive Imaging: Structure, Sampling, Learning, p. 2021), Berk et al. (2019 13th International conference on Sampling Theory and Applications (SampTA) pp. 1-5. IEEE (2019)), Brady et al. (Opt. Express 17(15), 13040–13049 (2009)), Chan (Terahertz imaging with compressive sensing. Rice University, USA (2010)), Correa et al. (2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) pp. 7789–7793 (2014, May) IEEE), Gao et al. (Nature 516(7529), 74–77 (2014)), Liu and Kang (Opt. Express 18(21), 22010–22019 (2010)), McEwen and Wiaux (Mon. Notices Royal Astron. Soc. 413(2), 1318–1332 (2011)), Marim et al. (Opt. Lett. 35(6), 871–873 (2010)), Yu and Wang (Phys. Med. Biol. 54(9), 2791 (2009)), Yu and Wang (Phys. Med. Biol. 54(9), 2791 (2009)). Motivated by our interest in the mathematics behind Magnetic Resonance Imaging (MRI) and CS, we employ convex analysis techniques to analytically determine equivalents of Lagrange multipliers for optimization problems with inequality constraints, specifically a weighted LASSO with voxel-wise weighting. We investigate this problem under assumptions on the fidelity term A x - b 2 2 , either concerning the sign of its gradient or orthogonality-like conditions of its matrix. To be more precise, we either require the sign of each coordinate of 2 (A x - b) T A to be fixed within a rectangular neighborhood of the origin, with the side lengths of the rectangle dependent on the constraints, or we assume A T A to be diagonal. The objective of this work is to explore the relationship between Lagrange multipliers and the constraints of a weighted variant of LASSO, specifically in the mentioned cases where this relationship can be computed explicitly. As they scale the regularization terms of the weighted LASSO, Lagrange multipliers serve as tuning parameters for the weighted LASSO, prompting the question of their potential effective use as tuning parameters in applications like MR image reconstruction and denoising. This work represents an initial step in this direction. [ABSTRACT FROM AUTHOR]

The global sparse representation method based on compressed sensing fails to capture the local texture and detail structure of an image. To address this, a local dictionary learning method based on the wavelet domain is proposed. The wavelet highfrequency subband sub-block classification and local dictionary learning are implemented using the FCM clustering method and K-L method, respectively. At the reconstruction end, a compressed sampling Matching pursuit algorithm based on iterative update of sparsity is proposed. This adaptive iteration can effectively reconstruct the original image under unknown sparsity conditions. Simulation experiments show that compared to existing reconstruction methods, this approach has the advantages of simple computation, strong adaptive sparse representation ability for the original image, and superior reconstructed image performance. [ABSTRACT FROM AUTHOR]

Multiple-quantum-filtered (MQF) sodium magnetic resonance imaging (MRI), such as enhanced single-quantum and triple-quantum-filtered imaging of 23Na (eSISTINA), enables images to be weighted towards restricted sodium, a promising biomarker in clinical practice, but often suffers from clinically infeasible acquisition times and low image quality. This study aims to mitigate the above limitation by implementing a novel eSISTINA sequence at 7 T with the application of compressed sensing (CS) to accelerate eSISTINA acquisitions without a noticeable loss of information. A novel eSISTINA sequence with a 3D spiral-based sampling scheme was implemented at 7 T for the application of CS. Fully sampled datasets were obtained from one phantom and ten healthy subjects, and were then retrospectively undersampled by various undersampling factors. CS undersampled reconstructions were compared to fully sampled and undersampled nonuniform fast Fourier transform (NUFFT) reconstructions. Reconstruction performance was evaluated based on structural similarity (SSIM), signal-to-noise ratio (SNR), weightings towards total and compartmental sodium, and in vivo quantitative estimates. CS-based phantom and in vivo images have less noise and better structural delineation while maintaining the weightings towards total, non-restricted (predominantly extracellular), and restricted (primarily intracellular) sodium. CS generally outperforms NUFFT with a higher SNR and a better SSIM, except for the SSIM in TQ brain images, which is likely due to substantial noise contamination. CS enables in vivo quantitative estimates with <15% errors at an undersampling factor of up to two. Successful implementation of an eSISTINA sequence with an incoherent sampling scheme at 7 T was demonstrated. CS can accelerate eSISTINA by up to twofold at 7 T with reduced noise levels compared to NUFFT, while maintaining major structural information, reasonable weightings towards total and compartmental sodium, and relatively reliable in vivo quantification. The associated reduction in acquisition time has the potential to facilitate the clinical applicability of MQF sodium MRI. [ABSTRACT FROM AUTHOR]

Objective: We aimed to compare the image quality and focal lesion detection ability of hepatobiliary phase (HBP) images obtained using compressed sensing (CS) and controlled aliasing in parallel imaging results in higher acceleration (CAIPIRINHA) in patients with liver cirrhosis. Materials and methods: We retrospectively included 244 gadoxetic acid–enhanced liver MRI from 244 patients with cirrhosis obtained by two HBP images using CS and CAIPIRINHA from July 2020 to December 2020. The optimized resolution and scan time for CS–HBP and CAIPIRINHA–HBP were 0.9 × 0.9 × 1.5 mm3 and 15 s and 1.3 × 1.3 × 3 mm3 and 16 s, respectively. We compared the image quality between the two sets of images in 244 patients and focal lesion (n = 294) analyses for 112 patients. Results: CS–HBP showed comparable overall image quality (3.7 ± 0.9 vs. 3.6 ± 0.8, p = 0.680), superior liver edge sharpness (3.9 ± 0.6 vs. 3.6 ± 0.5, p < 0.001), and fewer respiratory motion artifacts (4.0 ± 0.7 vs. 3.8 ± 0.5, p < 0.001), but higher non-respiratory artifacts (3.4 ± 0.7 vs. 3.6 ± 0.6, p < 0.001) and subjective image noise (3.5 ± 0.8 vs. 3.6 ± 0.7, p = 0.014) than CAIPIRINHA–HBP. CS–HBP showed a higher signal-to-noise ratio in the liver than CAIPIRINHA–HBP (20.9 ± 9.0 vs. 18.9 ± 7.1, p = 0.008). The pooled sensitivity, specificity, and AUC were 90.0%, 77.5%, and 0.84 for CS–HBP and 73.5%, 82.4%, and 0.78 for CAIPIRINHA–HBP, respectively. Conclusions: CS–HBP showed better focal lesion detection ability, comparable overall image quality, and fewer respiratory motion artifacts, but higher non-respiratory artifacts and noise compared to CAIPIRINHA–HBP. Thus, CS-HBP could be recommended for liver MRI in patients with cirrhosis to improve diagnostic performance. Clinical relevance statement: Thin-slice CS–HBP may be useful for detecting sub-centimeter hepatocellular carcinoma in cirrhotic patients with Child-Pugh classification A while maintaining comparable subjective image quality. Key Points: • Compared with controlled aliasing in parallel imaging results in higher acceleration, compressed sensing hepatobiliary phase yielded thinner slices and shorter scan time at a higher accelerating factor. • Compressed sensing hepatobiliary phase showed comparable overall image quality, superior liver edge sharpness, and fewer respiratory motion artifacts, but higher non-respiratory artifacts and subjective image noise than controlled aliasing in parallel imaging results in higher acceleration-hepatobiliary phase. • Compressed sensing hepatobiliary phase can detect sub-centimeter hepatocellular carcinoma in cirrhotic patients with Child-Pugh classification A. [ABSTRACT FROM AUTHOR]

The authors study the problem of compressive target detection in a single‐frequency network (SFN)‐based multistatic passive radar system (MS‐PRS) consisting of multiple illuminators of opportunity (IOs) and one receiver. Firstly, a generalised likelihood ratio test (GLRT)‐based SFN‐based compressive subspace detector (SFN‐CSD) is derived by exploiting the sparsity of the target echoes for the case of known noise variance. When the noise variance is unknown, an SFN‐based unknown‐noise (UN) compressive subspace detector is proposed, referred to as the SFN‐UNCSD. Moreover, closed‐form expressions of the probability of false alarm and detection of the proposed detectors are deriived. It is proved that the SNF‐UNCSD has a constant false alarm rate (CFAR) property. Finally, numerical simulations are conducted to verify the theoretical analysis and illustrate the performance of the proposed detector relative to several benchmark detectors. [ABSTRACT FROM AUTHOR]

Scalable numerical solutions to the time dependent Schrodinger equation remain an outstanding goal in theoretical chemistry. Here we present a method which utilises recent breakthroughs in signal processing to consistently adapt a dictionary of basis functions to the dynamics of the system. We show that for two low-dimensional model problems the size of the basis set does not grow quickly with time and appears only weakly dependent on dimensionality. The generality of this finding remains to be seen. The method primarily uses energies and gradients of the potential, opening the possibility for its use in on-the-fly ab initio quantum wavepacket dynamics. [ABSTRACT FROM AUTHOR]