Derivative compressive sampling with application to phase unwrapping

Reconstruction of multidimensional signals from the samples of their partial derivatives is known to be an important problem in imaging sciences, with its fields of application including optics, interferometry, computer vision, and remote sensing, just to name a few. Due to the nature of the derivative operator, the above reconstruction problem is generally regarded as ill-posed, which suggests the necessity of using some a priori constraints to render its solution unique and stable. The ill-posed nature of the problem, however, becomes much more conspicuous when the set of data derivatives occurs to be incomplete. In this case, a plausible solution to the problem seems to be provided by the theory of compressive sampling, which looks for solutions that fit the measurements on one hand, and have the sparsest possible representation in a predefined basis, on the other hand. One of the most important questions to be addressed in such a case would be of how much incomplete the data is allowed to be for the reconstruction to remain useful. With this question in mind, the present note proposes a way to augment the standard constraints of compressive sampling by additional constraints related to some natural properties of the partial derivatives. It is shown that the resulting scheme of derivative compressive sampling (DCS) is capable of reliably recovering the signals of interest from much fewer data samples as compared to the standard CS. As an example application, the problem of phase unwrapping is discussed.

[1]  Michael P. Friedlander,et al.  Probing the Pareto Frontier for Basis Pursuit Solutions , 2008, SIAM J. Sci. Comput..

[2]  Oleg V. Michailovich,et al.  Phase unwrapping for 2-D blind deconvolution of ultrasound images , 2004, IEEE Transactions on Medical Imaging.

[3]  Oleg V. Michailovich,et al.  On approximation of smooth functions from samples of partial derivatives with application to phase unwrapping , 2008, Signal Process..

[4]  J. Antonio Quiroga,et al.  XtremeFringe: state-of-the-art software for automatic processing of fringe patterns , 2007, SPIE Optical Metrology.

[5]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[6]  A. W. M. van den Enden,et al.  Discrete Time Signal Processing , 1989 .

[7]  D. Donoho,et al.  Uncertainty principles and signal recovery , 1989 .

[8]  Stefano Soatto,et al.  Joint Priors for Variational Shape and Appearance Modeling , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[9]  Joe Brewer,et al.  Kronecker products and matrix calculus in system theory , 1978 .

[10]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[11]  E. Candès,et al.  Sparsity and incoherence in compressive sampling , 2006, math/0611957.

[12]  Juan Antonio Quiroga Mellado,et al.  XtremeFringe: state-of-the-art software for automatic processing of fringe patterns , 2007 .

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

[14]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

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

[16]  David L. Donoho,et al.  Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit , 2006 .