Blind hyperspectral unmixing (HU), also known as unsupervised HU, is one of the most prominent research topics in signal processing (SP) for hyperspectral remote sensing [1], [2]. Blind HU aims at identifying materials present in a captured scene, as well as their compositions, by using high spectral resolution of hyperspectral images. It is a blind source separation (BSS) problem from a SP viewpoint. Research on this topic started in the 1990s in geoscience and remote sensing [3]- [7], enabled by technological advances in hyperspectral sensing at the time. In recent years, blind HU has attracted much interest from other fields such as SP, machine learning, and optimization, and the subsequent cross-disciplinary research activities have made blind HU a vibrant topic. The resulting impact is not just on remote sensing-blind HU has provided a unique problem scenario that inspired researchers from different fields to devise novel blind SP methods. In fact, one may say that blind HU has established a new branch of BSS approaches not seen in classical BSS studies. In particular, the convex geometry concepts-discovered by early remote sensing researchers through empirical observations [3]- [7] and refined by later research-are elegant and very different from statistical independence-based BSS approaches established in
Consider an MISO channel overheard by multiple eavesdroppers. Our goal is to design an artificial noise (AN)-aided transmit strategy, such that the achievable secrecy rate is maximized subject to the sum power constraint. AN-aided secure transmission has recently been found to be a promising approach for blocking eavesdropping attempts. In many existing studies, the confidential information transmit covariance and the AN covariance are not simultaneously optimized. In particular, for design convenience, it is common to prefix the AN covariance as a specific kind of spatially isotropic covariance. This paper considers joint optimization of the transmit and AN covariances for secrecy rate maximization (SRM), with a design flexibility that the AN can take any spatial pattern. Hence, the proposed design has potential in jamming the eavesdroppers more effectively, based upon the channel state information (CSI). We derive an optimization approach to the SRM problem through both analysis and convex conic optimization machinery. We show that the SRM problem can be recast as a single-variable optimization problem, and that resultant problem can be efficiently handled by solving a sequence of semidefinite programs. Our framework deals with a general setup of multiple multi-antenna eavesdroppers, and can cater for additional constraints arising from specific application scenarios, such as interference temperature constraints in interference networks. We also generalize the framework to an imperfect CSI case where a worst-case robust SRM formulation is considered. A suboptimal but safe solution to the outage-constrained robust SRM design is also investigated. Simulation results show that the proposed AN-aided SRM design yields significant secrecy rate gains over an optimal no-AN design and the isotropic AN design, especially when there are more eavesdroppers.Index terms− Physical-layer security, artificial noise, transmit beamforming, semidefinite program. EDICS: MSP-CODR (MIMO precoder/decoder design), MSP-APPL (Applications of MIMO communications and signal processing), SAM-BEAM (Applications of sensor and array multichannel processing) §
Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspectral scene. Many existing approaches to hyperspectral unmixing rely on the pure-pixel assumption, which may be violated for highly mixed data. A heuristic unmixing criterion without requiring the pure-pixel assumption has been reported by Craig: The endmember estimates are determined by the vertices of a minimum-volume simplex enclosing all the observed pixels. In this paper, using convex analysis, we show that the hyperspectral unmixing by Craig's criterion can be formulated as an optimization problem of finding a minimum-volume enclosing simplex (MVES). An algorithm that cyclically solves the MVES problem via linear programs (LPs) is also proposed. Some Monte Carlo simulations are provided to demonstrate the efficacy of the proposed MVES algorithm.
Hyperspectral super-resolution refers to the problem of fusing a hyperspectral image (HSI) and a multispectral image (MSI) to produce a super-resolution image (SRI) that has fine spatial and spectral resolution. State-of-the-art methods approach the problem via low-rank matrix approximations to the matricized HSI and MSI. These methods are effective to some extent, but a number of challenges remain. First, HSIs and MSIs are naturally third-order tensors (data "cubes") and thus matricization is prone to loss of structural information-which could degrade performance. Second, it is unclear whether or not these low-rank matrix-based fusion strategies can guarantee identifiability or exact recovery of the SRI. However, identifiability plays a pivotal role in estimation problems and usually has a significant impact on performance in practice. Third, the majority of the existing methods assume that there are known (or easily estimated) degradation operators applied to the SRI to form the corresponding HSI and MSI-which is hardly the case in practice. In this work, we propose to tackle the super-resolution problem from a tensor perspective. Specifically, we utilize the multidimensional structure of the HSI and MSI to propose a coupled tensor factorization framework that can effectively overcome the aforementioned issues. The proposed approach guarantees the identifiability of the SRI under mild and realistic conditions. Furthermore, it works with little knowledge of the degradation operators, which is clearly an advantage over the existing methods. Semi-real numerical experiments are included to show the effectiveness of the proposed approach.
In recent years there has been growing interest in study of multi-antenna transmit designs for providing secure communication over the physical layer. This paper considers the scenario of an intended multi-input single-output channel overheard by multiple multi-antenna eavesdroppers. Specifically, we address the transmit covariance optimization for secrecy-rate maximization (SRM) of that scenario. The challenge of this problem is that it is a nonconvex optimization problem. This paper shows that the SRM problem can actually be solved in a convex and tractable fashion, by recasting the SRM problem as a semidefinite program (SDP). The SRM problem we solve is under the premise of perfect channel state information (CSI). This paper also deals with the imperfect CSI case. We consider a worst-case robust SRM formulation under spherical CSI uncertainties, and we develop an optimal solution to it, again via SDP. Moreover, our analysis reveals that transmit beamforming is generally the optimal transmit strategy for SRM of the considered scenario, for both the perfect and imperfect CSI cases. Simulation results are provided to illustrate the secrecy-rate performance gains of the proposed SDP solutions compared to some suboptimal transmit designs.Index terms− Physical-layer secrecy, secrecy capacity, transmit beamforming, semidefinite program. EDICS: MSP-CODR (MIMO precoder/decoder design), MSP-APPL (Applications of MIMO communications and signal processing), SAM-BEAM (Applications of sensor and array multichannel processing) § DRAFT Physical-layer secrecy is an information theoretic approach where we intend to provide a legitimate receiver with a reliable communication, and, at the same time, make sure that illegitimate receivers can retrieve almost nothing about the transmitted information from the signals they have intercepted. The study of this topic is meaningful and important, enabling us to understand the information rate limits when perfect secrecy is desired; i.e., the secrecy capacity or the maximum secrecy rate. Moreover, the physical-layer secrecy study provides us with vital implications on how physical-layer secret transmit schemes should be designed in practice. While the concepts of physical-layer secrecy can be found back in the 70's; e.g., the seminal works by Wyner [1], Leung-Yan-Cheong and Hellman [2], and Csisźar and Körner [3], this topic has attracted much interest in recent years, in both information theory [4]- [11] and signal processing [12]-[23]. We can see at least two reasons for this. First, the rapid advances of wireless system architectures and applications, such as those for wireless networks, have given rise to new issues regarding information security. In particular, the open nature of the wireless medium means that signal interception may be easily conducted by eavesdroppers. Cryptographic encryption, the class of techniques commonly used to provide information security, is expected to be faced with more challenges;for instance, in key distribution and management [24], [25]. Physical-laye...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.