A Unified Theory of Union of Subspaces Representations for Period Estimation

Several popular period estimation techniques use union-of-subspaces models to represent periodic signals. The main idea behind these techniques is to compare the components of the signal along a set of subspaces representing different periods. Such techniques were shown to offer important advantages over traditional methods, such as those based on DFT. So far, most of these subspace techniques have been developed independent of each other, and there has not been a unified theory analyzing them from a common perspective. In this paper, all such methods are first unified under one general framework. Further, several fundamental aspects of such subspaces are investigated, such as the conditions under which a generic set of subspaces offers unique periodic decompositions, their minimum required dimensions, etc. A number of basic questions in the context of dictionaries spanning periodic signals are also answered. For example, what is the theoretically minimum number of atoms required in any type of dictionary, in order to be able to represent periods 1 ≤ P ≤ Pmax? For each period P , what should be the minimum dimension of the subspace of atoms representing the Pth period itself? Unlike in traditional Fourier dictionaries, it is shown that nonuniform and compact grids are crucial for period estimation. Interestingly, it will be seen that the Euler totient function from number theory plays an important role in providing the answers to all such questions.

[1]  Emmanuel J. Candès,et al.  Towards a Mathematical Theory of Super‐resolution , 2012, ArXiv.

[2]  G. Benson,et al.  Tandem repeats finder: a program to analyze DNA sequences. , 1999, Nucleic acids research.

[3]  Manolis Tsiknakis,et al.  Absence seizure epilepsy detection using linear and nonlinear eeg analysis methods , 2013, 2013 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC).

[4]  P. P. Vaidyanathan,et al.  Pushing the Limits of Sparse Support Recovery Using Correlation Information , 2015, IEEE Transactions on Signal Processing.

[5]  Von Welch,et al.  Reproducing GW150914: The First Observation of Gravitational Waves From a Binary Black Hole Merger , 2016, Computing in Science & Engineering.

[6]  Metod Saniga,et al.  Ramanujan sums analysis of long-period sequences and 1/f noise , 2008, 0812.2170.

[7]  Michel Planat,et al.  Ramanujan sums for signal processing of low-frequency noise. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[9]  P. P. Vaidyanathan.  Ramanujan Sums in the Context of Signal Processing—Part II: FIR Representations and Applications , 2014, IEEE Transactions on Signal Processing.

[10]  T. Parks,et al.  Maximum likelihood pitch estimation , 1976, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.

[11]  Mike E. Davies,et al.  Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces , 2009, IEEE Transactions on Information Theory.

[12]  Thomas W. Parks,et al.  Orthogonal, exactly periodic subspace decomposition , 2003, IEEE Trans. Signal Process..

[13]  P. P. Vaidyanathan,et al.  The farey-dictionary for sparse representation of periodic signals , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[14]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[15]  M. Nakashizuka.  A Sparse Decomposition for Periodic Signal Mixtures , 2007, 2007 15th International Conference on Digital Signal Processing.

[16]  Petre Stoica,et al.  Spectral Analysis of Signals , 2009 .

[17]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[18]  P. P. Vaidyanathan,et al.  Gridless methods for underdetermined source estimation , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

[19]  Massimo Fornasier,et al.  Compressive Sensing , 2015, Handbook of Mathematical Methods in Imaging.

[20]  P. P. Vaidyanathan,et al.  A Grid-Less Approach to Underdetermined Direction of Arrival Estimation Via Low Rank Matrix Denoising , 2014, IEEE Signal Processing Letters.

[21]  Soo-Chang Pei,et al.  Intrinsic Integer-Periodic Functions for Discrete Periodicity Detection , 2015, IEEE Signal Processing Letters.

[22]  P. P. Vaidyanathan,et al.  Minimal dictionaries for spanning periodic signals , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[23]  William A. Sethares,et al.  Periodicity transforms , 1999, IEEE Trans. Signal Process..

[24]  John M. Butler,et al.  STRBase: a short tandem repeat DNA database for the human identity testing community , 2001, Nucleic Acids Res..

[25]  Stephen A. Dyer,et al.  Digital signal processing , 2018, 8th International Multitopic Conference, 2004. Proceedings of INMIC 2004..

[26]  R. O. Schmidt,et al.  Multiple emitter location and signal Parameter estimation , 1986 .

[27]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[28]  Petros Maragos,et al.  Harmonic analysis and restoration of separation methods for periodic signal mixtures: Algebraic separation versus comb filtering , 1998, Signal Process..

[29]  M. Bertinelli,et al.  Analysis of T-wave alternans using the Ramanujan transform , 2008, 2008 Computers in Cardiology.

[30]  Rolf Unbehauen,et al.  Separation of periodic signals by using an algebraic method , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[31]  P. P. Vaidyanathan,et al.  Nested Periodic Matrices and Dictionaries: New Signal Representations for Period Estimation , 2015, IEEE Transactions on Signal Processing.

[32]  P. P. Vaidyanathan,et al.  Ramanujan filter banks for estimation and tracking of periodicities , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[33]  A. Hewish,et al.  Observation of a Rapidly Pulsating Radio Source , 1968, Nature.

[34]  P. P. Vaidyanathan,et al.  Ramanujan Sums in the Context of Signal Processing—Part I: Fundamentals , 2014, IEEE Transactions on Signal Processing.

[35]  P. P. Vaidyanathan,et al.  Detecting tandem repeats in DNA using Ramanujan Filter Bank , 2016, 2016 IEEE International Symposium on Circuits and Systems (ISCAS).

[36]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[37]  Karthikeyan Umapathy,et al.  Time-Frequency Analysis via Ramanujan Sums , 2012, IEEE Signal Processing Letters.

[38]  P. P. Vaidyanathan,et al.  Correlation-aware techniques for sparse support recovery , 2012, 2012 IEEE Statistical Signal Processing Workshop (SSP).

[39]  M. Omair Ahmad,et al.  Ramanujan sums and discrete Fourier transforms , 2005, IEEE Signal Processing Letters.

[40]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[41]  Marco F. Duarte,et al.  Spectral compressive sensing , 2013 .

[42]  Dmitry M. Malioutov,et al.  A sparse signal reconstruction perspective for source localization with sensor arrays , 2005, IEEE Transactions on Signal Processing.

[43]  C. Ponting,et al.  Protein repeats: structures, functions, and evolution. , 2001, Journal of structural biology.

[44]  P. P. Vaidyanathan,et al.  Properties of Ramanujan filter banks , 2015, 2015 23rd European Signal Processing Conference (EUSIPCO).

[45]  Martin J. Wainwright,et al.  Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$ -Constrained Quadratic Programming (Lasso) , 2009, IEEE Transactions on Information Theory.