Xu Guanlei Dalian Navy Academy

Size: px
Start display at page:

Download "Xu Guanlei Dalian Navy Academy"

Transcription

1 Xu Guanlei Dalian Navy Academy

2 Werner Heisenberg x p 2 So, it is called as Heisenberg's uncertainty principle

3 2 2 t u 1/4 2 2 ( ) 2 u u u F u du where t t t f ( t) dt

4 What will happen for UP? Three directions: (and others such as mathematical cases) (1)The lower bound or sharper bound; (2)The new forms of UP; (3)The new applications of UP.

5

6 In 2001, Sudarshan Shinde et al. introduced the sharper bound for UP in An uncertainty principle for real signals in the fractional Fourier transform domain, in IEEE TSP: Only for real signals

7 K. K. Sharma and S. D. Joshi, Uncertainty principle for real signals in the linear canonical transform domains, IEEE Trans. Signal Process., vol. 56, no. 7, pp , Only for real signals

8 What about the complex signals?

9 G. L. Xu, X. T. Wang, and X. G. Xu, On uncertainty principle for the linear canonical transform of complex signals, IEEE Trans. Signal Process., vol. 58, no. 9, pp , For the complex signals.

10 Pei Dang, Guan-Tie Deng, and Tao Qian, A Tighter Uncertainty Principle for Linear Canonical Transform in Terms of Phase Derivative,2013,IEEE TSP: The complex signals

11 There are also other papers published in all kinds of Journels, however, here we only review a few papers. The other papers such as follows: K. K. Sharma, New inequalities for signal spreads in linear canonical Transform domains, Signal Process., vol. 90, no. 3, pp , A.Stern, Uncertainty principles in linear canonical transform domains and some of their implications in optics, J. Opt. Soc. Amer. A, vol. 25, pp , J. Zhao, R. Tao, Y. L. Li, and Y. Wang, Uncertainty principles for linear canonical transform, IEEE Trans. Signal Process., vol. 57, no. 7, pp , J. Zhao, R. Tao, and Y. Wang, On signal moments and uncertainty relations associated with linear canonical transform, Signal Process., vol. 90, no. 9, pp , P. Dang, G. T. Deng, and T. Qian, A sharper uncertainty principle, J. Functional Anal., vol. 265, pp , Jun Shi,Xiaoping Liu,Naitong Zhang, On uncertainty principle for signal concentrations with fractional Fourier transform, Signal Processing 92 (2012) Soo-Chang Pei, Jian-Jiun Ding, Uncertainty Principle of the 2-D Affine Generalized Fractional Fourier Transform, Proceedings of 2009 APSIPA Annual Summit and Conference, Sapporo, Japan, October 4-7, 2009

12 What about the New Forms?

13 A. Stern, Uncertainty principles in linear canonical transform domains and some of their implications in optics, J. Opt. Soc. Amer. A, vol. 25, pp , The all parameters of a,b,c,d in LCT are employed in these forms.

14 G. L. Xu, X. T.Wang, and X. G. Xu, Three uncertainty relations for real signals associated with linear canonical transform, IET Signal Process., vol. 3, no. 1, pp , Real Signals The all parameters of a,b,c,d in LCT are employed in these forms.

15 What about the complex signals?

16 G. L. Xu, X. T. Wang, and X. G. Xu, On uncertainty principle for the linear canonical transform of complex signals, IEEE Trans. Signal Process., vol. 58, no. 9, pp , Complex Signals The all parameters of a,b,c,d in LCT are employed in these forms.

17 Yan Yang, KitIan Kou, Uncertainty principles for hyper complex signals in the linear canonical transform domains, Signal Processing,95(2014) For the hyper complex signals or quaternion signals

18 Xu Guanlei, Wang Xiaotong, Xu Xiaogang [J]. Generalized Uncertainty Principles associated with Hilbert Transform [J]. Signal, Image and Video Processing, 2014, 8(2): For the complex signals by Hilbert transform out of the real signals

19 Xu Guanlei, Wang Xiaotong, Xu Xiaogang. The Logarithmic, Heisenberg s and Windowed Uncertainty Principles in Fractional Fourier Transform Domains[J]. Signal Processing, 2009, 89(3) : For Logairthmic and Windowed UP

20 For Entropic UP Xu Guanlei, Wang Xiaotong, Xu Xiaogang. Generalized entropic uncertainty principle on fractional Fourier transform [J]. Signal Processing, 2009, 89(12):

21

22 in

23 In practice, the signals are digital or discrete, we must give the discrete UP at first. Xu Guanlei, Wang Xiaotong, Zhou Lijia, Shao Limin, Xu Xiaogang. Discrete Entropic Uncertainty Relations Associated with FRFT [J]. Journal of Signal and Information Processing,2013,3B: Xu Guanlei, Wang Xiaotong, Xu Xiaogang, Hu jiang, Li Binyu. Discrete Inequalities on LCT[J]. Journal of Signal and Information Processing, 2015,6(2):

