Search

Binding energies of radicals and molecules at dust grain surfaces are important parameters for understanding and modeling the chemical inventory of interstellar gas clouds. While first-principles methods can reliably be used to compute such binding energies, the complex structure and varying sizes and stoichiometries of realistic dust grains make a complete characterization of all adsorption sites exposed by their surfaces challenging. Here, we focus on nanoclusters composed of Mg-rich silicates as models of interstellar dust grains and two adsorbates of particular astrochemical relevance; H and CO. We employ a compressed sensing method to identify descriptors for the binding energies, which are expressed as analytical functions of intrinsic properties of the clusters, obtainable through a single first-principles calculation of the cluster. The descriptors are identified based on a diverse training dataset of binding energies at low-energy structures of nanosilicate clusters, where the latter structures were obtained using a first-principles-based global optimization method. The composition of the descriptors reveals how electronic, electrostatic, and geometric properties of the nanosilicates control the binding energies and demonstrates distinct physical origins of the bond formation for H and CO. The predictive performance of the descriptors is found to be limited by cluster reconstruction, e.g., breaking of internal metal–oxygen bonds, upon the adsorption event, and strategies to account for this phenomenon are discussed. The identified descriptors and the computed datasets of stable nanosilicate clusters along with their binding energies are expected to find use in astrochemical models of reaction networks occurring at silicate grain surfaces. [ABSTRACT FROM AUTHOR]

A similarity-driven multi-dimensional binning algorithm (SIMBA) reconstruction of free-running cardiac magnetic resonance imaging data was previously proposed. While very efficient and fast, the original SIMBA focused only on the reconstruction of a single motion-consistent cluster, discarding the remaining data acquired. However, the redundant data clustered by similarity may be exploited to further improve image quality. In this work, we propose a novel compressed sensing (CS) reconstruction that performs an effective regularization over the clustering dimension, thanks to the integration of inter-cluster motion compensation (XD-MC-SIMBA). This reconstruction was applied to free-running ferumoxytol-enhanced datasets from 24 patients with congenital heart disease, and compared to the original SIMBA, the same XD-MC-SIMBA reconstruction but without motion compensation (XD-SIMBA), and a 5D motion-resolved CS reconstruction using the free-running framework (FRF). The resulting images were compared in terms of lung-liver and blood-myocardium sharpness, blood-myocardium contrast ratio, and visible length and sharpness of the coronary arteries. Moreover, an automated image quality score (IQS) was assigned using a pretrained deep neural network. The lung-liver sharpness and blood-myocardium sharpness were significantly higher in XD-MC-SIMBA and FRF. Consistent with these findings, the IQS analysis revealed that image quality for XD-MC-SIMBA was improved in 18 of 24 cases, compared to SIMBA. We successfully tested the hypothesis that multiple motion-consistent SIMBA clusters can be exploited to improve the quality of ferumoxytol-enhanced cardiac MRI when inter-cluster motion-compensation is integrated as part of a CS reconstruction. [ABSTRACT FROM AUTHOR]

The Dai and Yuan conjugate gradient (CG) method is one of the classical CG algorithms using the numerator ‖gk+1‖2. When the usual Wolfe line search is used, the algorithm is shown to satisfy the descent condition and to converge globally when the Lipschitz condition is assumed. Despite these two advantages, the Dai-Yuan algorithm performs poorly numerically due to the jamming problem. This work will present an efficient variant of the Dai-Yuan CG algorithm that solves a nonlinear constrained monotone system (NCMS) and resolves the aforementioned problems. Our variant algorithm, like the unmodified version, converges globally when the Lipschitz condition and sufficient descent requirements are satisfied, regardless of the line search method used. Numerical computations utilizing algorithms from the literature show that this variant algorithm is numerically robust. Finally, the variant algorithm is used to reconstruct sparse signals in compressed sensing (CS) problems. [ABSTRACT FROM AUTHOR]

