PyTorchKR Papers

최신 논문

총 549편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:2010.11218

Compressive Sensing Based Situational Awareness and Sensor Placement for DC Microgrids with Relatively Fixed Operation Patterns

This paper proposes a DC microgrid state estimation and sensor placement method based on compressive sensing. Formulations of various types of measurements and components are developed under the proposed framework. A measurement placing strategy to minimize the coherence of the measurement matrix and thus increase estimation accuracy is presented. Simulation results show that the proposed state estimation and sensor placing approach can effectively reduce the number of sensors to achieve a certain level of estimation accuracy.

arXiv:2010.08135

Model-based Decentralized Bayesian Algorithm for Distributed Compressed Sensing

In this paper, a novel model-based distributed compressive sensing (DCS) algorithm is proposed. DCS exploits the inter-signal correlations and has the capability to jointly recover multiple sparse signals. Proposed approach is a Bayesian decentralized algorithm which uses the type 1 joint sparsity model (JSM-1) and exploits the intra-signal correlations, as well as the inter-signal correlations. Compared to the conventional DCS algorithm, which only exploit the joint sparsity of the signals, the proposed approach takes the intra- and inter-scale dependencies among the wavelet coefficients into account to enable the utilization of the individual signal structure. Furthermore, the Bessel K-form (BKF) is used as the prior distribution which has a sharper peak at zero and heavier tails than the Gaussian distribution. The variational Bayesian (VB) inference is employed to perform the posterior distributions and acquire a closed-form solution for model parameters. Simulation results demonstrate that the proposed algorithm have good recovery performance in comparison with state-of the-art techniques.

arXiv:2009.13787

Far-Field Minimum-Fuel Spacecraft Rendezvous using Koopman Operator and $\ell_2/\ell_1$ Optimization

We propose a method to compute approximate solutions to the minimum-fuel far-field rendezvous problem for thrust-vectoring spacecraft. It is well-known that the use of linearized spacecraft rendezvous equations may not give sufficiently accurate results for far-field rendezvous. In particular, as the distance between the active and the target spacecraft becomes significantly greater than the distance between the target spacecraft and the center of gravity of the planet, the accuracy of linearization-based control design approaches may decline substantially. In this paper, we use a nonlinear state space model which corresponds to more accurate description of dynamics than linearized models but at the same time poses the known challenges of nonlinear control design. To overcome these challenges, we utilize a Koopman operator based approach with which the nonlinear spacecraft rendezvous dynamics is lifted into a higher dimensional space over which the nonlinear dynamics can be approximated by a linear system which is more suitable for control design purposes than the original nonlinear model. An Iteratively Recursive Least Squares (IRLS) algorithm from compressive sensing is then used to solve the minimum fuel control problem based on the lifted linear system. Numerical simulations are performed to show the efficacy of the proposed Koopman operator based approach.

arXiv:2008.07264

One Bit to Rule Them All : Binarizing the Reconstruction in 1-bit Compressive Sensing

This work focuses on the reconstruction of sparse signals from their 1-bit measurements. The context is the one of 1-bit compressive sensing where the measurements amount to quantizing (dithered) random projections. Our main contribution shows that, in addition to the measurement process, we can additionally reconstruct the signal with a binarization of the sensing matrix. This binary representation of both the measurements and sensing matrix can dramatically simplify the hardware architecture on embedded systems, enabling cheaper and more power efficient alternatives. Within this framework, given a sensing matrix respecting the restricted isometry property (RIP), we prove that for any sparse signal the quantized projected back-projection (QPBP) algorithm achieves a reconstruction error decaying like O(m-1/2)when the number of measurements m increases. Simulations highlight the practicality of the developed scheme for different sensing scenarios, including random partial Fourier sensing.

arXiv:2007.15202

Third-Order Statistics Reconstruction from Compressive Measurements