24 [1]D. Donoho, P. Stark, Uncertainty principles and signal recovery, SIAM J. Appl. Math. 1989, 49: [2]D. L. Donoho, X. Huo, Uncertainty principles and ideal atomic decomposition, IEEE Trans. Inf. Theory, 2001,47(7): [3]D. Donoho, Compressed sensing, IEEE Trans. Inf. Theory, 2006, 52: [6]M. Elad, A. M. Bruckstein, A generalized uncertainty principle and sparse representation in pairs of bases, IEEE Trans. Inf. Theory, 2002, 48(9): [7]A. Feuer, A. Nemirovski, On sparse representation in pairs of bases, IEEE Trans. Inf. Theory, 2003, 49(6): [8]R. Gribonval, M. Nielsen, Sparse representations in unions of bases, IEEE Trans. Inf. Theory, 2003, 49(12): [9]Y. Li, S. Amari, Two conditions for equivalence of 0-norm solution and 1-norm solution in sparse representation, IEEE Trans. Neural Netw., 2010, 21 (7): [10]J.J. Fuchs, On sparse representations in arbitrary redundant bases, IEEE Trans. Inf. Theory, 2004, 50 (6): [12]K. Patrick, D. Giuseppe, B. Helmut, Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets, IEEE Trans. Inf. Theory, 2012, 58(1):

25 [19]E.J. Candès, J. Romberg, T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Commun. Pure Appl. Math., 2005, 59: [23]E. J. Candès, J. Romberg, T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inf. Theory, 2006, 52 (2): Xu Guanlei, Wang Xiaotong, Zhou Lijia, Xu Xiaogang. New Inequalities on Sparse Representation in Pairs of Bases [J]. IET Signal Processing, 2013, 7(8), pp Xu Guanlei, Wang Xiaotong, Xu Xiaogang, Zhou Lijia. Entropic Inequalities on Sparse Representation[J]. IET Signal Processing,2016.

26 Xu Guanlei, Wang Xiaotong, Zhou Lijia, Xu Xiaogang. New Inequalities on Sparse Representation in Pairs of Bases [J]. IET Signal Processing, 2013, 7(8), pp Xu Guanlei, Wang Xiaotong, Xu Xiaogang, Zhou Lijia. Entropic Inequalities on Sparse Representation[J]. IET Signal Processing,2016. These relations tell us how the signal is sparse and how to select bases.

27 (1)The lower bound or sharper bound; (2)The new forms of UP; (3)The new applications of UP. They are the potential Fundationals or Bases of CS and Sparse Representation.

28 The Classical/Traditional UP FRFT and LCT : extensions Heisenberg s UP Entropic UP extension Windowed UP Logarithmic UP Sharper Ones New Forms with More Parameters Application Generalized Extensions Applicatio n Sparse Representation?

29

Thresholds for the Recovery of Sparse Solutions via L1 Minimization

Thresholds for the Recovery of Sparse Solutions via L1 Minimization Thresholds for the Recovery of Sparse Solutions via L Minimization David L. Donoho Department of Statistics Stanford University 39 Serra Mall, Sequoia Hall Stanford, CA 9435-465 Email: donoho@stanford.edu

More information

of Orthogonal Matching Pursuit

of Orthogonal Matching Pursuit A Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit Qun Mo arxiv:50.0708v [cs.it] 8 Jan 205 Abstract We shall show that if the restricted isometry constant (RIC) δ s+ (A) of the measurement

More information

On the l 1 -Norm Invariant Convex k-sparse Decomposition of Signals

On the l 1 -Norm Invariant Convex k-sparse Decomposition of Signals On the l 1 -Norm Invariant Convex -Sparse Decomposition of Signals arxiv:1305.6021v2 [cs.it] 11 Nov 2013 Guangwu Xu and Zhiqiang Xu Abstract Inspired by an interesting idea of Cai and Zhang, we formulate

More information

Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization

Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization Lingchen Kong and Naihua Xiu Department of Applied Mathematics, Beijing Jiaotong University, Beijing, 100044, People s Republic of China E-mail:

More information

A new method on deterministic construction of the measurement matrix in compressed sensing

A new method on deterministic construction of the measurement matrix in compressed sensing A new method on deterministic construction of the measurement matrix in compressed sensing Qun Mo 1 arxiv:1503.01250v1 [cs.it] 4 Mar 2015 Abstract Construction on the measurement matrix A is a central

More information

The analysis of decimation and interpolation in the linear canonical transform domain

The analysis of decimation and interpolation in the linear canonical transform domain DOI 0.86/s40064-06-3479-4 RESEARCH Open Access The analysis of decimation and interpolation in the linear canonical transform domain Shuiqing Xu *, Yi Chai,, Youqiang Hu, Lei Huang and Li Feng *Correspondence:

More information

LOGARITHMIC UNCERTAINTY PRINCIPLE FOR QUATERNION LINEAR CANONICAL TRANSFORM

LOGARITHMIC UNCERTAINTY PRINCIPLE FOR QUATERNION LINEAR CANONICAL TRANSFORM Proceedings of the 06 International Conference on Wavelet Analysis and Pattern Recognition Jeju South Korea 0-3 July LOGARITHMIC UNCERTAINTY PRINCIPLE FOR QUATERNION LINEAR CANONICAL TRANSFORM MAWARDI

More information

Necessary and sufficient conditions of solution uniqueness in l 1 minimization

Necessary and sufficient conditions of solution uniqueness in l 1 minimization 1 Necessary and sufficient conditions of solution uniqueness in l 1 minimization Hui Zhang, Wotao Yin, and Lizhi Cheng arxiv:1209.0652v2 [cs.it] 18 Sep 2012 Abstract This paper shows that the solutions

