22 May 2014 Fixing basis mismatch in compressively sampled photonic link
Author Affiliations +
Abstract
The theory behind compressive sampling pre-supposes that a given sequence of observations may be exactly represented by a linear combination of a small number of vectors. In practice, however, even small deviations from an exact signal model can result in dramatic increases in estimation error; this is the so-called basis mismatch" problem. This work provides one possible solution to this problem in the form of an iterative, biconvex search algorithm. The approach uses standard ℓ1-minimization to find the signal model coefficients followed by a maximum likelihood estimate of the signal model. The process is repeated until a convergence criteria is met. The algorithm is illustrated on harmonic signals of varying sparsity and outperforms the current state-of-the-art.
© (2014) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. M. Nichols, J. M. Nichols, F. Bucholtz, F. Bucholtz, C. V. McLaughlin, C. V. McLaughlin, A. K. Oh, A. K. Oh, R. M. Willett, R. M. Willett, } "Fixing basis mismatch in compressively sampled photonic link", Proc. SPIE 9118, Independent Component Analyses, Compressive Sampling, Wavelets, Neural Net, Biosystems, and Nanoengineering XII, 91180N (22 May 2014); doi: 10.1117/12.2053739; https://doi.org/10.1117/12.2053739
PROCEEDINGS
5 PAGES


SHARE
RELATED CONTENT

An address geocoding solution for Chinese cities
Proceedings of SPIE (October 28 2006)
Effect of peanoscanning on image compression
Proceedings of SPIE (August 27 1993)
Bounded-Error Coding Of Cosine Transformed Images
Proceedings of SPIE (December 28 1979)

Back to Top