Estimation of third-order statistics relies on the availability of a huge amount of data records, which can pose severe challenges on the data collecting hardware in terms of considerable storage costs, overwhelming energy consumption, and unaffordably high sampling rate especially when dealing with high-dimensional data such as wideband signals. To overcome these challenges, this paper focuses on the reconstruction of the third-order cumulants under the compressive sensing framework. Specifically, this paper derives a transformed linear system that directly connects the cross-cumulants of compressive measurements to the desired third-order statistics. We provide sufficient conditions for lossless third-order statistics reconstruction via solving simple least-squares, along with the strongest achievable compression ratio. To reduce the computational burden, we also propose an approach to recover diagonal cumulant slices directly from compressive measurements, which is useful when the cumulant slices are sufficient for the inference task at hand. All the proposed techniques are tested via extensive simulations. The developed joint sampling and reconstruction approach to third-order statistics estimation is able to reduce the required sampling rates significantly by exploiting the cumulant structure resulting from signal stationarity, even in the absence of any sparsity constraints on the signal or cumulants.

arXiv:2007.10250

Across-domains transferability of Deep-RED in de-noising and compressive sensing recovery of seismic data

In the past decade, deep learning algorithms gained a remarkable interest in the signal processing community. The availability of big datasets and advanced computational resources resulted in developing efficient algorithms. However, such algorithms are biased towards the training dataset. Thus, the transferability of deep-learning-based operators are challenging, especially when the goal is to apply the learned operator on a new dataset/domain. Lack of transferability of learned operator across domains hinders the applicability of deep learning algorithms in processing seismic data. Unlike camera images, the comprehensively labeled seismic datasets are not available. Moreover, from one task to another, the training parameters should be tuned. To remedy this shortcoming, we have developed a workflow that transfers the learned operator from the camera images to the seismic domain, without modifying its training parameters. The similarities in the algorithms and optimization methods in camera and seismic data processing allow us to do so. Accordingly, by incorporating feed-forward de-noising convolutional neural networks (DnCNN) in regularization by de-noising regularizer, we formulate two transferable optimization problems for de-noising and compressive sensing recovery of seismic data. Simulated and real-world data examples show the efficiency of our proposed workflow.

arXiv:2007.05177공식 코드 · Papers with Code

Deep Unfolding Basis Pursuit: Improving Sparse Channel Reconstruction via Data-Driven Measurement Matrices

For massive multiple-input multiple-output (MIMO) systems operating in frequency-division duplex mode, downlink channel state information (CSI) acquisition will incur large overhead. This overhead is substantially reduced when sparse channel estimation techniques are employed, owing to the channel sparsity in the angular domain. When a sparse channel estimation method is implemented, the measurement matrix, which is related to the pilot matrix, is essential to the channel estimation performance. Existing sparse channel estimation schemes widely adopt random measurement matrices, which have been criticized for their suboptimal reconstruction performance. This paper proposes novel data-driven solutions to design the measurement matrix. Model-based autoencoders are customized to optimize the measurement matrix by unfolding the classical basis pursuit algorithm. The obtained data-driven measurement matrices are applied to existing sparse reconstruction algorithms, leading to flexible hybrid data-driven implementations for sparse channel estimation. Numerical results show that the proposed data-driven measurement matrices can achieve more accurate reconstructions and use fewer measurements than the existing random matrices, thereby leading to a higher achievable rate for CSI acquisition. Moreover, compared with existing pure deep learning-based sparse reconstruction methods, the proposed hybrid data-driven scheme, which uses the novel data-driven measurement matrices with conventional sparse reconstruction algorithms, can achieve higher reconstruction accuracy.

arXiv:2006.09860

Compressed-Domain Detection and Estimation for Colocated MIMO Radar

This paper proposes compressed domain signal processing (CSP) multiple input multiple output (MIMO) radar, a MIMO radar approach that achieves substantial sample complexity reduction by exploiting the idea of CSP. CSP MIMO radar involves two levels of data compression followed by target detection at the compressed domain. First, compressive sensing is applied at the receive antennas, followed by a Capon beamformer which is designed to suppress clutter. Exploiting the sparse nature of the beamformer output, a second compression is applied to the filtered data. Target detection is subsequently conducted by formulating and solving a hypothesis testing problem at each grid point of the discretized angle space. The proposed approach enables an 8-fold reduction of the sample complexity in some settings as compared to a conventional compressed sensing (CS) MIMO radar thus enabling faster target detection. Receiver operating characteristic (ROC) curves of the proposed detector are provided. Simulation results show that the proposed approach outperforms recovery-based compressed sensing algorithms.

arXiv:2005.07685

Provable Convergence of Plug-and-Play Priors with MMSE denoisers

