Explore the vast range of titles available.

Interrupted sampling repeater jamming (ISRJ) is an attracted coherent jamming method to inverse synthetic aperture radar (ISAR) in the past decades. By means of different jamming parameters settings, realistic dense false targets can be formed around the true target. This paper proposed an adaptive anti-jamming method against ISRJ by adjusting the number of measurements based on compressed sensing (CS). The jamming signal is energy concentrated and segmented sparse in the frequency domain. The measurements number of the reconstructed target signal and the jamming signal is different. According to the restricted isometry property (RIP) condition of CS theory, signal reconstructing performance depends on the number of measurements that varies with the sparsity of the vector. Thus, the jamming signal is suppressed, and the true target signal is retained by altering the measurements number of echo signals. Besides, the two-dimensional (2D) anti-jamming method is derived in detail. The anti-jamming effect is analyzed with different signal-to-noise ratios (SNR), sampling rates, and jam-to-signal ratios (JSR). Simulations prove the effectiveness of the proposed anti-jamming method.

Compressed sensing (CS) has been proposed to improve the efficiency of signal processing by simultaneously sampling and compressing the signal of interest under the assumption that the signal is sparse in a certain domain. This paper aims to improve the CS system performance by constructing a novel sparsifying dictionary and optimizing the measurement matrix. Owing to the adaptability and robustness of the Takenaka–Malmquist (TM) functions in system identification, the use of it as the basis function of a sparsifying dictionary makes the represented signal exhibit a sparser structure than the existing sparsifying dictionaries. To reduce the mutual coherence between the dictionary and the measurement matrix, an equiangular tight frame (ETF) based iterative minimization algorithm is proposed. In our approach, we modify the singular values without changing the properties of the corresponding Gram matrix of the sensing matrix to enhance the independence between the column vectors of the Gram matrix. Simulation results demonstrate the promising performance of the proposed algorithm as well as the superiority of the CS system, designed with the constructed sparsifying dictionary and the optimized measurement matrix, over existing ones in terms of signal recovery accuracy.

In this paper, we consider the graph signals are sparse in the graph Fourier domain and propose an iterative threshold compressed sensing reconstruction (ITCSR) algorithm to reconstruct sparse graph signals in the graph Fourier domain. The proposed ITCSR algorithm derives from the well-known compressed sensing by considering a threshold for sparsity-promoting reconstruction of the underlying graph signals. The proposed ITCSR algorithm enhances the performance of sparse graph signal reconstruction by introducing a threshold function to determine a suitable threshold. Furthermore, we demonstrate that the suitable parameters for the threshold can be automatically determined by leveraging the sparrow search algorithm. Moreover, we analytically prove the convergence property of the proposed ITCSR algorithm. In the experimental, numerical tests with synthetic as well as 3D point cloud data demonstrate the merits of the proposed ITCSR algorithm relative to the baseline algorithms.

The direction-of-arrival (DOA) estimation is predominantly influenced by the antenna’s aperture size. However, space constraints on flight platforms often necessitate the use of antennas with smaller apertures and fewer array elements. This inevitably imposes limitations on the DOA estimation’s resolution and degrees of freedom. To address these precision constraints, we introduce an accurate DOA estimation method based on spatial synthetic aperture model. This method adopts a two-stage strategy to ensure both efficiency and precision in DOA estimation. Initially, the orthogonal matching pursuit (OMP) reconstruction algorithm processes the original aperture data, providing a rough estimate of target angles that guides the aircraft’s flight direction. Subsequently, the early estimations merge with the aircraft’s motion space samples, forming equivalent spatially synthesized array samples. The refined angle estimation then employs the OMP-RELAX algorithm. Moreover, with the off-grid issue in mind, we devise an estimation method integrating Bayesian parameter estimation with dictionary sequence refinement. The proposed technique harnesses the spatial synthetic aperture for pinpoint estimation, effectively addressing the challenges of atomic orthogonality and angular off-grid on estimation accuracy. Importantly, the efficiency of deploying sparse reconstruction for angle estimation is bolstered by our phased strategy, eliminating the necessity for fine grid analysis across the entire observation scene. Moreover, the poor estimation accuracy caused by coherent source targets and angular-flickering targets is improved by sparse reconstruction. Through simulation and experiment, we affirm the proposed method’s efficacy in angle estimation. The results indicate that target angle estimation errors are limited to within 1°. Furthermore, we assess the impact of variables such as target state, heading angle, spatial sampling points, and target distance on the estimation accuracy of our method, showcasing its resilience and adaptability.