More information

A New Estimate of Restricted Isometry Constants for Sparse Solutions

A New Estimate of Restricted Isometry Constants for Sparse Solutions A New Estimate of Restricted Isometry Constants for Sparse Solutions Ming-Jun Lai and Louis Y. Liu January 12, 211 Abstract We show that as long as the restricted isometry constant δ 2k < 1/2, there exist

More information

Equivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation

Equivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 19, NO. 12, DECEMBER 2008 2009 Equivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation Yuanqing Li, Member, IEEE, Andrzej Cichocki,

More information

Sparse signals recovered by non-convex penalty in quasi-linear systems

Sparse signals recovered by non-convex penalty in quasi-linear systems Cui et al. Journal of Inequalities and Applications 018) 018:59 https://doi.org/10.1186/s13660-018-165-8 R E S E A R C H Open Access Sparse signals recovered by non-conve penalty in quasi-linear systems

More information

Rui ZHANG Song LI. Department of Mathematics, Zhejiang University, Hangzhou , P. R. China

Rui ZHANG Song LI. Department of Mathematics, Zhejiang University, Hangzhou , P. R. China Acta Mathematica Sinica, English Series May, 015, Vol. 31, No. 5, pp. 755 766 Published online: April 15, 015 DOI: 10.1007/s10114-015-434-4 Http://www.ActaMath.com Acta Mathematica Sinica, English Series

More information

GREEDY SIGNAL RECOVERY REVIEW

GREEDY SIGNAL RECOVERY REVIEW GREEDY SIGNAL RECOVERY REVIEW DEANNA NEEDELL, JOEL A. TROPP, ROMAN VERSHYNIN Abstract. The two major approaches to sparse recovery are L 1-minimization and greedy methods. Recently, Needell and Vershynin

More information

Package R1magic. August 29, 2016

Package R1magic. August 29, 2016 Type Package Package R1magic August 29, 2016 Title Compressive Sampling: Sparse Signal Recovery Utilities Version 0.3.2 Date 2015-04-19 Maintainer Depends stats, utils Utilities

More information

Package R1magic. April 9, 2013

Package R1magic. April 9, 2013 Package R1magic April 9, 2013 Type Package Title Compressive Sampling: Sparse signal recovery utilities Version 0.2 Date 2013-04-09 Author Maintainer Depends stats, utils Provides

More information

COMPRESSED SENSING IN PYTHON

COMPRESSED SENSING IN PYTHON COMPRESSED SENSING IN PYTHON Sercan Yıldız syildiz@samsi.info February 27, 2017 OUTLINE A BRIEF INTRODUCTION TO COMPRESSED SENSING A BRIEF INTRODUCTION TO CVXOPT EXAMPLES A Brief Introduction to Compressed

More information

Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information

Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information 1 Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information Emmanuel Candès, California Institute of Technology International Conference on Computational Harmonic

More information

Uncertainty principles and sparse approximation

Uncertainty principles and sparse approximation Uncertainty principles and sparse approximation In this lecture, we will consider the special case where the dictionary Ψ is composed of a pair of orthobases. We will see that our ability to find a sparse

More information

Compressed Sensing and Related Learning Problems

Compressed Sensing and Related Learning Problems Compressed Sensing and Related Learning Problems Yingzhen Li Dept. of Mathematics, Sun Yat-sen University Advisor: Prof. Haizhang Zhang Advisor: Prof. Haizhang Zhang 1 / Overview Overview Background Compressed

More information

Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing

Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas M.Vidyasagar@utdallas.edu www.utdallas.edu/ m.vidyasagar

More information

Necessary and Sufficient Conditions of Solution Uniqueness in 1-Norm Minimization

Necessary and Sufficient Conditions of Solution Uniqueness in 1-Norm Minimization Noname manuscript No. (will be inserted by the editor) Necessary and Sufficient Conditions of Solution Uniqueness in 1-Norm Minimization Hui Zhang Wotao Yin Lizhi Cheng Received: / Accepted: Abstract This

More information

New Coherence and RIP Analysis for Weak. Orthogonal Matching Pursuit

New Coherence and RIP Analysis for Weak. Orthogonal Matching Pursuit New Coherence and RIP Analysis for Wea 1 Orthogonal Matching Pursuit Mingrui Yang, Member, IEEE, and Fran de Hoog arxiv:1405.3354v1 [cs.it] 14 May 2014 Abstract In this paper we define a new coherence

More information

arxiv: v1 [math.na] 26 Nov 2009

arxiv: v1 [math.na] 26 Nov 2009 Non-convexly constrained linear inverse problems arxiv:0911.5098v1 [math.na] 26 Nov 2009 Thomas Blumensath Applied Mathematics, School of Mathematics, University of Southampton, University Road, Southampton,

More information

A Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases

A Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases 2558 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 48, NO 9, SEPTEMBER 2002 A Generalized Uncertainty Principle Sparse Representation in Pairs of Bases Michael Elad Alfred M Bruckstein Abstract An elementary

More information

Pre-weighted Matching Pursuit Algorithms for Sparse Recovery