Heat diffusion processes have found wide applications in modelling dynamical systems over graphs. In this paper, we consider the recovery of a |$k$| -bandlimited graph signal that is an initial signal of a heat diffusion process from its space–time samples. We propose three random space–time sampling regimes, termed dynamical sampling techniques, that consist in selecting a small subset of space–time nodes at random according to some probability distribution. We show that the number of space–time samples required to ensure stable recovery for each regime depends on a parameter called the spectral graph weighted coherence, which depends on the interplay between the dynamics over the graphs and sampling probability distributions. In optimal scenarios, as little as |$\mathcal{O}(k \log (k))$| space–time samples are sufficient to ensure accurate and stable recovery of all |$k$| -bandlimited signals. Dynamical sampling typically requires much fewer spatial samples than the static case by leveraging the temporal information. Then, we propose a computationally efficient method to reconstruct |$k$| -bandlimited signals from their space–time samples. We prove that it yields accurate reconstructions and that it is also stable to noise. Finally, we test dynamical sampling techniques on a wide variety of graphs. The numerical results on synthetic and real climate datasets support our theoretical findings and demonstrate the efficiency. [ABSTRACT FROM AUTHOR]

The large amount of sampled data in coherent phase-sensitive optical time-domain reflectometry (Φ-OTDR) brings heavy data transmission, processing, and storage burdens. By using the comparator combined with undersampling, we achieve simultaneous reduction of sampling rate and sampling resolution in hardware, thus greatly decreasing the sampled data volume. But this way will inevitably cause the deterioration of detection signal-to-noise ratio (SNR) due to the quantization noise's dramatic increase. To address this problem, denoising the demodulated phase signals using compressed sensing, which exploits the sparsity of spectrally sparse vibration, is proposed, thereby effectively enhancing the detection SNR. In experiments, the comparator with a sampling parameter of 62.5 MS/s and 1 bit successfully captures the 80 MHz beat signal, where the sampled data volume per second is only 7.45 MB. Then, when the piezoelectric transducer's driving voltage is 1 Vpp, 300 mVpp, and 100 mVpp respectively, the SNRs of the reconstructed 200 Hz sinusoidal signals are respectively enhanced by 23.7 dB, 26.1 dB, and 28.7 dB by using compressed sensing. Moreover, multi-frequency vibrations can also be accurately reconstructed with a high SNR. Therefore, the proposed technique can effectively enhance the system's performance while greatly reducing its hardware burden. [ABSTRACT FROM AUTHOR]

The use of Block Compressed Sensing (BCS) as an alternative to conventional Compressed Sensing (CS) in image sampling and acquisition has gained attention due to its potential benefits. However, BCS can suffer from blocking artifacts and blurs in the reconstructed images, which can degrade the overall image quality. To address these issues and improve reconstruction performance, Adaptive Block Compressed Sensing (ABCS) techniques can be used. ABCS minimizes the blurs and artifacts that occur during the reconstruction process by adaptively selecting samples from different image blocks. To further enhance the sampling efficiency and overall performance in underwater image compression, a new approach called adaptive reweighted sampling-based ABCS (ARS-ABCS) in Fast Haar Wavelet Transform (FHWT) domain is proposed in the paper. This reweighting process allows the system to allocate more samples to the areas where reconstruction quality is low or artifacts are prevalent, improving the overall image reconstruction in a targeted manner. Performance is measured in terms of Peak Signal to Noise Ratio (PSNR), Structural SIMilarity index (SSIM), Normalized Cross-Correlation (NCC) and Normalized Absolute Error (NAE). The results demonstrate that the proposed ARS-ABCS has achieved 1.5 to 5dB increase in PSNR with respect to other non-weighted adaptive schemes. It has produced space saving of 60 to 70% with utilization of only around 30% of total samples in the image. SSIM and NCC values obtained are closer to 1 with low NAE values. [ABSTRACT FROM AUTHOR]

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]

