Signal Recovery From Unlabeled Samples

In this paper, we study the recovery of a signal from a set of noisy linear projections (measurements), when such projections are unlabeled, that is, the correspondence between the measurements and the set of projection vectors (i.e., the rows of the measurement matrix) is not known a priori. We consider a special case of unlabeled sensing referred to as unlabeled ordered sampling (UOS) where the ordering of the measurements is preserved. We identify a natural duality between this problem and classical compressed sensing (CS), where we show that the unknown support (location of nonzero elements) of a sparse signal in CS corresponds to the unknown indices of the measurements in UOS. While in CS, it is possible to recover a sparse signal from an underdetermined set of linear equations (less equations than the signal dimension), successful recovery in UOS requires taking more samples than the dimension of the signal. Motivated by this duality, we develop a restricted isometry property (RIP) similar to that in CS. We also design a low-complexity alternating minimization algorithm that achieves a stable signal recovery under the established RIP. We analyze our proposed algorithm for different signal dimensions and number of measurements theoretically and investigate its performance empirically via numerical simulations. The results are reminiscent of a phase transition occurring in CS.

[1]  V.,et al.  On the Problem of Time Jitter in Sampling * , 1998 .

[2]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .

[3]  M. Mitzenmacher.  A survey of results for deletion channels and related synchronization channels , 2009 .

[4]  Laurent Jacques,et al.  Through the Haze: A Non-Convex Approach to Blind Calibration for Linear Random Sensing Models , 2016, ArXiv.

[5]  M. Talagrand.  Upper and Lower Bounds for Stochastic Processes: Modern Methods and Classical Problems , 2014 .

[6]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[7]  Thomas Strohmer,et al.  Self-calibration and biconvex compressive sensing , 2015, ArXiv.

[8]  Xiaorui Sun,et al.  Linear regression without correspondence , 2017, NIPS.

[9]  Thomas Strohmer,et al.  General Deviants: An Analysis of Perturbations in Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

[10]  Xiaodong Li,et al.  Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization , 2016, Applied and Computational Harmonic Analysis.

[11]  Giuseppe Caire,et al.  Signal recovery from unlabeled samples , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[12]  G. Casella,et al.  Statistical Inference , 2003, Encyclopedia of Social Network Analysis and Mining.

[13]  X. Huang,et al.  CAP3: A DNA sequence assembly program. , 1999, Genome research.

[14]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[15]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[16]  Martin Vetterli,et al.  Unlabeled sensing: Solving a linear system with unordered measurements , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  R. Vershynin.  Estimation in High Dimensions: A Geometric Perspective , 2014, 1405.5103.

[18]  Biao Huang,et al.  System Identification , 2000, Control Theory for Physicists.

[19]  J. Vybíral.  Random Matrices and Matrix Completion , 2016, 1609.07929.

[20]  Ali Esmaili,et al.  Probability and Random Processes , 2005, Technometrics.

[21]  Xiaodong Li,et al.  Phase Retrieval via Wirtinger Flow: Theory and Algorithms , 2014, IEEE Transactions on Information Theory.

[22]  Merril I. Skolnik,et al.  Introduction to radar systems /2nd edition/ , 1980 .

[23]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[24]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[25]  Christopher Rose,et al.  Timing Channels with Multiple Identical Quanta , 2012, ArXiv.

[26]  Martin J. Wainwright,et al.  Linear regression with an unknown permutation: Statistical and computational limits , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[27]  Martin Vetterli,et al.  Unlabeled Sensing With Random Linear Measurements , 2015, IEEE Transactions on Information Theory.

[28]  R. Rockafellar,et al.  Implicit Functions and Solution Mappings , 2009 .

[29]  S. Ramakrishna,et al.  Dynamics from noisy data with extreme timing uncertainty , 2016, Nature.

[30]  Deanna Needell,et al.  Mixed operators in compressed sensing , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[31]  David Tse,et al.  Optimal assembly for high throughput shotgun sequencing , 2013, BMC Bioinformatics.

[32]  Martin J. Wainwright,et al.  Denoising linear models with permuted data , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[33]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[34]  Petre Stoica,et al.  Decentralized Control , 2018, The Control Systems Handbook.

[35]  Mike E. Davies,et al.  Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.

[36]  M. Skolnik,et al.  Introduction to Radar Systems , 2021, Advances in Adaptive Radar Detection and Range Estimation.