Pre-weighted Matching Pursuit Algorithms for Sparse Recovery Journal of Information & Computational Science 11:9 (214) 2933 2939 June 1, 214 Available at http://www.joics.com Pre-weighted Matching Pursuit Algorithms for Sparse Recovery Jingfei He, Guiling Sun, Jie

More information

Near Optimal Signal Recovery from Random Projections

Near Optimal Signal Recovery from Random Projections 1 Near Optimal Signal Recovery from Random Projections Emmanuel Candès, California Institute of Technology Multiscale Geometric Analysis in High Dimensions: Workshop # 2 IPAM, UCLA, October 2004 Collaborators:

More information

Noncommutative Uncertainty Principle

Noncommutative Uncertainty Principle Noncommutative Uncertainty Principle Zhengwei Liu (joint with Chunlan Jiang and Jinsong Wu) Vanderbilt University The 12th East Coast Operator Algebras Symposium, Oct 12, 2014 Z. Liu (Vanderbilt) Noncommutative

More information

The Sparsity Gap. Joel A. Tropp. Computing & Mathematical Sciences California Institute of Technology

The Sparsity Gap. Joel A. Tropp. Computing & Mathematical Sciences California Institute of Technology The Sparsity Gap Joel A. Tropp Computing & Mathematical Sciences California Institute of Technology jtropp@acm.caltech.edu Research supported in part by ONR 1 Introduction The Sparsity Gap (Casazza Birthday

More information

Reconstruction from Anisotropic Random Measurements

Reconstruction from Anisotropic Random Measurements Reconstruction from Anisotropic Random Measurements Mark Rudelson and Shuheng Zhou The University of Michigan, Ann Arbor Coding, Complexity, and Sparsity Workshop, 013 Ann Arbor, Michigan August 7, 013

More information

Research Article A Simplified Proof of Uncertainty Principle for Quaternion Linear Canonical Transform

Research Article A Simplified Proof of Uncertainty Principle for Quaternion Linear Canonical Transform Abstract and Applied Analysis Volume 06, Article ID 5874930, pages http://doiorg/055/06/5874930 Research Article A Simplified Proof of Uncertainty Principle for Quaternion Linear Canonical Transform Mawardi

More information

Uniqueness Conditions for A Class of l 0 -Minimization Problems

Uniqueness Conditions for A Class of l 0 -Minimization Problems Uniqueness Conditions for A Class of l 0 -Minimization Problems Chunlei Xu and Yun-Bin Zhao October, 03, Revised January 04 Abstract. We consider a class of l 0 -minimization problems, which is to search

More information

The Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1

The Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1 The Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1 Simon Foucart Department of Mathematics Vanderbilt University Nashville, TN 3784. Ming-Jun Lai Department of Mathematics,

More information

Multipath Matching Pursuit

Multipath Matching Pursuit Multipath Matching Pursuit Submitted to IEEE trans. on Information theory Authors: S. Kwon, J. Wang, and B. Shim Presenter: Hwanchol Jang Multipath is investigated rather than a single path for a greedy

More information

Strengthened Sobolev inequalities for a random subspace of functions

Strengthened Sobolev inequalities for a random subspace of functions Strengthened Sobolev inequalities for a random subspace of functions Rachel Ward University of Texas at Austin April 2013 2 Discrete Sobolev inequalities Proposition (Sobolev inequality for discrete images)

More information

c 2011 International Press Vol. 18, No. 1, pp , March DENNIS TREDE

c 2011 International Press Vol. 18, No. 1, pp , March DENNIS TREDE METHODS AND APPLICATIONS OF ANALYSIS. c 2011 International Press Vol. 18, No. 1, pp. 105 110, March 2011 007 EXACT SUPPORT RECOVERY FOR LINEAR INVERSE PROBLEMS WITH SPARSITY CONSTRAINTS DENNIS TREDE Abstract.

More information

IEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER

IEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER IEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER 2015 1239 Preconditioning for Underdetermined Linear Systems with Sparse Solutions Evaggelia Tsiligianni, StudentMember,IEEE, Lisimachos P. Kondi,

More information

CoSaMP: Greedy Signal Recovery and Uniform Uncertainty Principles

CoSaMP: Greedy Signal Recovery and Uniform Uncertainty Principles CoSaMP: Greedy Signal Recovery and Uniform Uncertainty Principles SIAM Student Research Conference Deanna Needell Joint work with Roman Vershynin and Joel Tropp UC Davis, May 2008 CoSaMP: Greedy Signal

More information

CS 229r: Algorithms for Big Data Fall Lecture 19 Nov 5

CS 229r: Algorithms for Big Data Fall Lecture 19 Nov 5 CS 229r: Algorithms for Big Data Fall 215 Prof. Jelani Nelson Lecture 19 Nov 5 Scribe: Abdul Wasay 1 Overview In the last lecture, we started discussing the problem of compressed sensing where we are given

More information

Optimisation Combinatoire et Convexe.

Optimisation Combinatoire et Convexe. Optimisation Combinatoire et Convexe. Low complexity models, l 1 penalties. A. d Aspremont. M1 ENS. 1/36 Today Sparsity, low complexity models. l 1 -recovery results: three approaches. Extensions: matrix

More information

Abstract This paper is about the efficient solution of large-scale compressed sensing problems.

Abstract This paper is about the efficient solution of large-scale compressed sensing problems. Noname manuscript No. (will be inserted by the editor) Optimization for Compressed Sensing: New Insights and Alternatives Robert Vanderbei and Han Liu and Lie Wang Received: date / Accepted: date Abstract

More information

Quantifying conformation fluctuation induced uncertainty in bio-molecular systems

Quantifying conformation fluctuation induced uncertainty in bio-molecular systems Quantifying conformation fluctuation induced uncertainty in bio-molecular systems Guang Lin, Dept. of Mathematics & School of Mechanical Engineering, Purdue University Collaborative work with Huan Lei,

More information

RSP-Based Analysis for Sparsest and Least l 1 -Norm Solutions to Underdetermined Linear Systems

RSP-Based Analysis for Sparsest and Least l 1 -Norm Solutions to Underdetermined Linear Systems 1 RSP-Based Analysis for Sparsest and Least l 1 -Norm Solutions to Underdetermined Linear Systems Yun-Bin Zhao IEEE member Abstract Recently, the worse-case analysis, probabilistic analysis and empirical

More information

Does Compressed Sensing have applications in Robust Statistics?

Does Compressed Sensing have applications in Robust Statistics? Does Compressed Sensing have applications in Robust Statistics? Salvador Flores December 1, 2014 Abstract The connections between robust linear regression and sparse reconstruction are brought to light.

More information

Signal Recovery, Uncertainty Relations, and Minkowski Dimension

Signal Recovery, Uncertainty Relations, and Minkowski Dimension Signal Recovery, Uncertainty Relations, and Minkowski Dimension Helmut Bőlcskei ETH Zurich December 2013 Joint work with C. Aubel, P. Kuppinger, G. Pope, E. Riegler, D. Stotz, and C. Studer Aim of this

More information

Stable Signal Recovery from Incomplete and Inaccurate Measurements

Stable Signal Recovery from Incomplete and Inaccurate Measurements Stable Signal Recovery from Incomplete and Inaccurate Measurements EMMANUEL J. CANDÈS California Institute of Technology JUSTIN K. ROMBERG California Institute of Technology AND TERENCE TAO University

More information

Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing

Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing ibeltal F. Alem, Daniel H. Chae, and Rodney A. Kennedy The Australian National

More information

Signal Recovery From Incomplete and Inaccurate Measurements via Regularized Orthogonal Matching Pursuit

Signal Recovery From Incomplete and Inaccurate Measurements via Regularized Orthogonal Matching Pursuit Signal Recovery From Incomplete and Inaccurate Measurements via Regularized Orthogonal Matching Pursuit Deanna Needell and Roman Vershynin Abstract We demonstrate a simple greedy algorithm that can reliably

More information

An Image Fusion Algorithm Based on Non-subsampled Shearlet Transform and Compressed Sensing

An Image Fusion Algorithm Based on Non-subsampled Shearlet Transform and Compressed Sensing , pp.61-70 http://dx.doi.org/10.1457/ijsip.016.9.3.06 An Image Fusion Algorithm Based on Non-subsampled Shearlet Transform and Compressed Sensing XING Xiaoxue 1, LI Jie 1, FAN Qinyin, SHANG Weiwei 1* 1.

More information

Sparsest Solutions of Underdetermined Linear Systems via l q -minimization for 0 < q 1

Sparsest Solutions of Underdetermined Linear Systems via l q -minimization for 0 < q 1 Sparsest Solutions of Underdetermined Linear Systems via l q -minimization for 0 < q 1 Simon Foucart Department of Mathematics Vanderbilt University Nashville, TN 3740 Ming-Jun Lai Department of Mathematics

More information

Lecture: Introduction to Compressed Sensing Sparse Recovery Guarantees

Lecture: Introduction to Compressed Sensing Sparse Recovery Guarantees Lecture: Introduction to Compressed Sensing Sparse Recovery Guarantees http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html Acknowledgement: this slides is based on Prof. Emmanuel Candes and Prof. Wotao Yin

More information

ORTHOGONAL matching pursuit (OMP) is the canonical

ORTHOGONAL matching pursuit (OMP) is the canonical IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 9, SEPTEMBER 2010 4395 Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property Mark A. Davenport, Member, IEEE, and Michael

More information

Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published

More information

Compressed Sensing and Affine Rank Minimization Under Restricted Isometry

Compressed Sensing and Affine Rank Minimization Under Restricted Isometry IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 13, JULY 1, 2013 3279 Compressed Sensing Affine Rank Minimization Under Restricted Isometry T. Tony Cai Anru Zhang Abstract This paper establishes new

More information

Inverse problems and sparse models (1/2) Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France

Inverse problems and sparse models (1/2) Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France Inverse problems and sparse models (1/2) Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France remi.gribonval@inria.fr Structure of the tutorial Session 1: Introduction to inverse problems & sparse

More information

Convolution theorem and Wigner-Ville distribution

Convolution theorem and Wigner-Ville distribution Proceedings of APSIPA Annual Summit and Conference 07-5 Decemer 07, Malaysia Convolution theorem and Wigner-Ville distriution Yonggang Li and Xiaoling Meng Zhengzhou University of Aeronautics, Zhengzhou,

More information

Closed-Form Discrete Fractional and Affine Fourier Transforms

Closed-Form Discrete Fractional and Affine Fourier Transforms 1338 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 48, NO. 5, MAY 2000 Closed-Form Discrete Fractional and Affine Fourier Transforms Soo-Chang Pei, Fellow, IEEE, and Jian-Jiun Ding Abstract The discrete

More information

Optimization-based sparse recovery: Compressed sensing vs. super-resolution

Optimization-based sparse recovery: Compressed sensing vs. super-resolution Optimization-based sparse recovery: Compressed sensing vs. super-resolution Carlos Fernandez-Granda, Google Computational Photography and Intelligent Cameras, IPAM 2/5/2014 This work was supported by a

More information

Error Correction via Linear Programming

Error Correction via Linear Programming Error Correction via Linear Programming Emmanuel Candes and Terence Tao Applied and Computational Mathematics, Caltech, Pasadena, CA 91125 Department of Mathematics, University of California, Los Angeles,

More information

Research Article Wigner-Ville Distribution Associated with the Linear Canonical Transform

Research Article Wigner-Ville Distribution Associated with the Linear Canonical Transform Applied Mathematics Volume 2, Article ID 746, 4 pages doi:.55/2/746 Research Article Wigner-Ville Distribution Associated with the Linear Canonical Transform Rui-Feng Bai, Bing-Zhao Li, and Qi-Yuan Cheng

More information

SINGULAR VALUE INEQUALITIES FOR COMPACT OPERATORS

SINGULAR VALUE INEQUALITIES FOR COMPACT OPERATORS SINGULAR VALUE INEQUALITIES FOR OMPAT OPERATORS WASIM AUDEH AND FUAD KITTANEH Abstract. A singular value inequality due to hatia and Kittaneh says that if A and are compact operators on a complex separable

More information

Error Analysis for H 1 Based Wavelet Interpolations

Error Analysis for H 1 Based Wavelet Interpolations Error Analysis for H 1 Based Wavelet Interpolations Tony F. Chan Hao-Min Zhou Tie Zhou Abstract We rigorously study the error bound for the H 1 wavelet interpolation problem, which aims to recover missing

More information

Ole Christensen 3. October 20, Abstract. We point out some connections between the existing theories for

Ole Christensen 3. October 20, Abstract. We point out some connections between the existing theories for Frames and pseudo-inverses. Ole Christensen 3 October 20, 1994 Abstract We point out some connections between the existing theories for frames and pseudo-inverses. In particular, using the pseudo-inverse

More information

Compressibility of Infinite Sequences and its Interplay with Compressed Sensing Recovery

Compressibility of Infinite Sequences and its Interplay with Compressed Sensing Recovery Compressibility of Infinite Sequences and its Interplay with Compressed Sensing Recovery Jorge F. Silva and Eduardo Pavez Department of Electrical Engineering Information and Decision Systems Group Universidad

More information

Observability of a Linear System Under Sparsity Constraints

Observability of a Linear System Under Sparsity Constraints 2372 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 58, NO 9, SEPTEMBER 2013 Observability of a Linear System Under Sparsity Constraints Wei Dai and Serdar Yüksel Abstract Consider an -dimensional linear

More information

The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008

The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008 The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008 Emmanuel Candés (Caltech), Terence Tao (UCLA) 1 Uncertainty principles A basic principle

More information

Shifting Inequality and Recovery of Sparse Signals

Shifting Inequality and Recovery of Sparse Signals Shifting Inequality and Recovery of Sparse Signals T. Tony Cai Lie Wang and Guangwu Xu Astract In this paper we present a concise and coherent analysis of the constrained l 1 minimization method for stale

More information

Generalized Orthogonal Matching Pursuit- A Review and Some

Generalized Orthogonal Matching Pursuit- A Review and Some Generalized Orthogonal Matching Pursuit- A Review and Some New Results Department of Electronics and Electrical Communication Engineering Indian Institute of Technology, Kharagpur, INDIA Table of Contents

More information

INDUSTRIAL MATHEMATICS INSTITUTE. B.S. Kashin and V.N. Temlyakov. IMI Preprint Series. Department of Mathematics University of South Carolina

INDUSTRIAL MATHEMATICS INSTITUTE. B.S. Kashin and V.N. Temlyakov. IMI Preprint Series. Department of Mathematics University of South Carolina INDUSTRIAL MATHEMATICS INSTITUTE 2007:08 A remark on compressed sensing B.S. Kashin and V.N. Temlyakov IMI Preprint Series Department of Mathematics University of South Carolina A remark on compressed

More information

A NEW FRAMEWORK FOR DESIGNING INCOHERENT SPARSIFYING DICTIONARIES

A NEW FRAMEWORK FOR DESIGNING INCOHERENT SPARSIFYING DICTIONARIES A NEW FRAMEWORK FOR DESIGNING INCOERENT SPARSIFYING DICTIONARIES Gang Li, Zhihui Zhu, 2 uang Bai, 3 and Aihua Yu 3 School of Automation & EE, Zhejiang Univ. of Sci. & Tech., angzhou, Zhejiang, P.R. China

More information

Sparsity in Underdetermined Systems

Sparsity in Underdetermined Systems Sparsity in Underdetermined Systems Department of Statistics Stanford University August 19, 2005 Classical Linear Regression Problem X n y p n 1 > Given predictors and response, y Xβ ε = + ε N( 0, σ 2

More information

Signal Recovery from Permuted Observations

Signal Recovery from Permuted Observations EE381V Course Project Signal Recovery from Permuted Observations 1 Problem Shanshan Wu (sw33323) May 8th, 2015 We start with the following problem: let s R n be an unknown n-dimensional real-valued signal,

More information

Sparse Optimization Lecture: Sparse Recovery Guarantees

Sparse Optimization Lecture: Sparse Recovery Guarantees Those who complete this lecture will know Sparse Optimization Lecture: Sparse Recovery Guarantees Sparse Optimization Lecture: Sparse Recovery Guarantees Instructor: Wotao Yin Department of Mathematics,

More information

Data Sparse Matrix Computation - Lecture 20

Data Sparse Matrix Computation - Lecture 20 Data Sparse Matrix Computation - Lecture 20 Yao Cheng, Dongping Qi, Tianyi Shi November 9, 207 Contents Introduction 2 Theorems on Sparsity 2. Example: A = [Φ Ψ]......................... 2.2 General Matrix

More information

Extrapolation of Bandlimited Signals Using Slepian Functions

Extrapolation of Bandlimited Signals Using Slepian Functions , 23-25 October, 2013, San Francisco, USA Extrapolation of Bandlimited Signals Using Slepian Functions Amal Devasia 1, Member, IAENG and Michael Cada 2 Abstract An efficient and reliable method to extrapolate

More information

Time-Series Based Prediction of Dynamical Systems and Complex. Networks

Time-Series Based Prediction of Dynamical Systems and Complex. Networks Time-Series Based Prediction of Dynamical Systems and Complex Collaborators Networks Ying-Cheng Lai ECEE Arizona State University Dr. Wenxu Wang, ECEE, ASU Mr. Ryan Yang, ECEE, ASU Mr. Riqi Su, ECEE, ASU

More information

Applications on Generalized Two-Dimensional Fractional Sine Transform In the Range

Applications on Generalized Two-Dimensional Fractional Sine Transform In the Range International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 7, July 2014, PP 620-626 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Applications

More information

An iterative hard thresholding estimator for low rank matrix recovery

An iterative hard thresholding estimator for low rank matrix recovery An iterative hard thresholding estimator for low rank matrix recovery Alexandra Carpentier - based on a joint work with Arlene K.Y. Kim Statistical Laboratory, Department of Pure Mathematics and Mathematical

More information

Interpolation via weighted l 1 minimization

Interpolation via weighted l 1 minimization Interpolation via weighted l 1 minimization Rachel Ward University of Texas at Austin December 12, 2014 Joint work with Holger Rauhut (Aachen University) Function interpolation Given a function f : D C

More information

(1) ... (2) /$ IEEE

(1) ... (2) /$ IEEE IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL 55, NO 11, DECEMBER 2008 3469 Closed-Form Orthogonal DFT Eigenvectors Generated by Complete Generalized Legendre Sequence Soo-Chang Pei,

More information

Compressed sensing for radio interferometry: spread spectrum imaging techniques

Compressed sensing for radio interferometry: spread spectrum imaging techniques Compressed sensing for radio interferometry: spread spectrum imaging techniques Y. Wiaux a,b, G. Puy a, Y. Boursier a and P. Vandergheynst a a Institute of Electrical Engineering, Ecole Polytechnique Fédérale

More information

Sparse Algorithms are not Stable: A No-free-lunch Theorem

Sparse Algorithms are not Stable: A No-free-lunch Theorem Sparse Algorithms are not Stable: A No-free-lunch Theorem Huan Xu Shie Mannor Constantine Caramanis Abstract We consider two widely used notions in machine learning, namely: sparsity algorithmic stability.

More information

Fast Sparse Representation Based on Smoothed

Fast Sparse Representation Based on Smoothed Fast Sparse Representation Based on Smoothed l 0 Norm G. Hosein Mohimani 1, Massoud Babaie-Zadeh 1,, and Christian Jutten 2 1 Electrical Engineering Department, Advanced Communications Research Institute

More information

Introduction to Sparsity. Xudong Cao, Jake Dreamtree & Jerry 04/05/2012

Introduction to Sparsity. Xudong Cao, Jake Dreamtree & Jerry 04/05/2012 Introduction to Sparsity Xudong Cao, Jake Dreamtree & Jerry 04/05/2012 Outline Understanding Sparsity Total variation Compressed sensing(definition) Exact recovery with sparse prior(l 0 ) l 1 relaxation

More information

Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit

Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit Claremont Colleges Scholarship @ Claremont CMC Faculty Publications and Research CMC Faculty Scholarship 6-5-2008 Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit

More information

Approximately dual frames in Hilbert spaces and applications to Gabor frames

Approximately dual frames in Hilbert spaces and applications to Gabor frames Approximately dual frames in Hilbert spaces and applications to Gabor frames Ole Christensen and Richard S. Laugesen October 22, 200 Abstract Approximately dual frames are studied in the Hilbert space

More information

Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions

Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions Emmanuel J. Candès and Justin Romberg Applied and Computational Mathematics, Caltech, Pasadena, CA 91125 June 3, 2005 Abstract

More information

On Riesz-Fischer sequences and lower frame bounds

On Riesz-Fischer sequences and lower frame bounds On Riesz-Fischer sequences and lower frame bounds P. Casazza, O. Christensen, S. Li, A. Lindner Abstract We investigate the consequences of the lower frame condition and the lower Riesz basis condition

More information

AN INTRODUCTION TO COMPRESSIVE SENSING

AN INTRODUCTION TO COMPRESSIVE SENSING AN INTRODUCTION TO COMPRESSIVE SENSING Rodrigo B. Platte School of Mathematical and Statistical Sciences APM/EEE598 Reverse Engineering of Complex Dynamical Networks OUTLINE 1 INTRODUCTION 2 INCOHERENCE

More information

Finite Frames and Graph Theoretical Uncertainty Principles

Finite Frames and Graph Theoretical Uncertainty Principles Finite Frames and Graph Theoretical Uncertainty Principles (pkoprows@math.umd.edu) University of Maryland - College Park April 13, 2015 Outline 1 Motivation 2 Definitions 3 Results Outline 1 Motivation

More information

Mathematics Subject Classification (2000). Primary 00A69, 41-02, 68P30; Secondary 62C65.

Mathematics Subject Classification (2000). Primary 00A69, 41-02, 68P30; Secondary 62C65. Compressive sampling Emmanuel J. Candès Abstract. Conventional wisdom and common practice in acquisition and reconstruction of images from frequency data follow the basic principle of the Nyquist density

More information

A Survey of Compressive Sensing and Applications

A Survey of Compressive Sensing and Applications A Survey of Compressive Sensing and Applications Justin Romberg Georgia Tech, School of ECE ENS Winter School January 10, 2012 Lyon, France Signal processing trends DSP: sample first, ask questions later

More information

On the Projection Matrices Influence in the Classification of Compressed Sensed ECG Signals

On the Projection Matrices Influence in the Classification of Compressed Sensed ECG Signals On the Projection Matrices Influence in the Classification of Compressed Sensed ECG Signals Monica Fira, Liviu Goras Institute of Computer Science Romanian Academy Iasi, Romania Liviu Goras, Nicolae Cleju,

More information

Asymptotic Achievability of the Cramér Rao Bound For Noisy Compressive Sampling

Asymptotic Achievability of the Cramér Rao Bound For Noisy Compressive Sampling Asymptotic Achievability of the Cramér Rao Bound For Noisy Compressive Sampling The Harvard community h made this article openly available. Plee share how this access benefits you. Your story matters Citation

More information

THE DONOHO STARK UNCERTAINTY PRINCIPLE FOR A FINITE ABELIAN GROUP. 0. Introduction

THE DONOHO STARK UNCERTAINTY PRINCIPLE FOR A FINITE ABELIAN GROUP. 0. Introduction Acta Math. Univ. Comenianae Vol. LXXIII, 2(2004), pp. 155 160 155 THE DONOHO STARK UNCERTAINTY PRINCIPLE FOR A FINITE ABELIAN GROUP E. MATUSIAK, M. ÖZAYDIN and T. PRZEBINDA Abstract. Let A be a finite

More information

An Unconstrained l q Minimization with 0 < q 1 for Sparse Solution of Under-determined Linear Systems

An Unconstrained l q Minimization with 0 < q 1 for Sparse Solution of Under-determined Linear Systems An Unconstrained l q Minimization with 0 < q 1 for Sparse Solution of Under-determined Linear Systems Ming-Jun Lai and Jingyue Wang Department of Mathematics The University of Georgia Athens, GA 30602.

More information

Quantum secret sharing based on quantum error-correcting codes

Quantum secret sharing based on quantum error-correcting codes Quantum secret sharing based on quantum error-correcting codes Zhang Zu-Rong( ), Liu Wei-Tao( ), and Li Cheng-Zu( ) Department of Physics, School of Science, National University of Defense Technology,

More information

A Lower Bound Theorem. Lin Hu.

A Lower Bound Theorem. Lin Hu. American J. of Mathematics and Sciences Vol. 3, No -1,(January 014) Copyright Mind Reader Publications ISSN No: 50-310 A Lower Bound Theorem Department of Applied Mathematics, Beijing University of Technology,

More information

j jf, S K cf = j K c j jf, f H.

j jf, S K cf = j K c j jf, f H. DOI 10.1186/s40064-016-2731-2 RESEARCH New double inequalities for g frames in Hilbert C modules Open Access Zhong Qi Xiang * *Correspondence: lxsy20110927@163.com College of Mathematics and Computer Science,

More information

SIGNALS with sparse representations can be recovered

SIGNALS with sparse representations can be recovered IEEE SIGNAL PROCESSING LETTERS, VOL. 22, NO. 9, SEPTEMBER 2015 1497 Cramér Rao Bound for Sparse Signals Fitting the Low-Rank Model with Small Number of Parameters Mahdi Shaghaghi, Student Member, IEEE,

More information

Sigma Delta Quantization for Compressed Sensing

Sigma Delta Quantization for Compressed Sensing Sigma Delta Quantization for Compressed Sensing C. Sinan Güntürk, 1 Mark Lammers, 2 Alex Powell, 3 Rayan Saab, 4 Özgür Yılmaz 4 1 Courant Institute of Mathematical Sciences, New York University, NY, USA.

More information