Compressive sensing provides a promising sampling paradigm for video acquisition for resource‐limited sensor applications. However, the reconstruction of original video signals from sub‐sampled measurements is still a great challenge. To exploit the temporal redundancies within videos during the recovery, previous works tend to perform alignment on initial reconstructions, which are too coarse to provide accurate motion estimations. To solve this problem, the authors propose a novel reconstruction network, named TSRN, for compressive video sensing. Specifically, the authors utilise a number of stacked temporal shift reconstruction blocks (TSRBs) to enhance the initial reconstruction progressively. Each TSRB could learn the temporal structures by exchanging information with last and next time step, and no additional computations is imposed on the network compared to regular 2D convolutions due to the high efficiency of temporal shift operations. After the enhancement, a bidirectional alignment module to build accurate temporal dependencies directly with the help of optical flows is employed. Different from previous methods that only extract supplementary information from the key frames, the proposed alignment module can receive temporal information from the whole video sequence via bidirectional propagations, thus yielding better performance. Experimental results verify the superiority of the proposed method over other state‐of‐the‐art approaches quantitatively and qualitatively. [ABSTRACT FROM AUTHOR]

In this article, two Hager–Zhang (HZ) type projection algorithms are presented for large-dimension nonlinear monotone problems and sparse signal recovery in compressed sensing. This goal is attained by conducting singular value analysis of a nonsingular HZ-type search direction matrix as well as applying the idea by Piazza and Politi [J Comput Appl Math. 2002;143(1):141–144] and minimizing the Frobenius norm of an orthornormal matrix. The paper attempts to fill the gap in the work of Hager and Zhang [Pac J Optim. 2006;2(1):35–58], Waziri et al. [Appl Math Comput. 2019;361:645–660], Sabi'u et al. [Appl Numer Math. 2020;153:217–233] and Babaie-Kafaki [4OR-Q J Oper Res. 2014;12:285-292], where the sufficient descent or global convergence condition is not satisfied when the HZ parameter is in the interval $ (0,\frac {1}{4}) $ (0 , 1 4). The proposed schemes are also suitable for solving non-smooth nonlinear problems. Also, by employing some mild conditions, global convergence of the schemes are established, while numerical comparison with four effective HZ-type methods show that the new methods are efficient. Furthermore, to illustrate their practical application, both methods are applied to solve the $ \ell _1 $ ℓ 1 -norm regularization problems to recover a sparse signal in compressive sensing. The experiments conducted in that regard show that the methods are promising and perform better than two other methods in the literature. [ABSTRACT FROM AUTHOR]

In the multi-target scenarios, we consider the problem of constant false alarm rate (CFAR) target detection. For the conventional CFAR algorithms, the multi-target detection performance is mainly limited by the interference target tolerance within the reference window. In this paper, we propose a local ordered statistic CFAR (OS-CFAR) target detector based on compressed sensing (CS) radar system to address the degradation of detection performance in multi-target scenarios. With the analog-information-converter (AIC), the radar intermediate frequency (IF) signal is compressively sampled into discrete linear measurements. At each detection stage, multiple signal components are generated by correlation tests between the sensing matrix and linear measurements. By support set merge and proxy pruning, the signal components with the largest energy are retained. These components are the echoes reflected from the targets. Since target components are output in decreasing order of correlation, the proposed detector only requires a local OS-CFAR decision in the interval where the least correlated target is located, rather than traversing the entire interval. By continuously updating the detection stage, all targets that satisfy the false alarm rate requirement can be screened out. Finally, the performance of the proposed detector in the multi-target scenarios is confirmed by simulation results. [ABSTRACT FROM AUTHOR]

Geophysical prospecting signals encompass subsurface structural information and incorporate textual messages generated in accordance with a specific pattern. These signals can be employed in places without radio access to ensure public and worker safety. Therefore, the use of seismic signals to transmit information through the earth has attracted the attention of researchers in the last decade. Presently, achievements in seismic communication are mainly in the coding, generation, and propagation of seismic signals. Little work has been done on methods to convert seismic signals generated by vibroseis sources into text and broadcast them vocally. Therefore, we built a seismic communication system with 6‐bit code using the American Standard Code for Information Interchange. To better recommend the seismic communication system scheme, the origin, state and principles of seismic communication system are illustrated in detail. Then, a seismic transmitting system is devised with a 500 N vibroseis source, which compiles seismic signals through amplitude modulation. After seismic signals propagate through the earth, they are received by geophones and recorded in seismographs. Through data acquisition based on a compression algorithm, seismic signals are converted into text and voice signals, which significantly reduces the storage and transmission of seismic data. [ABSTRACT FROM AUTHOR]

