High-speed 4-dimensional scanning transmission electron microscopy using compressive sensing techniques

Here we show that compressive sensing allows 4-dimensional (4-D) STEM data to be obtained and accurately reconstructed with both high-speed and reduced electron fluence. The methodology needed to achieve these results compared to conventional 4-D approaches requires only that a random subset of probe locations is acquired from the typical regular scanning grid, which immediately generates both higher speed and the lower fluence experimentally. We also consider downsampling of the detector, showing that oversampling is inherent within convergent beam electron diffraction (CBED) patterns and that detector downsampling does not reduce precision but allows faster experimental data acquisition. Analysis of an experimental atomic resolution yttrium silicide dataset shows that it is possible to recover over 25 dB peak signal-to-noise ratio in the recovered phase using 0.3% of the total data. Lay abstract: Four-dimensional scanning transmission electron microscopy (4-D STEM) is a powerful technique for characterizing complex nanoscale structures. In this method, a convergent beam electron diffraction pattern (CBED) is acquired at each probe location during the scan of the sample. This means that a 2-dimensional signal is acquired at each 2-D probe location, equating to a 4-D dataset. Despite the recent development of fast direct electron detectors, some capable of 100kHz frame rates, the limiting factor for 4-D STEM is acquisition times in the majority of cases, where cameras will typically operate on the order of 2kHz. This means that a raster scan containing 256^2 probe locations can take on the order of 30s, approximately 100-1000 times longer than a conventional STEM imaging technique using monolithic radial detectors. As a result, 4-D STEM acquisitions can be subject to adverse effects such as drift, beam damage, and sample contamination. Recent advances in computational imaging techniques for STEM have allowed for faster acquisition speeds by way of acquiring only a random subset of probe locations from the field of view. By doing this, the acquisition time is significantly reduced, in some cases by a factor of 10-100 times. The acquired data is then processed to fill-in or inpaint the missing data, taking advantage of the inherently low-complex signals which can be linearly combined to recover the information. In this work, similar methods are demonstrated for the acquisition of 4-D STEM data, where only a random subset of CBED patterns are acquired over the raster scan. We simulate the compressive sensing acquisition method for 4-D STEM and present our findings for a variety of analysis techniques such as ptychography and differential phase contrast. Our results show that acquisition times can be significantly reduced on the order of 100-300 times, therefore improving existing frame rates, as well as further reducing the electron fluence beyond just using a faster camera.

Chromatic Aberration Correction in Harmonic Diffractive Lenses Based on Compressed Sensing Encoding Imaging

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 f0=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.

Greybox: A hybrid algorithm for direct estimation of tracer kinetic parameters from undersampled DCE-MRI data

BACKGROUND

A variety of deep learning-based and iterative approaches are available to predict Tracer Kinetic (TK) parameters from fully sampled or undersampled dynamic contrast-enhanced (DCE) MRI data. However, both the methods offer distinct benefits and drawbacks.

PURPOSE

To propose a hybrid algorithm (named as 'Greybox'), using both model- as well as DL-based, for solving a multi-parametric non-linear inverse problem of directly estimating TK parameters from undersampled DCE MRI data, which is invariant to undersampling rate.

METHODS

The proposed algorithm was inspired by plug-and-play algorithms used for solving linear inverse imaging problems. This technique was tested for its effectiveness in solving the nonlinear ill-posed inverse problem of generating 3D TK parameter maps from four-dimensional (4D; Spatial + Temporal) retrospectively undersampled k-space data. The algorithm learns a deep learning-based prior using UNET to estimate theK trans $\mathbf {K_{trans}}$ andV p $\mathbf {V_{p}}$ parameters based on the Patlak pharmacokinetic model, and this trained prior was utilized to estimate the TK parameter maps using an iterative gradient-based optimization scheme. Unlike the existing DL models, this network is invariant to the undersampling rate of the input data. The proposed method was compared with the total variation-based direct reconstruction technique on brain, breast, and prostate DCE-MRI datasets for various undersampling rates using the Radial Golden Angle (RGA) scheme. For the breast dataset, an indirect estimation using the Fast Composite Splitting algorithm was utilized for comparison. Undersampling rates of 8× , 12× and 20× were used for the experiments, and the results were compared using the PSNR and SSIM as metrics. For the breast dataset of 10 patients, data from four patients were utilized for training (1032 samples), two for validation (752 samples), and the entire volume of four patients for testing. Similarly, for the prostate dataset of 18 patients, 10 patients were utilized for training (720 samples), five for validation (216 samples), and the whole volume of three patients for testing. For the brain dataset of nineteen patients, ten patients were used for training (3152 samples), five for validation (1168 samples), and the whole volume of four patients for testing. Statistical tests were also conducted to assess the significance of the improvement in performance.

RESULTS

The experiments showed that the proposed Greybox performs significantly better than other direct reconstruction methods. The proposed algorithm improved the estimatedK trans $\mathbf {K_{trans}}$ andV p $\mathbf {V_{p}}$ in terms of the peak signal-to-noise ratio by up to 3 dB compared to other standard reconstruction methods.

CONCLUSION

The proposed hybrid reconstruction algorithm, Greybox, can provide state-of-the-art performance in solving the nonlinear inverse problem of DCE-MRI. This is also the first of its kind to utilize convolutional neural network-based encodings as part of the plug-and-play priors to improve the performance of the reconstruction algorithm.

Super-resolved q-space learning of diffusion MRI

BACKGROUND

Diffusion magnetic resonance imaging (dMRI) provides a powerful tool to non-invasively investigate neural structures in the living human brain. Nevertheless, its reconstruction performance on neural structures relies on the number of diffusion gradients in the q-space. High-angular (HA) dMRI requires a long scan time, limiting its use in clinical practice, whereas directly reducing the number of diffusion gradients would lead to the underestimation of neural structures.

PURPOSE

We propose a deep compressive sensing-based q-space learning (DCS-qL) approach to estimate HA dMRI from low-angular dMRI.

METHODS

In DCS-qL, we design the deep network architecture by unfolding the proximal gradient descent procedure that addresses the compressive sense problem. In addition, we exploit a lifting scheme to design a network structure with reversible transform properties. For implementation, we apply a self-supervised regression to enhance the signal-to-noise ratio of diffusion data. Then, we utilize a semantic information-guided patch-based mapping strategy for feature extraction, which introduces multiple network branches to handle patches with different tissue labels.

RESULTS

Experimental results show that the proposed approach can yield a promising performance on the tasks of reconstructed HA dMRI images, microstructural indices of neurite orientation dispersion and density imaging, fiber orientation distribution, and fiber bundle estimation.

CONCLUSIONS

The proposed method achieves more accurate neural structures than competing approaches.

Sparsity of higher-order landscape interactions enables learning and prediction for microbiomes

Microbiome engineering offers the potential to leverage microbial communities to improve outcomes in human health, agriculture, and climate. To translate this potential into reality, it is crucial to reliably predict community composition and function. But a brute force approach to cataloging community function is hindered by the combinatorial explosion in the number of ways we can combine microbial species. An alternative is to parameterize microbial community outcomes using simplified, mechanistic models, and then extrapolate these models beyond where we have sampled. But these approaches remain data-hungry, as well as requiring an a priori specification of what kinds of mechanisms are included and which are omitted. Here, we resolve both issues by introducing a mechanism-agnostic approach to predicting microbial community compositions and functions using limited data. The critical step is the identification of a sparse representation of the community landscape. We then leverage this sparsity to predict community compositions and functions, drawing from techniques in compressive sensing. We validate this approach on in silico community data, generated from a theoretical model. By sampling just [Formula: see text]1% of all possible communities, we accurately predict community compositions out of sample. We then demonstrate the real-world application of our approach by applying it to four experimental datasets and showing that we can recover interpretable, accurate predictions on composition and community function from highly limited data.

