One-Bit Compressive Sensing via Schur-Concave Function Minimization

DOI10.1109/TSP.2019.2925606MaRDI QIDQ5238964zbMATH OpenFDO

Authors Peng Xiao, Bin Liao, Jian Li

Publication date 28 October 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2019.2925606

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(6)

• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
• Advances in Neural Networks – ISNN 2005
• One-bit gridless DOA estimation with multiple measurements exploiting accelerated proximal gradient algorithm
• Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
• Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function
• Tsallis entropy penalized robust 1-bit compressive sensing against sign flips

This page was built for publication: One-Bit Compressive Sensing via Schur-Concave Function Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238964)