Plug-and-play priors (PnP) is a methodology for regularized image reconstruction that specifies the prior through an image denoiser. While PnP algorithms are well understood for denoisers performing maximum a posteriori probability (MAP) estimation, they have not been analyzed for the minimum mean squared error (MMSE) denoisers. This letter addresses this gap by establishing the first theoretical convergence result for the iterative shrinkage/thresholding algorithm (ISTA) variant of PnP for MMSE denoisers. We show that the iterates produced by PnP-ISTA with an MMSE denoiser converge to a stationary point of some global cost function. We validate our analysis on sparse signal recovery in compressive sensing by comparing two types of denoisers, namely the exact MMSE denoiser and the approximate MMSE denoiser obtained by training a deep neural net.

arXiv:2005.05485

Site-specific online compressive beam codebook learning in mmWave vehicular communication

Millimeter wave (mmWave) communication is one viable solution to support Gbps sensor data sharing in vehicular networks. The use of large antenna arrays at mmWave and high mobility in vehicular communication make it challenging to design fast beam alignment solutions. In this paper, we propose a novel framework that learns the channel angle-of-departure (AoD) statistics at a base station (BS) and uses this information to efficiently acquire channel measurements. Our framework integrates online learning for compressive sensing (CS) codebook learning and the optimized codebook is used for CS-based beam alignment. We formulate a CS matrix optimization problem based on the AoD statistics available at the BS. Furthermore, based on the CS channel measurements, we develop techniques to update and learn such channel AoD statistics at the BS. We use the upper confidence bound (UCB) algorithm to learn the AoD statistics and the CS matrix. Numerical results show that the CS matrix in the proposed framework provides faster beam alignment than standard CS matrix designs. Simulation results indicate that the proposed beam training technique can reduce overhead by 80% compared to exhaustive beam search, and 70% compared to standard CS solutions that do not exploit any AoD statistics.

arXiv:2003.10237

A Gridless Compressive Sensing Based Channel Estimation for Millimeter Wave Massive MIMO Systems from 1-Bit Measurements

This paper considers the problem of estimating the sparse millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) OFDM channel from 1-bit quantized measurements. Unlike previous quantized on-grid approaches to compressive sensing, we introduce an off-grid convex scheme which uses binary atomic norm minimization (BiANM) to estimate sparse channel form 1-bit measurements. Moreover, in this paper, we propose a decoupled angle-delay version of BiANM called decoupled binary atomic norm minimization (DeBiANM) in order to reduce complexity. Further, for improving the accuracy of the estimation, we develop reweighted version of BiANM named reweighted binary atomic norm minimization (ReBiANM) that is a trade-off between atomic $\ell_0$ norm and atomic $\ell_1$ norm. Also, for improvement the performance of the DeBiANM, we introduce the reweighted version of DeBiANM, termed as reweighted decoupled binary atomic minimization (ReDeBiANM). Finally, through the simulation results, the performance of the proposed methods are studied.

arXiv:2002.12646

IoT Connectivity Technologies and Applications: A Survey

The Internet of Things (IoT) is rapidly becoming an integral part of our life and also multiple industries. We expect to see the number of IoT connected devices explosively grows and will reach hundreds of billions during the next few years. To support such a massive connectivity, various wireless technologies are investigated. In this survey, we provide a broad view of the existing wireless IoT connectivity technologies and discuss several new emerging technologies and solutions that can be effectively used to enable massive connectivity for IoT. In particular, we categorize the existing wireless IoT connectivity technologies based on coverage range and review diverse types of connectivity technologies with different specifications. We also point out key technical challenges of the existing connectivity technologies for enabling massive IoT connectivity. To address the challenges, we further review and discuss some examples of promising technologies such as compressive sensing (CS) random access, non-orthogonal multiple access (NOMA), and massive multiple input multiple output (mMIMO) based random access that could be employed in future standards for supporting IoT connectivity. Finally, a classification of IoT applications is considered in terms of various service requirements. For each group of classified applications, we outline its suitable IoT connectivity options.

arXiv:2001.08717공식 코드 · Papers with Code

Finer Metagenomic Reconstruction via Biodiversity Optimization