Review of Miniaturized Computational Spectrometers

Spectrometers are key instruments in diverse fields, notably in medical and biosensing applications. Recent advancements in nanophotonics and computational techniques have contributed to new spectrometer designs characterized by miniaturization and enhanced performance. This paper presents a comprehensive review of miniaturized computational spectrometers (MCS). We examine major MCS designs based on waveguides, random structures, nanowires, photonic crystals, and more. Additionally, we delve into computational methodologies that facilitate their operation, including compressive sensing and deep learning. We also compare various structural models and highlight their unique features. This review also emphasizes the growing applications of MCS in biosensing and consumer electronics and provides a thoughtful perspective on their future potential. Lastly, we discuss potential avenues for future research and applications.

Compressive sensing of functional connectivity maps from patterned optogenetic stimulation of neuronal ensembles

Mapping functional connectivity between neurons is an essential step toward probing the neural computations mediating behavior. Accurately determining synaptic connectivity maps in populations of neurons is challenging in terms of yield, accuracy, and experimental time. Here, we developed a compressive sensing approach to reconstruct synaptic connectivity maps based on random two-photon cell-targeted optogenetic stimulation and membrane voltage readout of many putative postsynaptic neurons. Using a biophysical network model of interconnected populations of excitatory and inhibitory neurons, we characterized mapping recall and precision as a function of network observability, sparsity, number of neurons stimulated, off-target stimulation, synaptic reliability, propagation latency, and network topology. We found that mapping can be achieved with far fewer measurements than the standard pairwise sequential approach, with network sparsity and synaptic reliability serving as primary determinants of the performance. Our results suggest a rapid and efficient method to reconstruct functional connectivity of sparsely connected neuronal networks.

Robust quantitative susceptibility mapping via approximate message passing with parameter estimation

PURPOSE

For quantitative susceptibility mapping (QSM), the lack of ground-truth in clinical settings makes it challenging to determine suitable parameters for the dipole inversion. We propose a probabilistic Bayesian approach for QSM with built-in parameter estimation, and incorporate the nonlinear formulation of the dipole inversion to achieve a robust recovery of the susceptibility maps.

THEORY

From a Bayesian perspective, the image wavelet coefficients are approximately sparse and modeled by the Laplace distribution. The measurement noise is modeled by a Gaussian-mixture distribution with two components, where the second component is used to model the noise outliers. Through probabilistic inference, the susceptibility map and distribution parameters can be jointly recovered using approximate message passing (AMP).

METHODS

We compare our proposed AMP with built-in parameter estimation (AMP-PE) to the state-of-the-art L1-QSM, FANSI, and MEDI approaches on the simulated and in vivo datasets, and perform experiments to explore the optimal settings of AMP-PE. Reproducible code is available at: https://github.com/EmoryCN2L/QSM_AMP_PE.

RESULTS

On the simulated Sim2Snr1 dataset, AMP-PE achieved the lowest NRMSE, deviation from calcification moment and the highest SSIM, while MEDI achieved the lowest high-frequency error norm. On the in vivo datasets, AMP-PE is robust and successfully recovers the susceptibility maps using the estimated parameters, whereas L1-QSM, FANSI and MEDI typically require additional visual fine-tuning to select or double-check working parameters.

CONCLUSION

AMP-PE provides automatic and adaptive parameter estimation for QSM and avoids the subjectivity from the visual fine-tuning step, making it an excellent choice for the clinical setting.

Full-Field Vibration Response Estimation from Sparse Multi-Agent Automatic Mobile Sensors Using Formation Control Algorithm

In structural vibration response sensing, mobile sensors offer outstanding benefits as they are not dedicated to a certain structure; they also possess the ability to acquire dense spatial information. Currently, most of the existing literature concerning mobile sensing involves human drivers manually driving through the bridges multiple times. While self-driving automated vehicles could serve for such studies, they might entail substantial costs when applied to structural health monitoring tasks. Therefore, in order to tackle this challenge, we introduce a formation control framework that facilitates automatic multi-agent mobile sensing. Notably, our findings demonstrate that the proposed formation control algorithm can effectively control the behavior of the multi-agent systems for structural response sensing purposes based on user choice. We leverage vibration data collected by these mobile sensors to estimate the full-field vibration response of the structure, utilizing a compressive sensing algorithm in the spatial domain. The task of estimating the full-field response can be represented as a spatiotemporal response matrix completion task, wherein the suite of multi-agent mobile sensors sparsely populates some of the matrix's elements. Subsequently, we deploy the compressive sensing technique to obtain the dense full-field vibration complete response of the structure and estimate the reconstruction accuracy. Results obtained from two different formations on a simply supported bridge are presented in this paper, and the high level of accuracy in reconstruction underscores the efficacy of our proposed framework. This multi-agent mobile sensing approach showcases the significant potential for automated structural response measurement, directly applicable to health monitoring and resilience assessment objectives.

Compressive hyperspectral microscopy for cancer detection

Significance

Hyperspectral microscopy grants the ability to characterize unique properties of tissues based on their spectral fingerprint. The ability to label and measure multiple molecular probes simultaneously provides pathologists and oncologists with a powerful tool to enhance accurate diagnostic and prognostic decisions. As the pathological workload grows, having an objective tool that provides companion diagnostics is of immense importance. Therefore, fast whole-slide spectral imaging systems are of immense importance for automated cancer prognostics that meet current and future needs.

Aim

We aim to develop a fast and accurate hyperspectral microscopy system that can be easily integrated with existing microscopes and provide flexibility for optimizing measurement time versus spectral resolution.

Approach

The method employs compressive sensing (CS) and a spectrally encoded illumination device integrated into the illumination path of a standard microscope. The spectral encoding is obtained using a compact liquid crystal cell that is operated in a fast mode. It provides time-efficient measurements of the spectral information, is modular and versatile, and can also be used for other applications that require rapid acquisition of hyperspectral images.

Results

We demonstrated the acquisition of breast cancer biopsies hyperspectral data of the whole camera area within ∼ 1    s . This means that a typical 1 × 1    cm 2 biopsy can be measured in ∼ 10    min . The hyperspectral images with 250 spectral bands are reconstructed from 47 spectrally encoded images in the spectral range of 450 to 700 nm.

Conclusions

CS hyperspectral microscopy was successfully demonstrated on a common lab microscope for measuring biopsies stained with the most common stains, such as hematoxylin and eosin. The high spectral resolution demonstrated here in a rather short time indicates the ability to use it further for coping with the highly demanding needs of pathological diagnostics, both for cancer diagnostics and prognostics.

Deep Sensing for Compressive Video Acquisition

A camera captures multidimensional information of the real world by convolving it into two dimensions using a sensing matrix. The original multidimensional information is then reconstructed from captured images. Traditionally, multidimensional information has been captured by uniform sampling, but by optimizing the sensing matrix, we can capture images more efficiently and reconstruct multidimensional information with high quality. Although compressive video sensing requires random sampling as a theoretical optimum, when designing the sensing matrix in practice, there are many hardware limitations (such as exposure and color filter patterns). Existing studies have found random sampling is not always the best solution for compressive sensing because the optimal sampling pattern is related to the scene context, and it is hard to manually design a sampling pattern and reconstruction algorithm. In this paper, we propose an end-to-end learning approach that jointly optimizes the sampling pattern as well as the reconstruction decoder. We applied this deep sensing approach to the video compressive sensing problem. We modeled the spatio-temporal sampling and color filter pattern using a convolutional neural network constrained by hardware limitations during network training. We demonstrated that the proposed method performs better than the manually designed method in gray-scale video and color video acquisitions.