This paper introduces a nonconvex ℓ1−2-analysis model: minx(∥D∗x∥ 1 −∥D∗x∥ 2)s.t. Ax = y, where A is a measurement matrix and D is a tight frame. Our main motivation is to generalize the sparse recovery via ℓ1 − ℓ2 minimization to this new model. As a nonconvex model, it is well known that its global minimizer and local minimizer are usually inconsistent. This paper provides a type of null space property (NSP) characterization which are necessary and sufficient conditions for the measurement matrix A such that a vector x can be recovered from Ax with a tight frame D via ℓ1−2-analysis local minimization, or any vector x can be uniformly recovered from Ax with a tight frame D via ℓ1−2-analysis minimization locally and globally. [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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

This paper concentrates on the recovery of block-sparse signals, which are not only sparse but also nonzero elements are arrayed into some blocks (clusters) rather than being arbitrary distributed all over the vector, from linear measurements. We establish high-order sufficient conditions based on block RIP, which could ensure the exact recovery of every block s-sparse signal in the noiseless case via mixed l 2 / l p {l_{2}/l_{p}} minimization method, and the stable and robust recovery in the case that signals are not accurately block-sparse in the presence of noise. Additionally, a lower bound on necessary number of random Gaussian measurements is gained for the condition to be true with overwhelming probability. Furthermore, a series of numerical experiments are conducted to demonstrate the performance of the mixed l 2 / l p {l_{2}/l_{p}} minimization. To the best of the authors’ knowledge, the recovery guarantees established in this paper are superior to those currently available. [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]

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]

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]

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 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]

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]

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]

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]

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]

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]

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]

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]

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]

To assess whether diffusion-weighted imaging (DWI) with Compressed SENSE (CS) and deep learning (DL-CS-DWI) can improve image quality and lesion detection in patients at risk for hepatocellular carcinoma (HCC). This single-center prospective study enrolled consecutive at-risk participants who underwent 3.0 T gadoxetate disodium-enhanced MRI. Conventional DWI was acquired using parallel imaging (PI) with SENSE (PI-DWI). In CS-DWI and DL-CS-DWI, CS but not PI with SENSE was used to accelerate the scan with 2.5 as the acceleration factor. Qualitative and quantitative image quality were independently assessed by two masked reviewers, and were compared using the Wilcoxon signed-rank test. The detection rates of clinically-relevant (LR-4/5/M based on the Liver Imaging Reporting and Data System v2018) liver lesions for each DWI sequence were independently evaluated by another two masked reviewers against their consensus assessments based on all available non-DWI sequences, and were compared by the McNemar test. 67 participants (median age, 58.0 years; 56 males) with 197 clinically-relevant liver lesions were enrolled. Among the three DWI sequences, DL-CS-DWI showed the best qualitative and quantitative image qualities (p range, <0.001–0.039). For clinically-relevant liver lesions, the detection rates (91.4%–93.4%) of DL-CS-DWI showed no difference with CS-DWI (87.3%–89.8%, p = 0.230–0.231) but were superior to PI-DWI (82.7%–85.8%, p = 0.015–0.025). For lesions located in the hepatic dome, DL-CS-DWI demonstrated the highest detection rates (94.8%–97.4% vs 76.9%–79.5% vs 64.1%–69.2%, p = 0.002–0.045) among the three DWI sequences. In patients at high-risk for HCC, DL-CS-DWI improved image quality and detection for clinically-relevant liver lesions, especially for the hepatic dome. • DWI with CS and DL demonstrated superior image quality compared to CS-DWI and conventional DWI. • DL-CS-DWI improved detection rate for clinically-relevant liver lesions, especially in hepatic dome, compared to CS-DWI and conventional DWI. • Deep learning combined with compressive SENSE could improve the overall performance of liver DWI. [ABSTRACT FROM AUTHOR]

