

浏览全部资源
扫码关注微信
广东第二师范学院数学系, 广东 广州 510303
WU Fengong(wufengong@gdei.edu.cn)
ZHONG Penghong(zhongpenghong@gdei.edu.cn )
[ "QIN Yuehai(haiqy2000@gdei.edu.cn)" ]
Received:05 October 2024,
Accepted:22 February 2025,
Published Online:07 May 2025,
Published:25 May 2025
移动端阅览
吴焚供,钟澎洪,覃跃海.框架下组稀疏非凸压缩感知问题:零空间性质与l2/lq (0<q≤1)-综合法[J].中山大学学报(自然科学版)(中英文),2025,64(03):173-182.
WU Fengong,ZHONG Penghong,QIN Yuehai.Block sparse compressed sensing with frames: Null space property and l2/lq(0<q≤1)-synthesis[J].Acta Scientiarum Naturalium Universitatis Sunyatseni,2025,64(03):173-182.
吴焚供,钟澎洪,覃跃海.框架下组稀疏非凸压缩感知问题:零空间性质与l2/lq (0<q≤1)-综合法[J].中山大学学报(自然科学版)(中英文),2025,64(03):173-182. DOI: 10.13471/j.cnki.acta.snus.ZR20240295.
WU Fengong,ZHONG Penghong,QIN Yuehai.Block sparse compressed sensing with frames: Null space property and l2/lq(0<q≤1)-synthesis[J].Acta Scientiarum Naturalium Universitatis Sunyatseni,2025,64(03):173-182. DOI: 10.13471/j.cnki.acta.snus.ZR20240295.
研究了基于
<math id="M13"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub><mo stretchy="false">(</mo><mn mathvariant="normal">0</mn><mo><</mo><mi>q</mi><mo>≤</mo><mn mathvariant="normal">1</mn><mo stretchy="false">)</mo></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497422&type=
4.06400013
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497408&type=
20.06599998
-综合法重构框架下具有组稀疏结构信号的重构条件及理论性能. 我们定义了一个框架意义下的新的零空间性质,称为
<math id="M14"><mi>D</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497409&type=
2.28600001
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497424&type=
2.20133328
-NSP
q
,并证明了测量矩阵满足
<math id="M15"><mi>D</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497409&type=
2.28600001
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497424&type=
2.20133328
-NSP
q
性质是
<math id="M16"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497425&type=
3.21733332
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497411&type=
4.99533367
-综合法精确重构框架下组稀疏信号的充要条件. 更进一步地,我们还证明了该零空间性质还是保障
<math id="M17"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497425&type=
3.21733332
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497411&type=
4.99533367
-综合法稳定重构框架下组稀疏信号的充要条件,并刻画了稳定重构的理论表现. 从现有研究文献来看,这是第一个保障
<math id="M18"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497425&type=
3.21733332
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497411&type=
4.99533367
-综合法稳定重构框架下组稀疏信号的充要条件.
This paper explores the recovery of block sparse signals in frame-based settings using the
<math id="M3"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497356&type=
3.80999994
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497377&type=
5.67266655
-synthesis technique (
<math id="M4"><mn mathvariant="normal">0</mn><mo><</mo><mi>q</mi><mo>≤</mo><mn mathvariant="normal">1</mn></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497357&type=
3.47133350
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497372&type=
16.17133331
). We propose a new null space property
referred to as block
<math id="M5"><mi>D</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497378&type=
2.62466669
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497393&type=
2.53999996
-NSP
q
which is based on the dictionary
<math id="M6"><mi>D</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497404&type=
2.62466669
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497394&type=
2.53999996
. We establish that matrices adhering to the block
<math id="M7"><mi>D</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497404&type=
2.62466669
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497394&type=
2.53999996
-NSP
q
condition are both necessary and sufficient for the exact recovery of block sparse signals via
<math id="M8"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497395&type=
3.80999994
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497420&type=
5.67266655
-synthesis. Additionally
this condition is essential for the stable recovery of signals that are block-compressible with respect to
<math id="M9"><mi>D</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497404&type=
2.62466669
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497394&type=
2.53999996
. This
<math id="M10"><mi>D</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497404&type=
2.62466669
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497394&type=
2.53999996
-NSP
q
property is identified as the first complete condition for successful signal recovery using
<math id="M11"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497421&type=
3.80999994
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497380&type=
5.67266655
-synthesis. Furthermore
we assess the theoretical efficacy of the
<math id="M12"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497397&type=
3.80999994
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82497407&type=
5.67266655
-synthesis method under conditions of measurement noise.
ALDROUBI A , CHEN X , POWELL A M , 2012 . Perturbations of measurement matrices and dictionaries in compressed sensing [J]. Appl Comput Harmon Anal , 33 ( 2 ): 282 - 291 .
BAJWA W U , CALDERBANK R , JAFARPOUR S , 2010 . Why Gabor frames?Two fundamental measures of coherence and their role in model selection [J]. J Commun Netw , 12 ( 4 ): 289 - 307 .
CAI T T , WANG L , XU G , 2010a . Shifting inequality and recovery of sparse signals [J]. IEEE Trans Signal Process , 58 ( 3 ): 1300 - 1308 .
CAI T T , WANG L , XU G , 2010b . New bounds for restricted isometry constants [J]. IEEE Trans Inf Theory , 56 ( 9 ): 4388 - 4394 .
CAI T T , ZHANG A , 2013a . Compressed sensing and affine rank minimization under restricted isometry [J]. IEEE Trans Signal Process , 61 ( 13 ): 3279 - 3290 .
CAI T T , ZHANG A , 2013b . Sharp RIP bound for sparse signal and low-rank matrix recovery [J]. Appl Comput Harmon Anal , 35 ( 1 ): 74 - 93 .
CAI T T , ZHANG A , 2014 . Sparse representation of a polytope and recovery of sparse signals and low-rank matrices [J]. IEEE Trans Inf Theory , 60 ( 1 ): 122 - 132 .
CANDÈS E J , ELDAR Y C , NEEDELL D , et al , 2011 . Compressed sensing with coherent and redundant dictionaries [J]. Appl Comput Harmon Anal , 31 ( 1 ): 59 - 73 .
CANDÈS E J , ROMBERG J K , TAO T , 2006 . Stable signal recovery from incomplete and inaccurate measurements [J]. Comm Pure Appl Math , 59 ( 8 ): 1207 - 1223 .
CANDÈS E J , TAO T , 2005 . Decoding by linear programming [J]. IEEE Trans Inf Theory , 51 ( 12 ): 4203 - 4215 .
CHARTRAND R , 2007 . Exact reconstruction of sparse signals via nonconvex minimization [J]. IEEE Signal Process Lett , 14 ( 10 ): 707 - 710 .
CHEN X M , WANG H C , WANG R R , 2014 . A null space analysis of the <math id="M485"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">1</mn></mrow></msub></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498529&type= 3.30200005 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498530&type= 1.86266661 -synthesis method in dictionary-based compressed sensing [J]. Appl Comput Harmon Anal , 37 ( 3 ): 492 - 515 .
COTTER S F , RAO B D , 2002 . Sparse channel estimation via matching pursuit with application to equalization [J]. IEEE Trans Commun , 50 ( 3 ): 374 - 377 .
DAVIES M E , GRIBONVAL R , 2009 . Restricted isometry constants where <math id="M486"><msup><mrow><mi>l</mi></mrow><mrow><mi>p</mi></mrow></msup></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498504&type= 2.45533323 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498531&type= 2.70933342 sparse recovery can fail for <math id="M487"><mn mathvariant="normal">0</mn><mo>≪</mo><mtext> </mtext><mi>p</mi><mo>≤</mo><mtext> </mtext><mn mathvariant="normal">1</mn></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498505&type= 2.96333337 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498532&type= 13.03866673 [J]. IEEE Trans Inf Theory , 55 ( 5 ): 2203 - 2214 .
DONOHO D L , 2006 . Compressed sensing [J]. IEEE Trans Inf Theory , 52 ( 4 ): 1289 - 1306 .
ELAD M , BRUCKSTEIN A M , 2002 . A generalized uncertainty principle and sparse representation in pairs of bases [J]. IEEE Trans Inf Theory , 48 ( 9 ): 2558 - 2567 .
ELAD M , MILANFAR P , RUBINSTEIN R , 2007 . Analysis versus synthesis in signal priors [J]. Inverse Probl , 23 ( 3 ): 947 - 968 .
FOUCART S , LAI M J , 2009 . Sparsest solutions of underdetermined linear systems via <math id="M488"><msub><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msub></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498506&type= 3.30200005 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498507&type= 1.86266661 -minimization for <math id="M489"><mn mathvariant="normal">0</mn><mo><</mo><mi>q</mi><mo>≤</mo><mn mathvariant="normal">1</mn></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498521&type= 2.96333337 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498533&type= 12.36133385 [J]. Appl Comput Harmon Anal , 26 ( 3 ): 395 - 407 .
FOUCART S , PAJOR A , RAUHUT H , et al , 2010 . The Gelfand widths of <math id="M490"><msub><mrow><mi>l</mi></mrow><mrow><mi>p</mi></mrow></msub></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498508&type= 3.30200005 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498535&type= 1.86266661 -balls for <math id="M491"><mn mathvariant="normal">0</mn><mo><</mo><mi>p</mi><mo>≤</mo><mn mathvariant="normal">1</mn></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498548&type= 2.96333337 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498509&type= 12.36133385 [J]. J Complexity , 26 ( 6 ): 629 - 640 .
FOUCART S , RAUHUT H , 2013 . A mathematical introduction to compressive sensing [M]. Basel : Birkhäuser .
GRIBONVAL R , NIELSEN M , 2003 . Sparse representations in unions of bases [J]. IEEE Trans Inf Theory , 49 ( 12 ): 3320 - 3325 .
HUANG J , HUANG X , METAXAS D , 2009 . Learning with dynamic group sparsity [C]// 2009 IEEE 12th International Conference on Computer Vision : 64 - 71 .
KASHIN B S , TEMLYAKOV V N , 2007 . A remark on compressed sensing [J]. Math Notes , 82 ( 5 ): 748 - 755 .
LAI M J , LIU Y , 2011 . The null space property for sparse recovery from multiple measurement vectors [J]. Appl Comput Harmon Anal , 30 ( 3 ): 402 - 406 .
LI S , LIN J H , 2014 . Compressed sensing with coherent tight frames via <math id="M492"><msub><mrow><mi>l</mi></mrow><mrow><mi mathvariant="normal">q</mi></mrow></msub></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498510&type= 3.21733332 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498550&type= 1.86266661 -minimization for <math id="M493"><mn mathvariant="normal">0</mn><mo><</mo><mi>q</mi><mo>≤</mo><mn mathvariant="normal">1</mn></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498538&type= 2.96333337 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498511&type= 12.36133385 [J]. Inverse Probl Imag , 8 ( 3 ): 761 - 777 .
LIN J H , LI S , 2014 . Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO [J]. Appl Comput Harmon Anal , 37 ( 1 ): 126 - 139 .
LIN J H , LI S , SHEN Y , 2013 . New bounds for restricted isometry constants with coherent tight frames [J]. IEEE Trans Signal Process , 61 ( 3 ): 611 - 621 .
LIU Y L , LI S D , MI T B , 2012a . Performance analysis of <math id="M494"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">1</mn></mrow></msub></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498551&type= 3.30200005 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498526&type= 1.86266661 -sy nthesis with coherent frames [EB/OL]. arXiv : 1202 . 2223 . https://arxiv.org/abs/1202.2223v2 https://arxiv.org/abs/1202.2223v2 .
LIU Y L , MI T B , LI S D , 2012b . Compressed sensing with general frames via optimal-dual-based <math id="M495"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">1</mn></mrow></msub></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498551&type= 3.30200005 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498526&type= 1.86266661 -analysis [J]. IEEE Trans Inf Theory , 58 ( 7 ): 4201 - 4214 .
LUO X H , YANG W Z , HA J C , et al , 2020 . Non-convex block-sparse compressed sensing with coherent tight frames [J]. EURASIP J Adv Signal Process , 2020 ( 1 ): 2 .
MAJUMDAR A , WARD R K , 2010 . Compressed sensing of color images [J]. Signal Process , 90 ( 12 ): 3122 - 3127 .
MO Q , LI S , 2011 . New bounds on the restricted isometry constant [J]. Appl Comput Harmon Anal , 31 ( 3 ): 460 - 468 .
PARVARESH F , VIKALO H , MISRA S , et al , 2008 . Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays [J]. IEEE J Sel Top Signal Process , 2 ( 3 ): 275 - 285 .
RAUHUT H , SCHNASS K , VANDERGHEYNST P , 2008 . Compressed sensing and redundant dictionaries [J]. IEEE Trans Inf Theory , 54 ( 5 ): 2210 - 2219 .
SAAB R , YILMAZ Ö , 2010 . Sparse recovery by non-convex optimization-instance optimality [J]. Appl Comput Harmon Anal , 29 ( 1 ): 30 - 48 .
SUN Q Y , 2011 . Sparse approximation property and stable recovery of sparse signals from noisy measurements [J]. IEEE Trans Signal Process , 59 ( 10 ): 5086 - 5090 .
SUN Q Y , 2012 . Recovery of sparsest signals via <math id="M496"><msup><mrow><mi>l</mi></mrow><mrow><mi>q</mi></mrow></msup></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498552&type= 2.45533323 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498558&type= 2.70933342 -minimization [J]. Appl Comput Harmon Anal , 32 ( 3 ): 329 - 341 .
TROPP J A , 2004 . Greed is good: Algorithmic results for sparse approximation [J]. IEEE Trans Inf Theory , 50 ( 10 ): 2231 - 2242 .
VIDAL R , MA Y , 2006 . A unified algebraic approach to 2-D and 3-D motion segmentation and estimation [J]. J Math Imag Vis , 25 ( 3 ): 403 - 421 .
WANG Y , WANG J J , XU Z B , 2013 . A note on block-sparse signal recovery with coherent tight frames [J]. Discrete Dyn Nat Soc , 2013: 905027 .
WU F G , LI D H , 2015 . The restricted isometry property for signal recovery with coherent tight frames [J]. Bull Aust Math Soc , 92 ( 3 ): 496 - 507 .
XU Z Q , 2012 . Compressed sensing: A survey [J]. Sci China Math , 42 ( 9 ): 865 - 877 .
ZHANG F , WANG J J , 2019 . Block-sparse compressed densing with redundant tight frames via <math id="M497"><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">2</mn></mrow></msub><mo>/</mo><msub><mrow><mi>l</mi></mrow><mrow><mn mathvariant="normal">1</mn></mrow></msub></math> https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498540&type= 3.21733332 https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=82498559&type= 5.07999992 -minimization [J]. Pure Appl Math , 35 ( 2 ): 138 - 150 ..
0
Views
41
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621