Emerging Trends in Fast MRI Using Deep-Learning Reconstruction on Undersampled k-Space Data: A Systematic Review

Magnetic Resonance Imaging (MRI) is an essential medical imaging modality that provides excellent soft-tissue contrast and high-resolution images of the human body, allowing us to understand detailed information on morphology, structural integrity, and physiologic processes. However, MRI exams usually require lengthy acquisition times. Methods such as parallel MRI and Compressive Sensing (CS) have significantly reduced the MRI acquisition time by acquiring less data through undersampling k-space. The state-of-the-art of fast MRI has recently been redefined by integrating Deep Learning (DL) models with these undersampled approaches. This Systematic Literature Review (SLR) comprehensively analyzes deep MRI reconstruction models, emphasizing the key elements of recently proposed methods and highlighting their strengths and weaknesses. This SLR involves searching and selecting relevant studies from various databases, including Web of Science and Scopus, followed by a rigorous screening and data extraction process using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines. It focuses on various techniques, such as residual learning, image representation using encoders and decoders, data-consistency layers, unrolled networks, learned activations, attention modules, plug-and-play priors, diffusion models, and Bayesian methods. This SLR also discusses the use of loss functions and training with adversarial networks to enhance deep MRI reconstruction methods. Moreover, we explore various MRI reconstruction applications, including non-Cartesian reconstruction, super-resolution, dynamic MRI, joint learning of reconstruction with coil sensitivity and sampling, quantitative mapping, and MR fingerprinting. This paper also addresses research questions, provides insights for future directions, and emphasizes robust generalization and artifact handling. Therefore, this SLR serves as a valuable resource for advancing fast MRI, guiding research and development efforts of MRI reconstruction for better image quality and faster data acquisition.

Joint Model-Order and Robust DoA Estimation for Underwater Sensor Arrays

The direction-of-arrival (DoA) estimation algorithms have a fundamental role in target bearing estimation by sensor array systems. Recently, compressive sensing (CS)-based sparse reconstruction techniques have been investigated for DoA estimation due to their superior performance relative to the conventional DoA estimation methods, for a limited number of measurement snapshots. In many underwater deployment scenarios, the acoustic sensor arrays must perform DoA estimation in the presence of several practical problems such as unknown source number, faulty sensors, low values of the received signal-to-noise ratio (SNR), and access to a limited number of measurement snapshots. In the literature, CS-based DoA estimation has been investigated for the individual occurrence of some of these errors but the estimation under joint occurrence of these errors has not been studied. This work investigates the CS-based robust DoA estimation to account for the joint impact of faulty sensors and low SNR conditions experienced by a uniform linear array of underwater acoustic sensors. Most importantly, the proposed CS-based DoA estimation technique does not require a priori knowledge of the source order, which is replaced in the modified stopping criterion of the reconstruction algorithm by taking into account the faulty sensors and the received SNR. Using Monte Carlo techniques, the DoA estimation performance of the proposed method is comprehensively evaluated in relation to other techniques.

An Efficient Compressive Sensing Event-Detection Scheme for Internet of Things System Based on Sparse-Graph Codes

This work studied the event-detection problem in an Internet of Things (IoT) system, where a group of sensor nodes are placed in the region of interest to capture sparse active event sources. Using compressive sensing (CS), the event-detection problem is modeled as recovering the high-dimensional integer-valued sparse signal from incomplete linear measurements. We show that the sensing process in IoT system produces an equivalent integer CS using sparse graph codes at the sink node, for which one can devise a simple deterministic construction of a sparse measurement matrix and an efficient integer-valued signal recovery algorithm. We validated the determined measurement matrix, uniquely determined the signal coefficients, and performed an asymptotic analysis to examine the performance of the proposed approach, namely event detection with integer sum peeling (ISP), with the density evolution method. Simulation results show that the proposed ISP approach achieves a significantly higher performance compared to existing literature at various simulation scenario and match that of the theoretical results.

Sparse Time-Frequency Distribution Reconstruction Using the Adaptive Compressed Sensed Area Optimized with the Multi-Objective Approach

Compressive sensing (CS) of the signal ambiguity function (AF) and enforcing the sparsity constraint on the resulting signal time-frequency distribution (TFD) has been shown to be an efficient method for time-frequency signal processing. This paper proposes a method for adaptive CS-AF area selection, which extracts the magnitude-significant AF samples through a clustering approach using the density-based spatial clustering algorithm. Moreover, an appropriate criterion for the performance of the method is formalized, i.e., component concentration and preservation, as well as interference suppression, are measured utilizing the information obtained from the short-term and the narrow-band Rényi entropies, while component connectivity is evaluated using the number of regions with continuously-connected samples. The CS-AF area selection and reconstruction algorithm parameters are optimized using an automatic multi-objective meta-heuristic optimization method, minimizing the here-proposed combination of measures as objective functions. Consistent improvement in CS-AF area selection and TFD reconstruction performance has been achieved without requiring a priori knowledge of the input signal for multiple reconstruction algorithms. This was demonstrated for both noisy synthetic and real-life signals.

Hybrid Multi-Dimensional Attention U-Net for Hyperspectral Snapshot Compressive Imaging Reconstruction

In order to capture the spatial-spectral (x,y,λ) information of the scene, various techniques have been proposed. Different from the widely used scanning-based methods, spectral snapshot compressive imaging (SCI) utilizes the idea of compressive sensing to compressively capture the 3D spatial-spectral data-cube in a single-shot 2D measurement and thus it is efficient, enjoying the advantages of high-speed and low bandwidth. However, the reconstruction process, i.e., to retrieve the 3D cube from the 2D measurement, is an ill-posed problem and it is challenging to reconstruct high quality images. Previous works usually use 2D convolutions and preliminary attention to address this challenge. However, these networks and attention do not exactly extract spectral features. On the other hand, 3D convolutions can extract more features in a 3D cube, but increase computational cost significantly. To balance this trade-off, in this paper, we propose a hybrid multi-dimensional attention U-Net (HMDAU-Net) to reconstruct hyperspectral images from the 2D measurement in an end-to-end manner. HMDAU-Net integrates 3D and 2D convolutions in an encoder-decoder structure to fully utilize the abundant spectral information of hyperspectral images with a trade-off between performance and computational cost. Furthermore, attention gates are employed to highlight salient features and suppress the noise carried by the skip connections. Our proposed HMDAU-Net achieves superior performance over previous state-of-the-art reconstruction algorithms.

Towards real-time STEM simulations through targeted subsampling strategies

Scanning transmission electron microscopy images can be complex to interpret on the atomic scale as the contrast is sensitive to multiple factors such as sample thickness, composition, defects and aberrations. Simulations are commonly used to validate or interpret real experimental images, but they come at a cost of either long computation times or specialist hardware such as graphics processing units. Recent works in compressive sensing for experimental STEM images have shown that it is possible to significantly reduce the amount of acquired signal and still recover the full image without significant loss of image quality, and therefore it is proposed here that similar methods can be applied to STEM simulations. In this paper, we demonstrate a method that can significantly increase the efficiency of STEM simulations through a targeted sampling strategy, along with a new approach to independently subsample each frozen phonon layer. We show the effectiveness of this method by simulating a SrTiO₃ grain boundary and monolayer 2H-MoS₂ containing a sulphur vacancy using the abTEM software. We also show how this method is not limited to only traditional multislice methods, but also increases the speed of the PRISM simulation method. Furthermore, we discuss the possibility for STEM simulations to seed the acquisition of real data, to potentially lead the way to self-driving (correcting) STEM.

