SPS Feed

In many specific scenarios, accurateand practical cooperative learning is a commonly encountered challenge in multi-agent systems. Thus, the current investigation focuses on cooperative learning algorithms for multi-agent systems and underpins an alternate data-based neural network reinforcement learning framework. To achieve the data-based learning optimization, the proposed cooperative learning framework, which comprises two layers, introduces a virtual learning objective.

In the snapshot compressive imaging (SCI) field, how to explore priors for recovering the original high-dimensional data from its lower-dimensional measurements is a challenge. Recent plug-and-play efforts plugged by deep denoisers have achieved superior performance, and their convergences have been guaranteed under the assumption of bounded denoisers and the condition of diminishing noise levels. However, it is difficult to explicitly prove the bounded properties of existing deep denoisers due to complex network architectures.

Reconstruction of CT images from a limited set of projections through an object is important in several applications ranging from medical imaging to industrial settings. As the number of available projections decreases, traditional reconstruction techniques such as the FDK algorithm and model-based iterative reconstruction methods perform poorly.

This letter proposes a generalised extended nested array with multiple subarrays (GENAMS) array via the maximum inter-element spacing (IES) constraint principle. Based on the IES set patterns of the two-sides extended nested array and the flexible extended nested array with multiple subarrays type-2, a generalised IES set pattern is derived.

Iterative hard thresholding (IHT) and hard thresholding pursuit (HTP) are two kinds of classical hard thresholding-based algorithms widely used in compressed sensing. Restricted isometry constant (RIC) of sensing matrix which ensures the convergence of iterative algorithms plays a key role in guaranteeing successful recovery. In the analysis of sufficient condition to ensure recovery performance, the RIC δ3s is generally used in previous literature, while δ2s is rarely addressed. In this letter, we first show that the theoretical optimal step-length is 1 while using sufficient condition in terms of δ2s .

Image registration is a basic task in computer vision, for its wide potential applications in image stitching, stereo vision, motion estimation, and etc. Most current methods achieve image registration by estimating a global homography matrix between candidate images with point-feature-based matching or direct prediction. However, as real-world 3D scenes have point-variant photograph distances (depth), a unified homography matrix is not sufficient to depict the specific pixel-wise relations between two images.

The prominent success of neural networks, mainly in computer vision tasks, is increasingly shadowed by their sensitivity to small, barely perceivable adversarial perturbations in image input. In this article, we aim at explaining this vulnerability through the framework of sparsity. We show the connection between adversarial attacks and sparse representations, with a focus on explaining the universality and transferability of adversarial examples in neural networks.

The Discrete Wavelet Transform (DWT) has gained attention in the area of Multi-Carrier Modulation (MCM) because it can overcome some well known limitations of Discrete Fourier Transform (DFT) based MCM systems. Its improved spectral containment removes the need for a cyclic prefix, be it that appropriate equalization then has to be added as the cyclic convolution property no longer holds. Most DWT based MCM systems in the literature use Time-domain EQualizers (TEQs) to mitigate the channel distortion. 

In this paper, we consider robust channel estimation for a millimeter wave (mmWave) massive MIMO system with uniform planar arrays (UPA). For many gridless angle estimation methods of mmWave channels, the channel gains needs to be time-invariant during training. We propose a gridless method that is applicable to time-invariant and time-varying channels, and the proposed method is robust to channel variations.