基于混合l_2/l_1范数极小化方法的块稀疏信号重构条件

研究压缩感知中的块稀疏信号重构问题,主要对混合l_2/l_1极小化方法建立了一类改进的可重构条件.具体地说,本文证明若测量矩阵满足条件δ_k+θ_(k,k)1,则混合l_2/l_1极小化方法可精确重构(无噪声情形)或鲁棒重构(有噪声情形)原始块k-稀疏信号.进而表明本文给出的新条件弱于现有文献所给出的条件.     

随机测量矩阵齐次RIP的证明

在压缩感知理论中,若要保证重构信号的精确性,测量矩阵需要满足限制等距性质,即RIP.当测量矩阵是随机矩阵时,RIP的成立与概率相关.对高斯矩阵RIP进行了修正,其中将原高斯矩阵RIP相关的集中不等式的■范数修正为■范数,梳理了这一类RIP证明过程,并证明得到了齐次RIP.     

多小波采样定理的拓展

采样定理在数字信号通讯中发挥了十分重要的作用,因为信号通常由它的离散采样数据来恢复.Han Bin等人在[J.Comput.Appl.Math.,2009,227:254-270]中构造了广义插值加细函数向量.本文研究与广义插值加细函数向量有关的采样定理的拓展问题.具体而言,对于已知的广义插值d-加细函数向量φ=(φ_1,…,φ_r)~T,即φe(m/r+k)=δ_kδ_(e-1-m),k∈Z,m=0,1,…,r-1,e=1,…,r我们将构造一组函数{φ_(r+1),…,φ_(dr)},使得φ~ロ=(φ~T,φ_(r+1),…,φ_(dr))~T也是d-加细的,而且满足φ_e(m/(dr)+k)=δ_kδ_(θ_(d,r(e)-m))k∈Z,m=0,1,…,dr-1,e=r+1,…,dr,其中θ_(d,r(e))=e-r+R_(e-1-r,d-1),R_(e-1-r,d-1)=「(e-1-r)/(d-1)」.我们建立与φ~■有关的采样定理.显然,φ的多小波子空间采样定理的适用范围得到了拓展.给出φ~■的多小波子空间采样级数的截断误差估计.     

基于lp有界噪声的压缩数据分离

本文考虑l_p有界噪声约束下的压缩数据分离问题,即从压缩测量数据中重建信号的不同稀疏子成分.为了重构不同框架D₁∈R^n×d₁和D₂∈R^n×d₂下(近似)稀疏的不同子成分,我们首先提出了l₁-αl₂分解分析算法,在测量矩阵满足一定的约束等距性条件且字典之间满足某个相互相干性条件时,此算法可以处理不同噪声干扰下的信号分离问题.此外,基于经典Dantzig Selector模型,我们还引入了l₁-αl₂分解分析Dantzig Selector算法,在适当条件下此算法也可以稳定分离压缩数据.数值实验表明,l₁-αl₂最小化算法对于冗余紧框架下的数据分离问题具有鲁棒性和稳定性.     

基于非凸优化模型的块稀疏信号恢复条件