Compressive Sensing via Variational Bayesian Inference under Two Widely Used Priors: Modeling, Comparison and Discussion

Compressive sensing is a sub-Nyquist sampling technique for efficient signal acquisition and reconstruction of sparse or compressible signals. In order to account for the sparsity of the underlying signal of interest, it is common to use sparsifying priors such as Bernoulli-Gaussian-inverse Gamma (BGiG) and Gaussian-inverse Gamma (GiG) priors on the components of the signal. With the introduction of variational Bayesian inference, the sparse Bayesian learning (SBL) methods for solving the inverse problem of compressive sensing have received significant interest as the SBL methods become more efficient in terms of execution time. In this paper, we consider the sparse signal recovery problem using compressive sensing and the variational Bayesian (VB) inference framework. More specifically, we consider two widely used Bayesian models of BGiG and GiG for modeling the underlying sparse signal for this problem. Although these two models have been widely used for sparse recovery problems under various signal structures, the question of which model can outperform the other for sparse signal recovery under no specific structure has yet to be fully addressed under the VB inference setting. Here, we study these two models specifically under VB inference in detail, provide some motivating examples regarding the issues in signal reconstruction that may occur under each model, perform comparisons and provide suggestions on how to improve the performance of each model.

Compressive Sensing of Medical Images Based on HSV Color Space

Recently, compressive sensing (CS) schemes have been studied as a new compression modality that exploits the sensing matrix in the measurement scheme and the reconstruction scheme to recover the compressed signal. In addition, CS is exploited in medical imaging (MI) to support efficient sampling, compression, transmission, and storage of a large amount of MI. Although CS of MI has been extensively investigated, the effect of color space in CS of MI has not yet been studied in the literature. To fulfill these requirements, this article proposes a novel CS of MI based on hue-saturation value (HSV), using spread spectrum Fourier sampling (SSFS) and sparsity averaging with reweighted analysis (SARA). An HSV loop that performs SSFS is proposed to obtain a compressed signal. Next, HSV-SARA is proposed to reconstruct MI from the compressed signal. A set of color MIs is investigated, such as colonoscopy, magnetic resonance imaging of the brain and eye, and wireless capsule endoscopy images. Experiments were performed to show the superiority of HSV-SARA over benchmark methods in terms of signal-to-noise ratio (SNR), structural similarity (SSIM) index, and measurement rate (MR). The experiments showed that a color MI, with a resolution of 256×256 pixels, could be compressed by the proposed CS at MR of 0.1, and could be improved in terms of SNR being 15.17% and SSIM being 2.53%. The proposed HSV-SARA can be a solution for color medical image compression and sampling to improve the image acquisition of medical devices.

Compressive Sensing Imaging Spectrometer for UV-Vis Stellar Spectroscopy: Instrumental Concept and Performance Analysis

Compressive sensing (CS) has been proposed as a disruptive approach to developing a novel class of optical instrumentation used in diverse application domains. Thanks to sparsity as an inherent feature of many natural signals, CS allows for the acquisition of the signal in a very compact way, merging acquisition and compression in a single step and, furthermore, offering the capability of using a limited number of detector elements to obtain a reconstructed image with a larger number of pixels. Although the CS paradigm has already been applied in several application domains, from medical diagnostics to microscopy, studies related to space applications are very limited. In this paper, we present and discuss the instrumental concept, optical design, and performances of a CS imaging spectrometer for ultraviolet-visible (UV-Vis) stellar spectroscopy. The instrument-which is pixel-limited in the entire 300 nm-650 nm spectral range-features spectral sampling that ranges from 2.2 nm@300 nm to 22 nm@650 nm, with a total of 50 samples for each spectrum. For data reconstruction quality, the results showed good performance, measured by several quality metrics chosen from those recommended by CCSDS. The designed instrument can achieve compression ratios of 20 or higher without a significant loss of information. A pros and cons analysis of the CS approach is finally carried out, highlighting main differences with respect to a traditional system.

An Efficient Compressive Sensed Video Codec with Inter-Frame Decoding and Low-Complexity Intra-Frame Encoding

This paper is dedicated to video coding based on a compressive sensing (CS) framework. In CS, it is assumed that if a video sequence is sparse in some transform domain, then it could be reconstructed from a much lower number of samples (called measurements) than the Nyquist-Shannon theorem requires. Here, the performance of such a codec depends on how the measurements are acquired (or sensed) and compressed and how the video is reconstructed from the decoded measurements. Here, such a codec potentially could provide significantly faster encoding compared with traditional block-based intra-frame encoding via Motion JPEG (MJPEG), H.264/AVC or H.265/HEVC standards. However, existing video codecs based on CS are inferior to the traditional codecs in rate distortion performance, which makes them useless in practical scenarios. In this paper, we present a video codec based on CS called CS-JPEG. To the author's knowledge, CS-JPEG is the first codec based on CS, combining fast encoding and high rate distortion results. Our performance evaluation shows that, compared with the optimized software implementations of MJPEG, H.264/AVC, and H.265/HEVC, the proposed CS-JPEG encoding is 2.2, 1.9, and 30.5 times faster, providing 2.33, 0.79, and 1.45 dB improvements in the peak signal-to-noise ratio, respectively. Therefore, it could be more attractive for video applications having critical limitations in computational resources or a battery lifetime of an upstreaming device.

Sidelobe Suppression Techniques for Near-Field Multistatic SAR

Multirotor Unmanned Air Systems (UAS) represent a significant improvement in capability for Synthetic Aperture Radar (SAR) imaging when compared to traditional, fixed-wing, platforms. In particular, a swarm of UAS can generate significant measurement diversity through variation of spatial and frequency collections across an array of sensors. In such imaging schemes, the image formation step is challenging due to strong extended sidelobe; however, were this to be effectively managed, a dramatic increase in image quality is theoretically possible. Since 2015, QinetiQ have developed the RIBI system, which uses multiple UAS to perform short-range multistatic collections, and this requires novel near-field processing to mitigate the high sidelobes observed and form actionable imagery. This paper applies a number of algorithms to assess image reconstruction of simulated near-field multistatic SAR with an aim to suppress sidelobes observed in the RIBI system, investigating techniques including traditional SAR processing, regularised linear regression, compressive sensing. In these simulations presented, Elastic net, Orthogonal Matched Pursuit, and Iterative Hard Thresholding all show the ability to suppress sidelobes while preserving accuracy of scatterer RCS. This has also lead to a novel processing approach for reconstructing SAR images based on the observed Elastic net and Iterative Hard Thresholding performance, mitigating weaknesses to generate an improved combined approach. The relative strengths and weaknesses of the algorithms are discussed, as well as their application to more complex real-world imagery.

New insights into binocular rivalry from the reconstruction of evolving percepts using model network dynamics