When analyzing communities of microorganisms from their sequenced DNA, an important task is taxonomic profiling: enumerating the presence and relative abundance of all organisms, or merely of all taxa, contained in the sample. This task can be tackled via compressive-sensing-based approaches, which favor communities featuring the fewest organisms among those consistent with the observed DNA data. Despite their successes, these parsimonious approaches sometimes conflict with biological realism by overlooking organism similarities. Here, we leverage a recently developed notion of biological diversity that simultaneously accounts for organism similarities and retains the optimization strategy underlying compressive-sensing-based approaches. We demonstrate that minimizing biological diversity still produces sparse taxonomic profiles and we experimentally validate superiority to existing compressive-sensing-based approaches. Despite showing that the objective function is almost never convex and often concave, generally yielding NP-hard problems, we exhibit ways of representing organism similarities for which minimizing diversity can be performed via a sequence of linear programs guaranteed to decrease diversity. Better yet, when biological similarity is quantified by $k$-mer co-occurrence (a popular notion in bioinformatics), minimizing diversity actually reduces to one linear program that can utilize multiple $k$-mer sizes to enhance performance. In proof-of-concept experiments, we verify that the latter procedure can lead to significant gains when taxonomically profiling a metagenomic sample, both in terms of reconstruction accuracy and computational performance. Reproducible code is available at https://github.com/dkoslicki/MinimizeBiologicalDiversity.

arXiv:2001.07560

Robust Symbol Detection in Overloaded NOMA Systems

We present a framework for the design of low-complexity and high-performance receivers for multidimensional overloaded NOMA systems. The framework is built upon a novel compressive sensing (CS) regularized maximum likelihood formulation of the discrete-input detection problem, in which the L0-norm is introduced to enforce adherence of the solution to the prescribed discrete symbol constellation. Unlike much of preceding literature, the method is not relaxed into the L1-norm, but rather approximated with a continuous and asymptotically exact expression without resorting to parallel interference cancellation. The objective function of the resulting formulation is thus a sum of concave-over-convex ratios, which is then tightly convexized via the quadratic transform, such that its solution can be obtained via the iteration of a simple closed-form expression that closely resembles that of the classic zero-forcing (ZF) receiver. By further transforming the aforementioned problem into a quadratically constrained quadratic program with one convex constraint (QCQP-1), the optimal regularization parameter to be used at each step of the iterative algorithm is then shown to be the largest generalized eigenvalue of a pair of matrices which are given in closed-form. The method so obtained, referred to as the IDLS, is then extended to address several factors of practical relevance, such as noisy conditions, imperfect CSI, and hardware impairments, thus yielding the Robust IDLS algorithm. Simulation results show that the proposed art significantly outperforms both classic receivers, such as the LMMSE, and recent CS-based alternatives, such as the SOAV and the SCSR detectors.

arXiv:2001.01833

Line-based compressive sensing for low-power visual applications

In this paper, a Line based Compressive Sensing (LCS) scheme is discussed and proposed for low power visual applications, in which image acquisition is performed in a line-by-line manner at the encoder side using same measurement operator. Such approach reduces the computational burden and makes the implementation process easier (at encoder) plus provides better and more efficient initial reconstruction (at decoder) than other CS techniques. The reconstruction algorithm is based on the combination of the conventional augmented Lagrangian method with variable splitting and alternating direction method and is referred as TV-AL3. The simulation results show that the proposed line based CS scheme not only improves the quality of image by 1dB to ~3dB at various subrates, when compared to the conventional CS schemes but also reduces the computational complexity at the encoder side.

arXiv:1911.06700

A Gridless Compressive Sensing Based Channel Estimation for Millimeter Wave MIMO OFDM Systems with One-Bit Quantization

This paper considers the problem of estimating the sparse mmWave massive multiple input - multiple output (MIMO) OFDM channel from one-bit quantized measurements. Unlike previous grid-based one-bit compressive sensing approaches, we present a gridless convex method to recover sparse channel form one-bit measurements via Binary Atomic Norm Minimization (BiANM) and Reweighted Binary Atomic Norm Minimization (ReBiANM). Simulation results verify the accuracy of the binary and reweighted binary atomic norm minimization techniques.

arXiv:1909.07971

On reconstruction algorithms for signals sparse in Hermite and Fourier domains

