應(yīng)yl7703永利官網(wǎng)李朋副教授邀請，暨南大學(xué)網(wǎng)絡(luò) 空間安全學(xué)院溫金明教授,將于2022年4月7日(周四)下午15：00在線舉辦專題報(bào)告.

報(bào)告題目：Binary Sparse Signal Recovery with Binary Matching  Pursuit

報(bào)告時(shí)間：2021年4月7日(星期四)下午15：00

騰訊會(huì)議ID:  214-103-013

報(bào)告摘要:  In numerous applications from communications and signal processing,we often need to acquire a K-sparse binary signal from sparse noisy linear measurements.In this talk, we first develop an algorithm called Binary Matching Pursuit (BMP) to recover the K-sparse binary signal. According to whether the residual vector is explicitly formed or not at each iteration, we develop two implementations of BMP which are respectively called explicit BMP and implicit BMP. We then analyze their complexities and show that, compared to the Batch-OMP, which is the fastest implementation of OMP, the improvements of the explicit and implicit BMP algorithms are respectively n/(2K) and K times when some quantities are pre-computed. Finally, we provide sharp sufficient conditions of stable recovery of the support of the sparse signal using mutual coherence and restricted isometry property of the sensing matrix.

歡迎廣大師生光臨!

報(bào)告人簡介

溫金明,暨南大學(xué)教授、博導(dǎo)、國家高層次青年人才、廣東省青年珠江學(xué)者；2015年6月畢業(yè)于加拿大麥吉爾大學(xué)yl7703永利官網(wǎng)，獲哲學(xué)博士學(xué)位.從2015年3月到2018年8月,溫博士先后在法國科學(xué)院里昂并行計(jì)算實(shí)驗(yàn)室、加拿大阿爾伯塔大學(xué)、多倫多大學(xué)從事博士后研究工作。他的研究方向主要是整數(shù)信號(hào)和稀疏信號(hào)恢復(fù)的算法設(shè)計(jì)與理論分析.他以第一作者/通訊作者在Appl. Comput. Harmonic Anal、IEEE TIT、IEEE TSP等頂級(jí)期刊和會(huì)議發(fā)表近40篇學(xué)術(shù)論文.

甘肅應(yīng)用數(shù)學(xué)中心

甘肅省高校應(yīng)用數(shù)學(xué)與復(fù)雜系統(tǒng)省級(jí)重點(diǎn)實(shí)驗(yàn)室

yl7703永利官網(wǎng)

萃英學(xué)院

2022年4月6日