When the two eyes are presented with highly distinct stimuli, the resulting visual percept generally switches every few seconds between the two monocular images in an irregular fashion, giving rise to a phenomenon known as binocular rivalry. While a host of theoretical studies have explored potential mechanisms for binocular rivalry in the context of evoked model dynamics in response to simple stimuli, here we investigate binocular rivalry directly through complex stimulus reconstructions based on the activity of a two-layer neuronal network model with competing downstream pools driven by disparate monocular stimuli composed of image pixels. To estimate the dynamic percept, we derive a linear input-output mapping rooted in the non-linear network dynamics and iteratively apply compressive sensing techniques for signal recovery. Utilizing a dominance metric, we are able to identify when percept alternations occur and use data collected during each dominance period to generate a sequence of percept reconstructions. We show that despite the approximate nature of the input-output mapping and the significant reduction in neurons downstream relative to stimulus pixels, the dominant monocular image is well-encoded in the network dynamics and improvements are garnered when realistic spatial receptive field structure is incorporated into the feedforward connectivity. Our model demonstrates gamma-distributed dominance durations and well obeys Levelt's four laws for how dominance durations change with stimulus strength, agreeing with key recurring experimental observations often used to benchmark rivalry models. In light of evidence that individuals with autism exhibit relatively slow percept switching in binocular rivalry, we corroborate the ubiquitous hypothesis that autism manifests from reduced inhibition in the brain by systematically probing our model alternation rate across choices of inhibition strength. We exhibit sufficient conditions for producing binocular rivalry in the context of natural scene stimuli, opening a clearer window into the dynamic brain computations that vary with the generated percept and a potential path toward further understanding neurological disorders.

Feasibility of a Real-Time Embedded Hyperspectral Compressive Sensing Imaging System

Hyperspectral imaging has been attracting considerable interest as it provides spectrally rich acquisitions useful in several applications, such as remote sensing, agriculture, astronomy, geology and medicine. Hyperspectral devices based on compressive acquisitions have appeared recently as an alternative to conventional hyperspectral imaging systems and allow for data-sampling with fewer acquisitions than classical imaging techniques, even under the Nyquist rate. However, compressive hyperspectral imaging requires a reconstruction algorithm in order to recover all the data from the raw compressed acquisition. The reconstruction process is one of the limiting factors for the spread of these devices, as it is generally time-consuming and comes with a high computational burden. Algorithmic and material acceleration with embedded and parallel architectures (e.g., GPUs and FPGAs) can considerably speed up image reconstruction, making hyperspectral compressive systems suitable for real-time applications. This paper provides an in-depth analysis of the required performance in terms of computing power, data memory and bandwidth considering a compressive hyperspectral imaging system and a state-of-the-art reconstruction algorithm as an example. The results of the analysis show that real-time application is possible by combining several approaches, namely, exploitation of system matrix sparsity and bandwidth reduction by appropriately tuning data value encoding.

Adaptive High-Resolution Imaging Method Based on Compressive Sensing

Compressive sensing (CS) is a signal sampling theory that originated about 16 years ago. It replaces expensive and complex receiving devices with well-designed signal recovery algorithms, thus simplifying the imaging system. Based on the application of CS theory, a single-pixel camera with an array-detection imaging system is established for high-pixel detection. Each detector of the detector array is coupled with a bundle of fibers formed by fusion of four bundles of fibers of different lengths, so that the target area corresponding to one detector is split into four groups of target information arriving at different times. By comparing the total amount of information received by the detector with the threshold set in advance, it can be determined whether the four groups of information are calculated separately. The simulation results show that this new system can not only reduce the number of measurements required to reconstruct high quality images but can also handle situations wherever the target may appear in the field of view without necessitating an increase in the number of detectors.

A Novel Texture Extraction-Based Compressive Sensing for Lung Cancer Classification

Background

Lung cancer images require large memory storage and transmission bandwidth for sending the data. Compressive sensing (CS), as a method with a statistical approach in signal sampling, provides different output patterns based on information sources. Thus, it can be considered that CS can be used for feature extraction of compressed information.

Methods

In this study, we proposed a novel texture extraction-based CS for lung cancer classification. We classify three types of lung cancer, including adenocarcinoma (ACA), squamous cell carcinoma (SCC), and benign lung cancer (N). The classification is carried out based on texture extraction, which is processed in 2 stages, the first stage to detect N and the second to detect ACA and SCC.

Results

The simulation results show that two-stage texture extraction can improve accuracy by an average of 84%. The proposed system is expected to be decision support in assisting clinical diagnosis. In terms of technical storage, this system can save memory resources.

Conclusions

The proposed two-step texture extraction system combined with CS and K- Nearest Neighbor has succeeded in classifying lung cancer with high accuracy; the system can also save memory storage. It is necessary to examine the complexity of the proposed method so that it can be analyzed further.

Automated Firmware Generation for Compressive Sensing on Heterogeneous Hardware

In this paper, a model-based firmware generator is presented towards complex sampling schemes. The framework is capable of automatically generating a fixed-rate Shannon-compliant acquisition scheme, as well as a variable-rate compressive sensing acquisition scheme. The generation starts from a model definition, which consists of two main components, namely an acquisition sequence to implement and the platform on which the sequence should be implemented. This model is then combined with the specifications to be transformed into a functional firmware. When generating firmware for compressive sensing (CS) purposes, the defined acquisition sequence is automatically generated to implement a pseudo-random sampling scheme in agreement with the defined undersampling factor. The evaluation of the generated firmware is done by means of an example use-case, including a proposed strategy for synchronization between CS setups. This research attempts to reduce the development complexity for embedded CS to lower the threshold towards effective usage in the field.

A Hyper-Chaotically Encrypted Robust Digital Image Watermarking Method with Large Capacity Using Compress Sensing on a Hybrid Domain

The digital watermarking technique is a quite promising technique for both image copyright protection and secure transmission. However, many existing techniques are not as one might have expected for robustness and capacity simultaneously. In this paper, we propose a robust semi-blind image watermarking scheme with a high capacity. Firstly, we perform a discrete wavelet transformation (DWT) transformation on the carrier image. Then, the watermark images are compressed via a compressive sampling technique for saving storage space. Thirdly, a Combination of One and Two-Dimensional Chaotic Map based on the Tent and Logistic map (TL-COTDCM) is used to scramble the compressed watermark image with high security and dramatically reduce the false positive problem (FPP). Finally, a singular value decomposition (SVD) component is used to embed into the decomposed carrier image to finish the embedding process. With this scheme, eight 256×256 grayscale watermark images are perfectly embedded into a 512×512 carrier image, the capacity of which is eight times over that of the existing watermark techniques on average. The scheme has been tested through several common attacks on high strength, and the experiment results show the superiority of our method via the two most used evaluation indicators, normalized correlation coefficient (NCC) values and the peak signal-to-noise ratio (PSNR). Our method outperforms the state-of-the-art in the aspects of robustness, security, and capacity of digital watermarking, which exhibits great potential in multimedia application in the immediate future.

A probabilistic Bayesian approach to recover R2*$$ {R}_{2\ast } $$ map and phase images for quantitative susceptibility mapping

PURPOSE

Undersampling is used to reduce the scan time for high-resolution three-dimensional magnetic resonance imaging. In order to achieve better image quality and avoid manual parameter tuning, we propose a probabilistic Bayesian approach to recover R 2 ∗ $$ {R}_2^{\ast } $$ map and phase images for quantitative susceptibility mapping (QSM), while allowing automatic parameter estimation from undersampled data.

THEORY

Sparse prior on the wavelet coefficients of images is interpreted from a Bayesian perspective as sparsity-promoting distribution. A novel nonlinear approximate message passing (AMP) framework that incorporates a mono-exponential decay model is proposed. The parameters are treated as unknown variables and jointly estimated with image wavelet coefficients.

METHODS

Undersampling takes place in the y-z plane of k-space according to the Poisson-disk pattern. Retrospective undersampling is performed to evaluate the performances of different reconstruction approaches, prospective undersampling is performed to demonstrate the feasibility of undersampling in practice.

RESULTS