Compared to 1D compressed sensing (CS), 2D CS is more efficient for compressing the plaintext image from two directions, but security level of current 2D CS-based ciphers is unsatisfactory. To solve this problem, this paper presents a novel color image compression and encryption algorithm by combining 2D CS, information entropy and chaos. Firstly, the color image is decomposed into red, green and blue components, then they are sparsely transformed by the discrete wavelet transform (DWT) to get three sparse matrices. Next, the obtained matrices are observed by two asymptotical deterministic random measurement matrices based on information entropy and counter (ADMMIC), which not only encrypts the plaintext image, but also compresses it in proportion to reduce the transmission bandwidth and storage space. Subsequently, the corresponding measurement value matrices are shuffled by a double random scrambling based on Arnold map and index vector (DRSAIV) to eliminate the correlation between adjacent pixels. Furthermore, the obtained permutated matrices are diffused by a simultaneous multiple random diffusion of inter–intra components (SMRDIC) to obtain the final cipher image, the plaintext pixel to be diffused, the key matrix involved in diffusion and the position of the obtained ciphertext pixel are all unpredictable, which makes statistical attack invalid. In addition, information entropy values of plaintext image are obtained to generate the initial values of the used chaotic systems, which greatly improve the ability to resist the known-plaintext and chosen-plaintext attacks. Simulation results and security analyses verify that this algorithm has good compression and high security.

Diffusion tensor histology holds great promise for quantitative characterization of structural connectivity in mouse models of neurological and psychiatric conditions. There has been extensive study in both the clinical and preclinical domains on the complex tradeoffs between the spatial resolution, the number of samples in diffusion q-space, scan time, and the reliability of the resultant data. We describe here a method for accelerating the acquisition of diffusion MRI data to support quantitative connectivity measurements in the whole mouse brain using compressed sensing (CS). The use of CS allows substantial increase in spatial resolution and/or reduction in scan time. Compared to the fully sampled results at the same scan time, the subtle anatomical details of the brain, such as cortical layers, dentate gyrus, and cerebellum, were better visualized using CS due to the higher spatial resolution. Compared to the fully sampled results at the same spatial resolution, the scalar diffusion metrics, including fractional anisotropy (FA) and mean diffusivity (MD), showed consistently low error across the whole brain (< 6.0%) even with 8.0 times acceleration. The node properties of connectivity (strength, cluster coefficient, eigenvector centrality, and local efficiency) demonstrated correlation of better than 95.0% between accelerated and fully sampled connectomes. The acceleration will enable routine application of this technology to a wide range of mouse models of neurologic diseases.

High-resolution three-dimensional (3D) Inverse Synthetic Aperture Radar (ISAR) imaging is essential for the characterization of target scattering in various environments. The practical application of this technique is frequently impeded by the lengthy measurement time necessary for comprehensive data acquisition with turntable-based systems. Sub-sampling the aperture can decrease acquisition time; however, traditional reconstruction algorithms that utilize matched filtering exhibit significantly impaired imaging performance, often characterized by a high peak side-lobe ratio. A methodology is proposed that integrates compressed sensing(CS) theory with sparse-aperture optimization to achieve high-fidelity 3D imaging from sparsely sampled data. An optimized sparse sampling aperture is introduced to systematically balance the engineering requirement for efficient, continuous turntable motion with the low mutual coherence desired for the CS matrix. A deep Bayesian optimization framework was developed to automatically identify physically realizable optimal sampling trajectories, ensuring that the sensing matrix retains the necessary properties for accurate signal recovery. This method effectively addresses the high-sidelobe problem associated with traditional sparse techniques, significantly decreasing measurement duration while maintaining image quality. Quantitative experimental results indicate the method’s efficacy: the optimized sparse aperture decreases the number of angular sampling points by roughly 84% compared to a full acquisition, while reconstructing images with a high correlation coefficient of 0.98 to the fully sampled reference. The methodology provides an effective solution for rapid, high-performance 3D ISAR imaging, achieving an optimal balance between data acquisition efficiency and reconstruction fidelity.

