Sampling Without Input Constraints: Consistent Reconstruction in Arbitrary Spaces

  • Yonina C. Eldar
Part of the Applied and Numerical Harmonic Analysis book series (ANHA)


In this chapter we develop a general framework for sampling and reconstruction procedures. The procedures we develop allow for almost arbitrary sampling and reconstruction spaces, as well as arbitrary input signals. The rudimentary constraint we impose on the reconstruction is that if the input lies in the reconstruction space, then the reconstruction will be equal to the original signal, so that our framework includes the more restrictive perfect reconstruction theories as special cases.

In our development we consider both nonredundant sampling and redundant sampling in which the samples constitute an overcomplete representation of the signal. In this case reconstruction is obtained using the oblique dual frame vectors, which lead to frame expansions in which the analysis and synthesis frame vectors are not constrained to lie in the same space as in conventional frame expansions. As we show, the algorithms we develop are consistent, so that the reconstructed signal has the property that although it is not necessarily equal to the original signal, it nonetheless yields the same measurements. Building upon this property of our algorithms, we develop a general procedure for constructing signals with prescribed properties.


Oblique Projection Perfect Reconstruction Reconstruction Scheme Sampling Vector Input Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aldroubi, Portraits of frames.Proc. Amer. Math. Soc.123:1661–1668, 1995.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [2]
    A. Aldroubi, Oblique projections in atomic spaces.Proc. Amer. Math. Soc.124(7): 2051–2060, 1996.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    A. Aldroubi and M. Unser, Sampling procedures in function spaces and asymptotic equivalence with Shannon’s sampling theory.Numer. Funct. Anal. Optimiz.15:1–21, Feb. 1994.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    T. Blu and M. Unser, Quantitative Fourier analysis of approximation techniques: Part I-Interpolators and projectors.IEEE Trans. Signal Processing47(10):2783–2795, Oct. 1999.MathSciNetCrossRefzbMATHGoogle Scholar
  5. [5]
    T. Blu and M. Unser, Quantitative Fourier analysis of approximation techniques: Part II-Wavelets.IEEE Trans. Signal Processing47(10):2796–2806, Oct. 1999.MathSciNetCrossRefzbMATHGoogle Scholar
  6. [6]
    I. DaubechiesTen Lectures on Wavelets.SIAM, Philadelphia PA, 1992.CrossRefzbMATHGoogle Scholar
  7. [7]
    I. Djokovic and P. P. Vaidyanathan, Generalized sampling theorems in multiresolution subspaces.IEEE Trans. Signal Processing45:583–599, Mar. 1997.CrossRefGoogle Scholar
  8. [8]
    Y. C. Eldar, Sampling and reconstruction in arbitrary spaces and oblique dual frame vectors.J. Fourier Analys. Appl.l(9):77–96, Jan. 2003.MathSciNetCrossRefGoogle Scholar
  9. [9]
    Y. C. EldarQuantum Signal Processing.Ph.D. thesis, Massachusetts Institute of Technology, Dec. 2001; also available at
  10. [10]
    Y. C. Eldar and A. V. Oppenheim, Filter bank reconstruction of bandlimited signals from nonuniform and generalized samples.IEEE Trans. Signal Processing48: 2864–2875, Oct. 2000.MathSciNetCrossRefGoogle Scholar
  11. [11]
    Y. C. Eldar and A. V. Oppenheim, Nonredundant and redundant sampling with arbitrary sampling and reconstruction spaces.Proceedings of the 2001 Workshop on Sampling Theory and Applications, SampTA’01, pages 229–234, May 2001.Google Scholar
  12. [12]
    G. H. Golub and C. F. Van LoanMatrix Computations.Johns Hopkins University Press, Baltimore, MD, third edition, 1996.Google Scholar
  13. [13]
    V. K. Goyal, M. Vetterli, and N. T. Thao, Quantized overcomplete expansions in RN:Analysis, synthesis, and algorithms.IEEE Trans. Inform. Theory44:16–31, Jan. 1998.MathSciNetCrossRefzbMATHGoogle Scholar
  14. [14]
    C. E. Heil and D. F. Walnut, Continuous and discrete wavelet transforms.SIAM Rev.31(4):628–666, Dec. 1989.MathSciNetCrossRefzbMATHGoogle Scholar
  15. [15]
    K. Hoffman and R. KunzeLinear Algebra.Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1971.Google Scholar
  16. [16]
    R. A. Horn and C. R. JohnsonMatrix Analysis.Cambridge, UK: Cambridge Univ. Press, 1985.Google Scholar
  17. [17]
    G. Kaiser, AFriendly Guide to Wavelets.Birkhäuser, Boston, MA, 1994.zbMATHGoogle Scholar
  18. [18]
    S. Kayalar and H. L. Weinert, Oblique projections: Formulas, algorithms, and error bounds.Math. Contr. Signals Syst.2(l):33–45, 1989.MathSciNetCrossRefzbMATHGoogle Scholar
  19. [19]
    N. Macon and A. Spitzbart, Inverses of Vandermonde matrices.American MathematicalMonthly,65(2):95–100,Feb. 1958.MathSciNetCrossRefzbMATHGoogle Scholar
  20. [20]
    S. G. Mallat, A theory of multiresolution signal decomposition: The wavelet representation.IEEE Trans. Pattern Anal. Mach. Intell.11:674–693, 1989.CrossRefzbMATHGoogle Scholar
  21. [21]
    R. D. Milne, An oblique matrix pseudoinverse.SIAM J. Appl. Math.16(5):931–944, Sep. 1968.MathSciNetCrossRefzbMATHGoogle Scholar
  22. [22]
    A. Papoulis, A new algorithm in spectral analysis and bandlimited extrapolation.IEEE Trans. Circuits Syst.CAS-22:735–742, 1975.MathSciNetCrossRefGoogle Scholar
  23. [23]
    A. PapoulisProbability, Random Variables, and Stochastic Processes.McGraw-Hill, New York, Inc., third edition, 1991.Google Scholar
  24. [24]
    F. D. Parker, Inverses of Vandermonde matrices.American Mathematical Monthly71(4):410–411, Apr. 1964.MathSciNetCrossRefzbMATHGoogle Scholar
  25. [25]
    H. Stark and Y. YangVector Space Projections.John Wiley & Sons, Inc., New York, 1998.zbMATHGoogle Scholar
  26. [26]
    W. S. Tang, Oblique projections, biorthogonal Riesz bases and multiwavelets in Hubert space.Proc. Amer. Math. Soc128(2):463–473, 2000.MathSciNetCrossRefzbMATHGoogle Scholar
  27. [27]
    M. Unser, Splines: A perfect fit for signal and image processing.IEEE Signal Processing Mag.pages 22–38, Nov. 1999.Google Scholar
  28. [28]
    M. Unser, Sampling-50 years after Shannon.IEEE Proc.88:569–587, Apr. 2000.CrossRefGoogle Scholar
  29. [29]
    M. Unser and A. Aldroubi, A general sampling theory for nonideal acquisition devices.IEEE Trans. Signal Processing42(11):2915–2925, Nov. 1994.CrossRefGoogle Scholar
  30. [30]
    M. Unser and J. Zerubia, Generalized sampling: Stability and performance analysis.IEEE Trans. Signal Processing45(12):2941–2950, Dec. 1997.CrossRefGoogle Scholar
  31. [31]
    M. Unser and J. Zerubia, A generalized sampling theory without band-limiting constraints.IEEE Trans. Circuits Syst. II45(8):959–969, Aug. 1998.CrossRefzbMATHGoogle Scholar
  32. [32]
    P. P. Vaidyanathan, Generalizations of the sampling theorem: Seven decades after Nyquist.IEEE Trans. Circuit Syst. I48(9): 1094–1109, Sep. 2001.MathSciNetCrossRefzbMATHGoogle Scholar
  33. [33]
    P. P. Vaidyanathan and B. Vrcelj, Biorthogonal partners and applications.IEEE Trans. Signal Processing49(5):1013–1027, May 2001.MathSciNetCrossRefGoogle Scholar
  34. [34]
    T. Werther and Y. C. Eldar, General framework for consistent sampling in Hilbert spaces.submitted to J. Fourier Analys. Appl.Sept. 2003.Google Scholar

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Yonina C. Eldar

There are no affiliations available

Personalised recommendations