The proposed AMP with parameter estimation (AMP-PE) approach successfully recovers R 2 ∗ $$ {R}_2^{\ast } $$ maps and phase images for QSM across various undersampling rates. It is more computationally efficient, and performs better than the state-of-the-art l 1 $$ {l}_1 $$ -norm regularization (L1) approach in general, except a few cases where the L1 approach performs as well as AMP-PE.

CONCLUSION

AMP-PE achieves better performance by drawing information from both the sparse prior and the mono-exponential decay model. It does not require parameter tuning, and works with a clinical, prospective undersampling scheme where parameter tuning is often impossible or difficult due to the lack of ground-truth image.

Computational optics for high-throughput imaging of neural activity

Optical microscopy offers a noninvasive way to image neural activity in the mouse brain. To simultaneously record neural activity across a large population of neurons, optical systems that have high spatiotemporal resolution and can access a large volume are necessary. The throughput of a system, that is, the number of resolvable spots acquired by the system at a given time, is usually limited by optical hardware. To overcome this limitation, computation optics that designs optical hardware and computer software jointly becomes a new approach that achieves micronscale resolution, millimeter-scale field-of-view, and hundreds of hertz imaging speed at the same time. This review article summarizes recent advances in computational optics for high-throughput imaging of neural activity, highlighting technologies for three-dimensional parallelized excitation and detection. Computational optics can substantially accelerate the study of neural circuits with previously unattainable precision and speed.

"Conical" Frustum Multi-Beam Phased Arrays for Air Traffic Control Radars

The design of conical frustum phased array antennas for air traffic control (ATC) radar systems is addressed. The array architecture, which is controlled by a fully digital beam-forming (DBF) network, is composed by a set of equal vertical modules. Each module consists of a linear sparse array that generates on receive multiple instantaneous beams pointing along different directions in elevation. To reach the best trade-off between the antenna complexity (i.e., minimum number of array elements and/or radio frequency components) and radiation performance (i.e., matching a set of reference patterns), the synthesis problem is formulated in the Compressive Sampling (CS) framework. Then, the positions of the array elements and the complex excitations for generating each single beam are jointly determined through a customized version of the Bayesian CS (BCS) tool. Representative numerical results, concerned with ideal as well as real antenna models, are reported both to validate the proposed design strategy and to assess the effectiveness of the synthesized modular sparse array architecture also in comparison with conventional arrays with uniformly-spaced elements.

A Novel Prediction Model for Malicious Users Detection and Spectrum Sensing Based on Stacking and Deep Learning

Cooperative network is a promising concept for achieving a high-accuracy decision of spectrum sensing in cognitive radio networks. It enables a collaborative exchange of the sensing measurements among the network users to monitor the primary spectrum occupancy. However, the presence of malicious users leads to harmful interferences in the system by transmitting incorrect local sensing observations.To overcome this security related problem and to improve the accuracy decision of spectrum sensing in cooperative cognitive radio networks, we proposed a new approach based on two machine learning solutions. For the first solution, a new stacking model-based malicious users detection is proposed, using two innovative techniques, including chaotic compressive sensing technique-based authentication for feature extraction with a minimum of measurements and an ensemble machine learning technique for users classification. For the second solution, a novel deep learning technique is proposed, using scalogram images as inputs for the primary user spectrum's classification. The simulation results show the high efficiency of both proposed solutions, where the accuracy of the new stacking model reaches 97% in the presence of 50% of malicious users, while the new scalogram technique-based spectrum sensing is fast and achieves a high probability of detection with a lower number of epochs and a low probability of false alarm.

A Chaotic Compressive Sensing Based Data Transmission Method for Sensors within BBNs

Body to body networks (BBNs) are a kind of large-scaled sensor network that are composed of several wireless body area networks (WBANs) in the distributed structure, and in recent decades, BBNs have played a key role in medical, aerospace, and military applications. Compared with the traditional WBANs, BBNs have larger scales and longer transmission distances. The sensors within BBNs not only transmit the data they collect, but also forward the data sent by other nodes as relay nodes. Therefore, BBNs have high requirements in energy efficiency, data security, and privacy protection. In this paper, we propose a secure and efficient data transmission method for sensor nodes within BBNs that is based on the perception of chaotic compressive sensing. This method can simultaneously accomplish data compression, encryption, and critical information concealment during the data sampling process and provide various levels of reconstruction qualities according to the authorization level of receivers. Simulation and experimental results demonstrate that the proposed method could realize data compression, encryption, and critical information concealment for images that are transmitted within BBNs. Specifically, the proposed method could enhance the security level of data transmission by breaking the statistical patterns of original data, providing large key space and sensitivity of the initial values, etc.

Compressive-sensing swept-source optical coherence tomography angiography with reduced noise

Optical coherence tomography angiography (OCTA), as a functional extension of optical coherence tomography (OCT), has exhibited a great potential to aid in clinical diagnostics. Currently, OCTA still suffers from motion artifact and noise. Therefore, in this article, we propose to implement compressive sensing (CS) on B-scans to reduce motion artifact by increasing B-scan rate. Meanwhile, a noise reduction filter is specially designed by combining CS, Gaussian filter and median filter. Specially, CS filtering is realized by averaging multiple CS repetitions on en-face OCTA images with varied sampling functions. The method is evaluated on in vivo OCTA images of human skin. The results show that vasculature structures can be reconstructed well through CS on B-scans with a sampling rate of 70%. Moreover, the noise can be significantly eliminated by the developed filter. This implies that our method has a good potential to expedite OCTA imaging and improve the image quality.

The Time-of-Arrival Offset Estimation in Neural Network Atomic Denoising in Wireless Location

With the increasing demand for wireless location services, it is of great interest to reduce the deployment cost of positioning systems. For this reason, indoor positioning based on WiFi has attracted great attention. Compared with the received signal strength indicator (RSSI), channel state information (CSI) captures the radio propagation environment more accurately. However, it is necessary to take signal bandwidth, interferences, noises, and other factors into account for accurate CSI-based positioning. In this paper, we propose a novel dictionary filtering method that uses the direct weight determination method of a neural network to denoise the dictionary and uses compressive sensing (CS) to extract the channel impulse response (CIR). A high-precision time-of-arrival (TOA) is then estimated by peak search. A median value filtering algorithm is used to locate target devices based on the time-difference-of-arrival (TDOA) technique. We demonstrate the superior performance of the proposed scheme experimentally, using data collected with a WiFi positioning testbed. Compared with the fingerprint location method, the proposed location method does not require a site survey in advance and therefore enables a fast system deployment.

A Source Localization Method Using Complex Variational Mode Decomposition

Source localization with a passive sensors array is a common topic in various areas. Among the popular source localization algorithms, the compressive sensing (CS)-based method has recently drawn considerable interest because it is a high-resolution method, robust with coherent sources and few snapshots, and applicable for mixed near-field and far-field source localization. However, the CS-based methods rely on the dense grid to ensure the required estimation precision, which is time-consuming and impractical. This paper applies the complex variational mode decomposition (CVMD) to source localization. Specifically, the signal model of the source localization problem is similar to the time-domain frequency-modulated signal model. Motivated by this, we extend CVMD, initially designed for nonstationary time-domain signal analysis, to array signal processing. The decomposition results of the array measurements can correspond to the potential sources at different locations. Then, the sources' direction and range can be estimated by model fitting with the decomposed subsignals. The simulation results show that the proposed CVMD-based method can locate the pure far-field, pure near-field, mixed far-field, and near-field sources. Notably, it can yield high-resolution localization for the coherent sources with one single snapshot with low computing time.

Deep Unfolding of Iteratively Reweighted ADMM for Wireless RF Sensing