Magnetic resonance imaging produces detailed anatomical and physiological images of the human body that can be used in the clinical diagnosis and treatment of diseases. However, MRI suffers its comparatively longer acquisition time than other imaging methods and is thus vulnerable to motion artifacts, which ultimately lead to likely failed or even wrong diagnosis. In order to perform faster reconstruction, deep learning-based methods along with traditional strategies such as parallel imaging and compressed sensing come into play in recent years in this field. Meanwhile, in order to better analyze the diseases, it is also often necessary to acquire images in the same region of interest under different modalities, which yield images with different contrast levels. However, most of these aforementioned methods tend to use single-modal images for reconstruction, neglecting the correlation and redundancy information embedded in MR images acquired with different modalities. While there are works on multi-modal reconstruction, the information is yet to be efficiently explored. In this paper, we propose an end-to-end neural network called MLMFNet, which helps the reconstruction of the target modality by using information from the auxiliary modality across feature channels and layers. Specifically, this is highlighted by three components: (I) An encoder based on UNet with a single-stream strategy that fuses auxiliary and target modalities; (II) a decoder that tends to multi-level features from all layers of the encoder, and (III) a channel attention module. Quantitative and qualitative analyses are performed on a public brain dataset and knee brain dataset, which show that the proposed method achieves satisfying results in MRI reconstruction within the multi-modal context, and also demonstrate its effectiveness and potential to be used in clinical practice. [ABSTRACT FROM AUTHOR]

Further acceleration of DWI in diagnostic radiology is desired but challenging mainly due to low SNR in high b-value images and associated bias in quantitative ADC values. Deep learning-based reconstruction and denoising may provide a solution to address this challenge. The effects of SNR reduction on ADC bias and variability were investigated using a commercial diffusion phantom and numerical simulations. In the phantom, performance of different reconstruction methods, including conventional parallel (SENSE) imaging, compressed sensing (C-SENSE), and compressed SENSE acceleration with an artificial intelligence deep learning-based technique (C-SENSE AI), was compared at different acceleration factors and flip angles using ROI-based analysis. ADC bias was assessed by Lin's Concordance correlation coefficient (CCC) followed by bootstrapping to calculate confidence intervals (CI). ADC random measurement error (RME) was assessed by the mean coefficient of variation (CV ¯) and non-parametric statistical tests. The simulations predicted increasingly negative bias and loss of precision towards lower SNR. These effects were confirmed in phantom measurements of increasing acceleration, for which CCC decreased from 0.947 to 0.279 and CV ¯ increased from 0.043 to 0.439, and of decreasing flip angle, for which CCC decreased from 0.990 to 0.063 and CV ¯ increased from 0.037 to 0.508. At high acceleration and low flip angle, C-SENSE AI reconstruction yielded best denoised ADC maps. For the lowest investigated flip angle, CCC = {0.630, 0.771 and 0.987} and CV ¯ ={0.508, 0.426 and 0.254} were obtained for {SENSE, C-SENSE, C-SENSE AI}, the improvement by C-SENSE AI being significant as compared to the other methods (CV: p = 0.033 for C-SENSE AI vs. C-SENSE and p < 0.001 for C-SENSE AI vs. SENSE; CCC: non-overlapping CI between reconstruction methods). For the highest investigated acceleration factor, CCC = {0.479,0.926,0.960} and CV ¯ ={0.519,0.119,0.118} were found, confirming the reduction of bias and RME by C-SENSE AI as compared to C-SENSE (by trend) and to SENSE (CV: p < 0.001; CCC: non-overlapping CI). ADC bias and random measurement error in DWI at low SNR, typically associated with scan acceleration, can be effectively reduced by deep-learning based C-SENSE AI reconstruction. [ABSTRACT FROM AUTHOR]