Because of the three-dimensional (3D) imaging scene’s sparsity, compressed sensing (CS) algorithms can be used for linear array synthetic aperture radar (LASAR) 3D sparse imaging. CS algorithms usually achieve high-quality sparse imaging at the expense of computational efficiency. To solve this problem, a fast Bayesian compressed sensing algorithm via relevance vector machine (FBCS–RVM) is proposed in this paper. The proposed method calculates the maximum marginal likelihood function under the framework of the RVM to obtain the optimal hyper-parameters; the scattering units corresponding to the non-zero optimal hyper-parameters are extracted as the target-areas in the imaging scene. Then, based on the target-areas, we simplify the measurement matrix and conduct sparse imaging. In addition, under low signal to noise ratio (SNR), low sampling rate, or high sparsity, the target-areas cannot always be extracted accurately, which probably contain several elements whose scattering coefficients are too small and closer to 0 compared to other elements. Those elements probably make the diagonal matrix singular and irreversible; the scattering coefficients cannot be estimated correctly. To solve this problem, the inverse matrix of the singular matrix is replaced with the generalized inverse matrix obtained by the truncated singular value decomposition (TSVD) algorithm to estimate the scattering coefficients correctly. Based on the rank of the singular matrix, those elements with small scattering coefficients are extracted and eliminated to obtain more accurate target-areas. Both simulation and experimental results show that the proposed method can improve the computational efficiency and imaging quality of LASAR 3D imaging compared with the state-of-the-art CS-based methods.

Diffusion Magnetic Resonance Imaging (dMRI) has shown great potential in probing tissue microstructure and structural connectivity in the brain but is often limited by the lengthy scan time needed to sample the diffusion profile by acquiring multiple diffusion weighted images (DWIs). Although parallel imaging technique has improved the speed of dMRI acquisition, attaining high resolution three dimensional (3D) dMRI on preclinical MRI systems remained still time consuming. In this paper, kernel principal component analysis, a machine learning approach, was employed to estimate the correlation among DWIs. We demonstrated the feasibility of such correlation estimation from low-resolution training DWIs and used the correlation as a constraint to reconstruct high-resolution DWIs from highly under-sampled k-space data, which significantly reduced the scan time. Using full k-space 3D dMRI data of post-mortem mouse brains, we retrospectively compared the performance of the so-called kernel low rank (KLR) method with a conventional compressed sensing (CS) method in terms of image quality and ability to resolve complex fiber orientations and connectivity. The results demonstrated that the KLR-CS method outperformed the conventional CS method for acceleration factors up to 8 and was likely to enhance our ability to investigate brain microstructure and connectivity using high-resolution 3D dMRI.

Most existing work on Federated Learning (FL) transmits full-precision weights, which contain a significant amount of redundant information, leading to a substantial communication burden. This issue is particularly pronounced with the growing prevalence of smart mobile and Internet of Things (IoT) devices, where data sharing generates a large communication cost. To address this issue, we propose a communication-efficient Federated Learning algorithm, FedCSTQ, based on compressed sensing (CS) and ternary quantization.FedCSTQ introduces a heuristic sparsification method that enhances information selection, thereby mitigating the accuracy degradation typically associated with CS. Additionally, the algorithm incorporates ternary quantization to process residuals after sparsity, further reducing the impact of accuracy degradation due to sparsity while guaranteeing a small amount of communication overhead. Experiments conducted on the publicly available datasets reveal that FedCSTQ outperforms the standard FL (FedAvg), SignSGD with a majority vote, FL using dithering(CEP-FL), and FL based on Compressed Sensing (CS-FL). Ablation studies further demonstrate the effectiveness of our method.