This thesis consists of original contributions in the area of digital signal processing. The reconstruction of signals sparse (highly concentrated) in various transform domains is the primary problem analyzed in the thesis. The considered domains include Fourier, discrete Hermite, one-dimensional and two-dimensional discrete cosine transform, as well as various time-frequency representations. Sparse signals are reconstructed using sparsity measures, being, in fact, the measures of signal concentration in the considered domains. The thesis analyzes the compressive sensing reconstruction algorithms and introduces new approaches to the problem at hand. The missing samples influence on analyzed transform domains is studied in detail, establishing the relations with the general compressive sensing theory. This study provides new insights on phenomena arising due to the reduced number of signal samples. The theoretical contributions involve new exact mathematical expressions which describe performance and outcomes of reconstruction algorithms, also including the study of the influence of additive noise, sparsity level and the number of available measurements on the reconstruction performance, exact expressions for reconstruction errors and error probabilities. Parameter optimization of the discrete Hermite transform is also studied, as well as the additive noise influence on Hermite coefficients, resulting in new parameter optimization and denoising algorithms. Additionally, an algorithm for the decomposition of multivariate multicomponent signals is introduced, as well as an instantaneous frequency estimation algorithm based on the Wigner distribution. Extensive numerical examples and experiments with real and synthetic data validate the presented theory and shed a new light on practical applications of the results.

arXiv:1908.11082

Enhanced block sparse signal recovery based on $q$-ratio block constrained minimal singular values

In this paper we introduce the $q$-ratio block constrained minimal singular values (BCMSV) as a new measure of measurement matrix in compressive sensing of block sparse/compressive signals and present an algorithm for computing this new measure. Both the mixed $\ell_2/\ell_q$ and the mixed $\ell_2/\ell_1$ norms of the reconstruction errors for stable and robust recovery using block Basis Pursuit (BBP), the block Dantzig selector (BDS) and the group lasso in terms of the $q$-ratio BCMSV are investigated. We establish a sufficient condition based on the $q$-ratio block sparsity for the exact recovery from the noise free BBP and developed a convex-concave procedure to solve the corresponding non-convex problem in the condition. Furthermore, we prove that for sub-Gaussian random matrices, the $q$-ratio BCMSV is bounded away from zero with high probability when the number of measurements is reasonably large. Numerical experiments are implemented to illustrate the theoretical results. In addition, we demonstrate that the $q$-ratio BCMSV based error bounds are tighter than the block restricted isotropic constant based bounds.

arXiv:1907.11904

Amplitude Retrieval for Channel Estimation of MIMO Systems with One-Bit ADCs

This letter revisits the channel estimation problem for MIMO systems with one-bit analog-to-digital converters (ADCs) through a novel algorithm--Amplitude Retrieval (AR). Unlike the state-of-the-art methods such as those based on one-bit compressive sensing, AR takes a different approach. It accounts for the lost amplitudes of the one-bit quantized measurements, and performs channel estimation and amplitude completion jointly. This way, the direction information of the propagation paths can be estimated via accurate direction finding algorithms in array processing, e.g., maximum likelihood. The upsot is that AR is able to handle off-grid angles and provide more accurate channel estimates. Simulation results are included to showcase the advantages of AR.

arXiv:1905.08869

Source Localization and Tracking for Dynamic Radio Cartography using Directional Antennas

Utilization of directional antennas is a promising solution for efficient spectrum sensing and accurate source localization and tracking. Spectrum sensors equipped with directional antennas should constantly scan the space in order to track emitting sources and discover new activities in the area of interest. In this paper, we propose a new formulation that unifies received-signal-strength (RSS) and direction of arrival (DoA) in a compressive sensing (CS) framework. The underlying CS measurement matrix is a function of beamforming vectors of sensors and is referred to as the propagation matrix. Comparing to the omni-directional antenna case, our employed propagation matrix provides more incoherent projections, an essential factor in the compressive sensing theory. Based on the new formulation, we optimize the antenna beams, enhance spectrum sensing efficiency, track active primary users accurately and monitor spectrum activities in an area of interest. In many practical scenarios there is no fusion center to integrate received data from spectrum sensors. We propose the distributed version of our algorithm for such cases. Experimental results show a significant improvement in source localization accuracy, compared with the scenario when sensors are equipped with omni-directional antennas. Applicability of the proposed framework for dynamic radio cartography is shown. Moreover, comparing the estimated dynamic RF map over time with the ground truth demonstrates the effectiveness of our proposed method for accurate signal estimation and recovery.