We investigated the feasibility of using compressed sensitivity encoding (CS-SENSE) to accelerate high-resolution black-blood T1-weighted imaging with variable flip angles (T1WI-VFA) for efficient visualization and characterization of lenticulostriate arteries (LSAs) on a 3.0 T MR scanner. Twenty-five healthy volunteers and 18 patients with the cerebrovascular disease were prospectively enrolled. Healthy volunteers underwent T1WI-VFA sequences with different acceleration factors (AFs), including conventional sensitivity encoding (SENSE) AF = 3 and CS-SENSE AF = 3, 4, 5, and 6 (SENSE3, CS3, CS4, CS5, CS6, respectively) at 3 Tesla MRI scanner. Objective evaluation (contrast ratio and number, length, and branches of LSAs) and subjective evaluation (overall image quality and LSA visualization scores) were used to assess image quality and LSA visualization. Comparisons were performed among the 5 sequences to select the best AF. All patients underwent both T1WI-VFA with the optimal AF and digital subtraction angiography (DSA) examination, and the number of LSAs observed by T1WI-VFA was compared with that by DSA. Pair-wise comparisons among CS3, CS4, and SENSE3 revealed no significant differences in both objective measurements and subjective evaluation (all P > 0.05). In patients, there was no significant difference in LSA counts on the same side between T1WI-VFA with CS4 and DSA (3, 3–4 and 3, 3–3, P = 0.243). CS3 provided better LSA visualization but a longer scan duration compared to CS4. And, CS4 strikes a good balance between LSA visualization and acquisition time, which is recommended for routine clinical use. [ABSTRACT FROM AUTHOR]

Medical images contain sensitive information that will be shared with healthcare workers, patients, and researchers for diagnostic and research purposes. However, the security of these images during transmission is extremely important, especially after the COVID-19 pandemic. In diagnosis, MRI and CT images are two common medical images, and the two medical images complement each other to a certain extent. The fusion of these two images can help doctors diagnose more intuitively. This paper proposes a zero-watermarking encryption scheme with an authentication function based on multimodal medical image fusion. In addition, an improved three-dimensional Chebyshev and ICMIC closed-loop coupling mapping (3D-CICCM) is proposed and applied to the design of medical image encryption. This scheme mainly includes: medical image fusion based on bilateral filtering and local gradient energy, authentication based on the Fresnel transform, double random phase encryption based on the Fresnel transform and shuffle algorithm, and zero-watermark generation algorithm based on stationary wavelet transform. The experimental results prove the effectiveness of this scheme. [ABSTRACT FROM AUTHOR]

Traditional single-pixel imaging (SPI) encounters challenges such as high sampling redundancy and poor imaging quality, constraining its widespread application. Despite a range of orthogonal modulation modes have been employed in structured illumination to enhance imaging performance, some encoding issues still persist in information sampling, impeding the further progression of SPI. We propose an SPI method based on orthogonal Hermite–Gaussian (HG) moments, achieving improved imaging reconstruction through differential modulation of HG basis patterns and linear weighting of acquired intensity. Both simulations and experiments confirm superior imaging quality and computation efficiency of proposed Hermite–Gaussian single-pixel imaging (HG-SI), especially at low-measurement levels. Moreover, we incorporate compressed sensing algorithms within the framework of HG-SI, integrating moments-based sampling strategies to optimize imaging capability under sparse measurements. Our research underscores the effectiveness of HG modulation in SPI reconstruction, enabling high-quality outcomes via compressed sampling. This advancement propels the investigation of optical field modulation modes within SPI and holds promise in offering a universal solution for weak-intensity and non-visible light microscopy. [ABSTRACT FROM AUTHOR]

The two-dimensional grid-free compressed sensing method with planar microphone arrays is expected to achieve super-resolution direction-of-arrival (DOA) estimation for acoustic sources in the hemispherical space in front of array. The existing methods are not yet well compatible with arbitrary planar array geometries. In this paper, we aim to break this limitation and explore a novel method applicable to arbitrary planar array geometries. First, the covariance between source-induced signals at arbitrary two microphones is formulated as related to the two-dimensional inverse Fourier transform of the source strength. Then, a mathematical model with a source sparsity constraint is built in the continuous domain to denoise the covariances of measured signals, which can be solved by decoupled positive semidefinite programming. Finally, the DOAs are extracted from the solution of the mathematical model via a matrix pencil and pairing method. Simulation and experimental results demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]