We address the detection of material defects, which are inside a layered material structure using compressive sensing-based multiple-input and multiple-output (MIMO) wireless radar. Here, strong clutter due to the reflection of the layered structure's surface often makes the detection of the defects challenging. Thus, sophisticated signal separation methods are required for improved defect detection. In many scenarios, the number of defects that we are interested in is limited, and the signaling response of the layered structure can be modeled as a low-rank structure. Therefore, we propose joint rank and sparsity minimization for defect detection. In particular, we propose a non-convex approach based on the iteratively reweighted nuclear and ℓ1-norm (a double-reweighted approach) to obtain a higher accuracy compared to the conventional nuclear norm and ℓ1-norm minimization. To this end, an iterative algorithm is designed to estimate the low-rank and sparse contributions. Further, we propose deep learning-based parameter tuning of the algorithm (i.e., algorithm unfolding) to improve the accuracy and the speed of convergence of the algorithm. Our numerical results show that the proposed approach outperforms the conventional approaches in terms of mean squared errors of the recovered low-rank and sparse components and the speed of convergence.

Dual-compressed photoacoustic single-pixel imaging

Photoacoustic imaging, an acoustic imaging modality with potentially optical resolution in an optical turbid medium, has attracted great attention. However, the convergence of wavefront optimization and raster scanning in computational photoacoustic imaging leads to the challenge of fast mapping, especially for a spatial resolution approaching the acoustic deep-subwavelength regime. As a sparse sampling paradigm, compressive sensing has been applied in numerous fields to accelerate data acquisition without significant quality losses. In this work, we propose a dual-compressed approach for photoacoustic surface tomography that enables high-efficiency imaging with 3D spatial resolution unlimited by the acoustics in a turbid environment. The dual-compressed photoacoustic imaging with single-pixel detection, enabled by spatially optical modulation with synchronized temporally photoacoustic coding, allows decoding of the fine optical information from the modulated acoustic signal even when the variance of original photoacoustic signals is weak. We perform a proof-of-principle numerical demonstration of dual-compressed photoacoustic imaging, that resolves acoustic sub-acoustic-wavelength details with a significantly reduced number of measurements, revealing the potential for dynamic imaging. The dual-compressed concept, which transforms unobtrusive spatial difference into spatio-temporal detectable information, can be generalized to other imaging modalities to realize efficient, high-spatial-resolution imaging.

Resolving Multi-Path Interference in Compressive Time-of-Flight Depth Imaging with a Multi-Tap Macro-Pixel Computational CMOS Image Sensor

Multi-path interference causes depth errors in indirect time-of-flight (ToF) cameras. In this paper, resolving multi-path interference caused by surface reflections using a multi-tap macro-pixel computational CMOS image sensor is demonstrated. The imaging area is implemented by an array of macro-pixels composed of four subpixels embodied by a four-tap lateral electric field charge modulator (LEFM). This sensor can simultaneously acquire 16 images for different temporal shutters. This method can reproduce more than 16 images based on compressive sensing with multi-frequency shutters and sub-clock shifting. In simulations, an object was placed 16 m away from the sensor, and the depth of an interference object was varied from 1 to 32 m in 1 m steps. The two reflections were separated in two stages: coarse estimation based on a compressive sensing solver and refinement by a nonlinear search to investigate the potential of our sensor. Relative standard deviation (precision) and relative mean error (accuracy) were evaluated under the influence of photon shot noise. The proposed method was verified using a prototype multi-tap macro-pixel computational CMOS image sensor in single-path and dual-path situations. In the experiment, an acrylic plate was placed 1 m or 2 m and a mirror 9.3 m from the sensor.

Research on Variable Parameter Drilling Method of Ti-CFRP-Ti Laminated Stacks Based on Real-Time Sensing of Drilling Axial Force

Ti-CFRP-Ti laminated stacks have been widely used in aviation, aerospace, shipbuilding and other industries, owing to its excellent physical and electrochemical properties. However, chip blockages occur easily when drilling into Ti-CFRP-Ti laminated stacks, resulting in a rapid rise of drilling temperature and an increase of axial drilling force, which may lead to the intensification of tool wear and a decline of drilling quality. Cutting force signals can effectively reflect the drilling process and tool condition, however, the traditional plate dynamometer is typically difficult in realizing the follow-up online measurement. Therefore, an intelligent tool holder system for real-time sensing of the cutting force is developed and constructed in this paper, and the variable parameter drilling method of Ti-CFRP-Ti laminated stacks is studied on this basis. Firstly, an intelligent tool holder system with high flexibility and adaptability is designed; Secondly, a cutting force signal processing method based on compressed sensing (CS) theory is proposed to solve the problem of high-frequency signal transmission; Lastly, the drilling experiment of Ti-CFRP-Ti laminated stacks is carried out based on the intelligent tool holder system, and the drilling parameters are optimized using a compromise programming approach and analytic hierarchy process (AHP). The comparison of results show that the optimized drilling parameters can effectively reduce the hole wall surface roughness and improve the drilling efficiency while ensuring a small axial force.

Low-Rank and Sparse Matrix Recovery for Hyperspectral Image Reconstruction Using Bayesian Learning

In order to reduce the amount of hyperspectral imaging (HSI) data transmission required through hyperspectral remote sensing (HRS), we propose a structured low-rank and joint-sparse (L&S) data compression and reconstruction method. The proposed method exploits spatial and spectral correlations in HSI data using sparse Bayesian learning and compressive sensing (CS). By utilizing a simultaneously L&S data model, we employ the information of the principal components and Bayesian learning to reconstruct the hyperspectral images. The simulation results demonstrate that the proposed method is superior to LRMR and SS&LR methods in terms of reconstruction accuracy and computational burden under the same signal-to-noise tatio (SNR) and compression ratio.

Implementation of Resonant Electric Based Metamaterials for Electromagnetic Wave Manipulation at Microwave Frequencies

In this paper, we present the application of a resonant electric based metamaterial element and its two-dimensional metasurface implementation for a variety of emerging wireless applications. Metasurface apertures developed in this work are synthesized using sub-wavelength sampled resonant electric-based unit-cell structures and can achieve electromagnetic wave manipulation at microwave frequencies. The presented surfaces are implemented in a variety of forms, from absorption surfaces for energy harvesting and wireless power transfer to wave-chaotic surfaces for compressive sensing based single-pixel direction of arrival estimation and reflecting surfaces. It is shown that the resonant electric-synthesized metasurface concept offers a significant potential for these applications with high fidelity absorption, transmission and reflection characteristics within the microwave frequency spectrum.

On Architecture Selection for Linear Inverse Problems with Untrained Neural Networks

In recent years, neural network based image priors have been shown to be highly effective for linear inverse problems, often significantly outperforming conventional methods that are based on sparsity and related notions. While pre-trained generative models are perhaps the most common, it has additionally been shown that even untrained neural networks can serve as excellent priors in various imaging applications. In this paper, we seek to broaden the applicability and understanding of untrained neural network priors by investigating the interaction between architecture selection, measurement models (e.g., inpainting vs. denoising vs. compressive sensing), and signal types (e.g., smooth vs. erratic). We motivate the problem via statistical learning theory, and provide two practical algorithms for tuning architectural hyperparameters. Using experimental evaluations, we demonstrate that the optimal hyperparameters may vary significantly between tasks and can exhibit large performance gaps when tuned for the wrong task. In addition, we investigate which hyperparameters tend to be more important, and which are robust to deviations from the optimum.

Compressive Sensing-Based SAR Image Reconstruction from Sparse Radar Sensor Data Acquisition in Automotive FMCW Radar System