压缩感知(compressed sensing,CS)是一种全新的信息采集与处理理论，它表明稀疏信号能够在远低于Shannon-Nyquist采样率的条件下被精确重构.现从压缩感知理论出发，对块稀疏信号重构算法进行研究，通过混合l₂/l_q(0相似文献   

一个素变量丢番图问题

设k和r是满足k≥3及r≥Ψ(k)+1的正整数,这里当3≤k≤4时,Ψ(k)=2~(k-1);而当k≥5时,Ψ(k)=1/2k(k+1).假定δ和ε是给定的足够小的正数,λ_1,λ_2,…,λ_(r+1)是不全同号且两两之比不全为有理数的非零实数.对于任意实数η与0σ2~(1-2k)/r-1,证明了:存在一个正数序列X→+∞,使得不等式|λ_1p_1~k+λ_2p_2~k+···+λ_rp_r~k+λ_(r+1)p_(r+1)+η|(max(1≤j≤r+1)p_j)~(-σ)有》■X~(■-(2~(1-2k))/(r-1)+ε组素数解(p_1,p_2,…,p_(r+1)),这里(δX)~(1/k)≤p_j≤X~(1/k)(1≤j≤r)及δX≤p_(r+1)≤X.这改进了之前的结果.     

逼近转化论和泛系逼近论(Ⅳ)

Theorem 1 If 1≤p≤∞, f∈W_p~(l)(D), then ω_k(δ,f,W_p~(l)(D))≤c(‖f‖_(l)_p),if f∈C~〔k+l〕(D), then ω_k(δ, f,W_p~(l)(D))≤c(δ~kmax‖(D)~(k)f‖_(()p)), where c is independent of δ≥0 and f. Theorem 2 If f∈W_p~(r)H_M~(a)(〔a,b〕)is of period b-a<∞, then ‖f‖_((s)t)≤cM~d‖f‖_((u)υ)~e, where d=δ/θ, e=(θ-δ)/θ, p≥1, t≥υ≥1, r>s≥u, δ=s-u+     

固定时间梯度流在?_1-?_2范数中的稀疏重构

压缩感知(compressed sensing,CS)是一种全新的信号采样技术,对于稀疏信号,它能够以远小于传统的Nyquist采样定理的采样点来重构信号.在压缩感知中,采用动态连续系统,对?_1-?_2范数的稀疏信号重构问题进行了研究.提出了一种基于固定时间梯度流的稀疏信号重构算法,证明了该算法在Lyapunov意义上的稳定性并且收敛于问题的最优解.最后通过与现有的投影神经网络算法的对比,体现了该算法的可行性以及在收敛速度上的优势.     

压缩感知

压缩感知是近来国际上热门的研究方向. 其主要思想为: 利用信号稀疏性的特征, 通过尽量少的观测信息恢复信号. 压缩感知在多个应用领域, 如医学成像、图像处理、地质勘探等中具有很好的应用前景. 此外, 它与逼近论、最优化、随机矩阵及离散几何等领域密切相关, 由此产生了一些漂亮的数学结果. 本文综述压缩感知一些基本结果并介绍最新进展. 主要包括RIP 矩阵编码与l₁ 解码的性能、RIP (restricted isometry property) 矩阵的构造、Gelfand 宽度、个例最优性及OMP (orthogonalmatching pursuit) 解码等.     

非线性系统的一种滤波方法

对于较为一般的非线性系统,本文在修正和推广的方法之基础上,综合了一些非线性滤波方法的优点,提出一种实时滤波方法.这种方法的计算量比推广Kalman滤波方法要小得多,而精度却与其相仿.给定如下的非线性系统X_(k+1)=f(X_k,k)+Г(X_k,k)W_k,(1)Z_k=h(X_k,k)+V_k (2)这里,X_k∈R~n,Z_k∈R~n,{W_k}、{V_k}均为零均值白噪声序列,且EV_kV_j~τ=Rδ_(kj),δ_(kj)为     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

CONTENTS OF VOLUME 30

正~~     

Instructions for contributions

正Applied Mathematics-A Journal of Chinese Universities,Series B(Appl.Math.J.Chinese Univ.,Ser.B)is a comprehensive applied mathematics journal jointly sponsored by Zhejiang University,China Society for Industrial and Applied Mathematics,and Springer-Verlag.It is a quarterly journal with     

Journal of Mathematical Research with Applications Guide for Authors

正Journal overview:Journal of Mathematical Research with Applications(JMRA),formerly Journal of Mathematical Research and Exposition(JMRE)created in 1981,one of the transactions of China Society for Industrial and Applied Mathematics,is a home for original research papers of the highest quality in all areas of mathematics with applications.The target audience comprises:pure and applied mathematicians,graduate students in broad fields of sciences and technology,scientists and engineers interested in mathematics.     

Staircase transportation problems with superadditive rewards and cumulative capacities

A cumulative-capacitated transportation problem is studied. The supply nodes and demand nodes are each chains. Shipments from a supply node to a demand node are possible only if the pair lies in a sublattice, or equivalently, in a staircase disjoint union of rectangles, of the product of the two chains. There are (lattice) superadditive upper bounds on the cumulative flows in all leading subrectangles of each rectangle. It is shown that there is a greatest cumulative flow formed by the natural generalization of the South-West Corner Rule that respects cumulative-flow capacities; it has maximum reward when the rewards are (lattice) superadditive; it is integer if the supplies, demands and capacities are integer; and it can be calculated myopically in linear time. The result is specialized to earlier work of Hoeffding (1940), Fréchet (1951), Lorentz (1953), Hoffman (1963) and Barnes and Hoffman (1985). Applications are given to extreme constrained bivariate distributions, optimal distribution with limited one-way product substitution and, generalizing results of Derman and Klein (1958), optimal sales with age-dependent rewards and capacities.To our friend, Philip Wolfe, with admiration and affection, on the occasion of his 65th birthday.Research was supported respectively by the IBM T.J. Watson and IBM Almaden Research Centers and is a minor revision of the IBM Research Report [6].     

Laminations minimales résiduellement à 2 bouts

Résumé On décrit toutes les feuilles des laminations minimales dont un ensemble résiduel de feuilles ont 2 bouts.      

Best approximation by downward sets with applications

We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs （W,x）, where ∈ X and W is a closed downward subset of X     

Boundedness of multilinear operators on weighted herz type spaces

In this paper, the author establishes the boundedness of multilinear operators on weighted Herz spaces and Herz-type Hardy spaces. The author also obtains their weak estimates on endpoints. As a special case, the conclusions may lead to the weighted estimates for multilinear Calderon-Zygmund operators.     

THE EXACT CONVERGENCE RATE AT ZERO OF LAGRANGE INTERPOLATION POLYNOMIAL TO |x|α

In this paper we present a generalized quantitative version of a result due to M. Revers concerning the exact convergence rate at zero of Lagrange interpolation polynomial to f(x) = |x|α with on equally spaced nodes in [-1, 1].