In this paper, we propose a method for reconstructing synthetic aperture radar (SAR) images by applying a compressive sensing (CS) technique to sparsely acquired radar sensor data. In general, SAR image reconstruction algorithms require radar sensor data acquired at regular spatial intervals. However, when the speed of the radar-equipped platform is not constant, it is difficult to consistently perform regular data acquisitions. Therefore, we used the CS-based signal recovery method to efficiently reconstruct SAR images even when regular data acquisition was not performed. In the proposed method, we used the l1-norm minimization to overcome the non-uniform data acquisition problem, which replaced the Fourier transform and inverse Fourier transform in the conventional SAR image reconstruction method. In addition, to reduce the phase distortion of the recovered signal, the proposed method was applied to each of the in-phase and quadrature components of the acquired radar sensor data. To evaluate the performance of the proposed method, we conducted experiments using an automotive frequency-modulated continuous wave radar sensor. Then, the quality of the SAR image reconstructed with data acquired at regular intervals was compared with the quality of images reconstructed with data acquired at non-uniform intervals. Using the proposed method, even if only 70% of the regularly acquired radar sensor data was used, a SAR image having a correlation of 0.83 could be reconstructed.

Highly Efficient Spatial-Temporal Correlation Basis for 5G IoT Networks

One of the major concerns in 5G IoT networks is that most of the sensor nodes are powered through limited lifetime, which seriously affects the performance of the networks. In this article, Compressive sensing (CS) technique is used to decrease transmission cost in 5G IoT networks. Sparse basis is one of the important steps in the CS. However, most of the existing sparse basis-based method such as DCT (Discrete cosine transform) and DFT (Discrete Fourier Transform) basis do not capture data structure characteristics in the networks. They also do not take into consideration multi-resolution representations. In addition, some of sparse basis-driven methods exploit either spatial or temporal features, resulting in performance degradation of CS-based strategies. To address these challenging problems, we propose a novel spatial-temporal correlation basis algorithm (SCBA). Subsequently, an optimal basis algorithm (OBA) is provided considering greedy scoring criteria. To evaluate the efficiency of OBA, orthogonal wavelet basis algorithm (OWBA) by employing NS (Numerical Sparsity) and GI (Gini Index) sparse metrics is also presented. In addition, we discuss the complexity of the above three algorithms, and prove that OBA has low numerical rank. After experimental evaluation, we found that OBA is capable of the sparsest representing original signal compared to spatial, DCT, haar-1, haar-2, and rbio5.5. Furthermore, OBA has the low recovery error and the highest efficiency.

Hardware Implementation and RF High-Fidelity Modeling and Simulation of Compressive Sensing Based 2D Angle-of-Arrival Measurement System for 2-18 GHz Radar Electronic Support Measures

This article presents the hardware implementation and a behavioral model-based RF system modeling and simulation (M&S) study of compressive sensing (CS) based 2D angle-of-arrival (AoA) measurement system for 2–18 GHz radar electronic support measures (RESM). A 6-channel ultra-wideband RF digital receiver was first developed using a PXIe-based multi-channel digital receiver paired with a 6-element random-spaced 2D cavity-backed-spiral-antenna array. Then the system was tested in an open lab environment. The measurement results showed that the system can measure AoA of impinging signals from 2–18 (GHz) with overall RMSE of estimation at 3.60, 2.74, 1.16, 0.67 and 0.56 (deg) in L, S, C, X and Ku bands, respectively. After that, using the RF high-fidelity M&S (RF HF-M&S) approach, a 6-channel AoA measurement system behavioral model was also developed and studied using a radar electronic warfare (REW) engagement scenario. The simulation result showed that the airborne AoA measurement system could successfully measure an S-band ground-based target acquisition radar signal in the dynamic REW environment. Using the RF HF-M&S model, the applicability of the system in other frequencies within 2–18 (GHz) was also studied. The simulation results demonstrated that the airborne AoA measurement system can be used for 2–18 GHz RESM applications.

Coded Aperture Hyperspectral Image Reconstruction

In this work, we study and analyze the reconstruction of hyperspectral images that are sampled with a CASSI device. The sensing procedure was modeled with the help of the CS theory, which enabled efficient mechanisms for the reconstruction of the hyperspectral images from their compressive measurements. In particular, we considered and compared four different type of estimation algorithms: OMP, GPSR, LASSO, and IST. Furthermore, the large dimensions of hyperspectral images required the implementation of a practical block CASSI model to reconstruct the images with an acceptable delay and affordable computational cost. In order to consider the particularities of the block model and the dispersive effects in the CASSI-like sensing procedure, the problem was reformulated, as well as the construction of the variables involved. For this practical CASSI setup, we evaluated the performance of the overall system by considering the aforementioned algorithms and the different factors that impacted the reconstruction procedure. Finally, the obtained results were analyzed and discussed from a practical perspective.

Dual Optical Path Based Adaptive Compressive Sensing Imaging System

Compressive Sensing (CS) has proved to be an effective theory in the field of image acquisition. However, in order to distinguish the difference between the measurement matrices, the CS imaging system needs to have a higher signal sampling accuracy. At the same time, affected by the noise of the light path and the circuit, the measurements finally obtained are noisy, which directly affects the imaging quality. We propose a dual-optical imaging system that uses the bidirectional reflection characteristics of digital micromirror devices (DMD) to simultaneously acquire CS measurements and images under the same viewing angle. Since deep neural networks have powerful modeling capabilities, we trained the filter network and the reconstruction network separately. The filter network is used to filter the noise in the measurements, and the reconstruction network is used to reconstruct the CS image. Experiments have proved that the method we proposed can filter the noise in the sampling process of the CS system, and can significantly improve the quality of image reconstruction under a variety of algorithms.

Systematic Analysis and Review of Magnetic Resonance Imaging (MRI) Reconstruction Techniques

BACKGROUND

Magnetic Resonance Imaging (MRI) plays an important role in the field of medical diagnostic imaging as it poses non-invasive acquisition and high soft-tissue contrast. However, a huge time is needed for the MRI scanning process that results in motion artifacts, degrades image quality, misinterprets the data, and may cause discomfort to the patient. Thus, the main goal of MRI research is to accelerate data acquisition processing without affecting the quality of the image.

INTRODUCTION

This paper presents a survey based on distinct conventional MRI reconstruction methodologies. In addition, a novel MRI reconstruction strategy is proposed based on weighted Compressive Sensing (CS), Penalty-aided minimization function, and Meta-heuristic optimization technique.

METHODS

An illustrative analysis is done concerning adapted methods, datasets used, execution tools, performance measures, and values of evaluation metrics. Moreover, the issues of existing methods and the research gaps considering conventional MRI reconstruction schemes are elaborated to obtain improved contribution for devising significant MRI reconstruction techniques.

RESULTS

The proposed method will reduce conventional aliasing artifact problems, may attain lower Mean Square Error (MSE), higher Peak Signal-to-Noise Ratio (PSNR), and Structural SIMilarity (SSIM) index.

CONCLUSION

The issues of existing methods and the research gaps considering conventional MRI reconstruction schemes are elaborated to devising an improved significant MRI reconstruction technique.

Digital Incoherent Compressive Holography Using a Geometric Phase Metalens

We propose a compressive self-interference incoherent digital holography (SIDH) with a geometric phase metalens for section-wise holographic object reconstruction. We specify the details of the SIDH with a geometric phase metalens design that covers the visible wavelength band, analyze a spatial distortion problem in the SIDH and address a process of a compressive holographic section-wise reconstruction with analytic spatial calibration. The metalens allows us to realize a compressive SIDH system in the visible wavelength band using an image sensor with relatively low bandwidth. The operation of the proposed compressive SIDH is verified through numerical simulations.